Consistent subsets of inconsistent systems: structure and behaviour

A large Knowledge System operating for a long time almost inevitably becomes ‘polluted’ by wrong data that make the system inconsistent. Despite this fact, a sizeable part of the system remains unpolluted, and retains useful information. It is widely adopted that a maximally consistent subset of a system (mc-subset) contains a significant portion of unpolluted data. So, determining mc-subsets is a necessary step towards reasoning with inconsistent knowledge. We consider extensions of the MAX-SAT problem, investigate characteristic features of mc-subsets, present algorithms for computing all or major mc-subsets of inconsistent sets of clauses, and, report results of experiments evaluating parameters of mc-subsets.

[1]  John K. Slaney.  The Implications of Paraconsistency , 1991, IJCAI.

[2]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.

[3]  Sarit Kraus,et al.  Combining Knowledge Bases Consisting of First Order Theories , 1991, ISMIS.

[4]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[5]  Jinchang Wang.  Branching rules for propositional satisfiability test , 1996, Satisfiability Problem: Theory and Applications.

[6]  Mamede Lima-Marques,et al.  Contextual Negations and Reasoning with Contradictions , 1991, IJCAI.

[7]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[8]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[9]  Michael Kifer,et al.  RI: a logic for reasoning with inconsistency , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[10]  Donald Perlis.  Truth and Meaning , 1989, Artif. Intell..

[11]  Gerd Wagner.  Ex contradictione nihil sequitur , 1991, IJCAI.

[12]  D. Davidson.  Truth and meaning , 2004, Synthese.

[13]  Bart Selman,et al.  An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[14]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[15]  Roberto Battiti,et al.  Approximate Algorithms and Heuristics for MAX-SAT , 1998 .

[16]  Ronald Fagin,et al.  A Nonstandard Approach to the Logical Omniscience Problem , 1990, Artif. Intell..

[17]  Luca Trevisan.  Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.

[18]  V. Vinay,et al.  Branching rules for satisfiability , 1995, Journal of Automated Reasoning.

[19]  Tad Hogg,et al.  A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty , 1997, J. Artif. Intell. Res..

[20]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.

[21]  S. Srinivasa Rao,et al.  A Simplified NP-Complete MAXSAT Problem , 1998, Inf. Process. Lett..

[22]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[23]  Toby Walsh,et al.  The Satisfiability Constraint Gap , 1996, Artif. Intell..

[24]  Newton C. A. da Costa,et al.  On the theory of inconsistent formal systems , 1974, Notre Dame J. Formal Log..

[25]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[26]  John Grant,et al.  Classifications for inconsistent theories , 1978, Notre Dame J. Formal Log..

[27]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[28]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[29]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[30]  Takao Asano,et al.  Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[31]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[32]  Brigitte Jaumard,et al.  On the Complexity of the Maximum Satisfiability Problem for Horn Formulas , 1987, Inf. Process. Lett..

[33]  Lawrence J. Henschen,et al.  Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation , 1990, CADE.

[34]  Nicholas Rescher,et al.  The Logic of Inconsistency: a study in nonstandard possible-world semantics and ontology , 1979 .

[35]  Lynn Andrea Stein,et al.  Skeptical Inheritance: Computing the Intersection of Credulous Extensions , 1989, IJCAI.

[36]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[37]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[38]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[39]  Graham Priest,et al.  Reasoning About Truth , 1989, Artif. Intell..

[40]  Arthur Buchsbaum,et al.  The Logic of Epistemic Inconsistency , 1991, KR.

[41]  D. Davidson.  Truth and Meaning , 1967 .

[42]  Takao Asano,et al.  Approximation Algorithms for the Maximum Satisfiability Problem , 1996, Nord. J. Comput..

[43]  Eliezer L. Lozinskii,et al.  Resolving contradictions: A plausible semantics for inconsistent systems , 1994, Journal of Automated Reasoning.