By Topic

Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Joao Marques-Silva ; CSI/CASL, Univ. Coll. Dublin, Dublin, Ireland

The task of modeling and reasoning about real-world problems often involves analyzing overconstrained representations, where not all constraints of a problem can be simultaneously satisfied. The need to analyze over-constrained (or unsatisfiable) problems occurs in many settings, including data and knowledge bases, artificial intelligence, applied formal methods, operations research and description logics. In most cases, the problem to solve is related with some form of minimal unsatisfiability, i.e. an irreducible set of constraints that explains unsatisfiability. This paper provides an overview of some of the computational problems related with minimal unsatisfiability in Boolean logic, including the identification of one minimal unsatisfiable sub-formula and the identification of all minimal unsatisfiable sub-formulas. In addition, the paper briefly overviews practical applications of minimal unsatisfiability. Finally, the paper highlights recent work on minimal unsatisfiability in other domains.

Published in:

2010 40th IEEE International Symposium on Multiple-Valued Logic

Date of Conference:

26-28 May 2010