<--- Back to Details
First PageDocument Content
Logic in computer science / Automated theorem proving / Constraint programming / Boolean algebra / Propositional calculus / Unsatisfiable core / Boolean satisfiability problem / Resolution / Maximum satisfiability problem / Satisfiability / Package manager / Debian
Date: 2008-12-16 11:04:43
Logic in computer science
Automated theorem proving
Constraint programming
Boolean algebra
Propositional calculus
Unsatisfiable core
Boolean satisfiability problem
Resolution
Maximum satisfiability problem
Satisfiability
Package manager
Debian

sets-graph-msuc-opt.ipeps

Add to Reading List

Source URL: tmancini.di.uniroma1.it

Download Document from Source Website

File Size: 134,40 KB

Share Document on Facebook

Similar Documents

Automated theorem proving / Logic in computer science / Propositional calculus / Unsatisfiable core / Boolean algebra / Resolution / Exponential time hypothesis / Algorithm / Maximum satisfiability problem / Boolean satisfiability problem / DavisPutnam algorithm

On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2

DocID: 1pFKE - View Document

Logic in computer science / Automated theorem proving / Constraint programming / Boolean algebra / Propositional calculus / Unsatisfiable core / Boolean satisfiability problem / Resolution / Maximum satisfiability problem / Satisfiability / Package manager / Debian

sets-graph-msuc-opt.ipeps

DocID: 1pkHb - View Document

Video signal / Mathematics / PP / Algorithm / Unsatisfiable core / Mathematical logic / Interpolation / Video

What Gives? A Hybrid Algorithm for Error Trace Explanation Vijayaraghavan Murali1 , Nishant Sinha2 , Emina Torlak3 , and Satish Chandra4 1 NUS, Singapore

DocID: 18Gpq - View Document

Model theory / Automated theorem proving / Boolean algebra / Resolution / Interpolation / First-order logic / Interpretation / Unsatisfiable core / Atomic formula / Logic / Mathematical logic / Propositional calculus

Instantiations, Zippers and EPR Interpolation Nikolaj Bjørner, Arie Gurfinkel, Konstantin Korovin and Ori Lahav Microsoft Research, Software Engineering Institute, University of Manchester, Tel Aviv University Abstract

DocID: 18EQ6 - View Document

NP-complete problems / Constraint programming / Logic in computer science / Propositional calculus / Unsatisfiable core / Electronic design automation / Boolean satisfiability problem / Symmetry / Satisfiability / Theoretical computer science / Mathematics / Applied mathematics

A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina Torlak

DocID: 18m13 - View Document