Abstract
Inconsistencies inevitably arise in knowledge during practical reasoning. In a logic-based approach, this gives rise to the need for consistency checking. Unfortunately, this can be difficult. In classical propositional logic, this is intractable. However, there is a useful alternative to the notion of consistency called probable consistency. This offers a weakening of classical consistency checking where polynomial time tests are done on a set of formulae to determine the probability that the set of formulae is consistent. In this paper, we present a framework for probable consistency checking for sets of clauses, and analyse some classes of polynomial time tests.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Darwiche, A.: Compiling knowledge into decomposible negation normal form. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 284–289 (1999)
Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34, 1–38 (1987)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman, New York (1979)
Koriche, F.: On anytime coherence-based reasoning. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 556–567. Springer, Heidelberg (2001)
Levesque, H.: Alogic of implicit and explicit belief. In: Proceedings of the National Conference on Artificial Intelligence (AAAI 1984), pp. 198–202 (1984)
Marquis, P.: Knowledge compilation using prime implicates. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 837–843 (1995)
Oppacher, F., Suen, E.: HARP: A tableau-based theorem prover. Journal of Automated Reasoning 4, 69–100 (1988)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence 74, 249–310 (1995)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), pp. 440–446 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hunter, A. (2003). Probable Consistency Checking for Sets of Propositional Clauses. In: Nielsen, T.D., Zhang, N.L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2003. Lecture Notes in Computer Science(), vol 2711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45062-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-45062-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40494-1
Online ISBN: 978-3-540-45062-7
eBook Packages: Springer Book Archive