Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae

Electronic Notes in Discrete Mathematics

Volumn 9, Issue , 2001, Pages 162-173

  Bruni, R ^a   Sassano, A ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

(Un)Satisfiability; Consistency restoring; MUS location

Indexed keywords

EID: 4444276081     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00320-8     Document Type: Article

References (14)

1. E. Amaldi, M.E. Pfetsch, and L. Trotter, Jr. Some structural and algorithmic properties of the maximum feasible subsystem problem, in proc. of 10th Integer Programming and Combinatorial Optimization conference., Lecture Notes in Computer Science 1610, Springer-Verlag, 45-59, 1999.
2. R. Battiti and M. Protasi. Approximate Algorithms and Heuristics for MAX-SAT. In D.Z. Du and P.M. Pardalos eds. Handbook of Combinatorial Optimization, Kluwer Academic Publishers, 1:77-148, 1998.
3. R. Bruni and A. Sassano. A Complete Adaptive Algorithm for Propositional Satisfiability. Technical Report 19-00, DIS, University of Rome "La Sapienza", 2000.
4. R. Bruni and A. Sassano. Optimization Techniques for an Error Free Data Collecting. Technical Report 01-01, DIS, University of Rome "La Sapienza", 2001.
5. V. Chandra and J.N. Hooker. Optimization Methods for Logical Inference. Wiley, New York, 1999.
6. J.W. Chinneck and E.W. Dravnieks. Locating Minimal Infeasible Constraint Sets in Linear Programs. ORSA Journal on Computing, 3:157-168, 1991.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. Assoc, for Comput. Mach., 5:394-397, 1962.
8. I.P. Gent and T. Walsh, editors. SAT 2000, Journal of Automated Reasoning, Volume 24, Issue 1/2, 2000.
9. J. Gu, P.W. Purdom, J. Franco, and B.W. Wah. Algorithms for the Satisfiability (SAT) Problem: A Survey. DIMACS Series in Discrete Mathematics, American Mathematical Society, 1999.
10. J.N. Hooker and V. Vinay. Branching Rules for Satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.
11. D.S. Johnson and M.A. Trick, editors. Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
12. D.W. Loveland. Automated Theorem Proving: a Logical Basis. North Holland, 1978.
13. n steps. Discrete Applied Mathematics, 10 287-295, 1985.
14. K. Truemper. Effective Logic Computation. Wiley, New York, 1998