Theory of linear and integer programming
Theory of linear and integer programming
A note on Dowling and Gallier's top-down algorithm for propositional horn satisfiability
Journal of Logic Programming
Acta Informatica
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
On finding solutions for extended Horn formulas
Information Processing Letters
A class of logic problems solvable by linear programming
Journal of the ACM (JACM)
The arborescence-realization problem
Discrete Applied Mathematics
Detecting IIS in infeasible linear programmes using techniques from goal programming
Computers and Operations Research
Recognizing balanced 0,±matrices
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
A short note on some tractable cases of the satisfiability problem
Information and Computation
Introduction to Linear Optimization
Introduction to Linear Optimization
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Errors Detection and Correction in Large Scale Data Collecting
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
Analyzing Infeasible Mixed-Integer and Integer Linear Programs
INFORMS Journal on Computing
Fast Heuristics for the Maximum Feasible Subsystem Problem
INFORMS Journal on Computing
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
Local-search Extraction of MUSes
Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Dealing Automatically with Exceptions by Introducing Specificity in ASP
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Boosting a complete technique to find MSS and MUS thanks to a local search oracle
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Extending Removed Sets Revision to partially preordered belief bases
International Journal of Approximate Reasoning
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Restoring CSP Satisfiability with MaxSAT
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A reasoning platform based on the MI shapley inconsistency value
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
A minimally unsatisfiable subformula (MUS) is a subset of clauses of a given CNF formula which is unsatisfiable but becomes satisfiable as soon as any of its clauses is removed. The selection of a MUS is of great relevance in many practical applications. This expecially holds when the propositional formula encoding the application is required to have a well-defined satisfiability property (either to be satisfiable or to be unsatisfiable). While selection of a MUS is a hard problem in general, we show classes of formulae where this problem can be solved efficiently. This is done by using a variant of Farkas' lemma and solving a linear programming problem. Successful results on real-world contradiction detection problems are presented.