Consistent subsets of inconsistent systems: structure and behaviour
- 1 January 2003
- journal article
- research article
- Published by Informa UK Limited in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 15 (1), 25-46
- https://doi.org/10.1080/0952813021000026795
Abstract
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.Keywords
This publication has 21 references indexed in Scilit:
- Approximate Algorithms and Heuristics for MAX-SATPublished by Springer Science and Business Media LLC ,1998
- A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT ProblemsJournal of Combinatorial Optimization, 1998
- The satisfiability constraint gapArtificial Intelligence, 1996
- A nonstandard approach to the logical omniscience problemArtificial Intelligence, 1995
- COMBINING KNOWLEDGE BASES CONSISTING OF FIRST-ORDER THEORIESComputational Intelligence, 1992
- Paraconsistent logic programmingTheoretical Computer Science, 1989
- Classifications for inconsistent theories.Notre Dame Journal of Formal Logic, 1978
- On the theory of inconsistent formal systems.Notre Dame Journal of Formal Logic, 1974
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960