Non-clausal reasoning with propositional definite theories
In this paper we propose a non-clausal representational formalism (of definite formulas) that retains the syntactic flavor and algorithmic advantages of Horn clauses. The notion of a definite formula is generic in the sense that it is available to any logical calculus. We argue that efficient automated reasoning techniques which utilize definite formula representation of knowledge (such as SLD-resolution) can be developed for classical and a variety of non-classical logics.
KeywordsClassical Logic Conjunctive Normal Form Reduction Rule Horn Clause Classical Propositional Logic
Unable to display preview. Download preview PDF.
- 1.HÄhnle, R., Murray, N. and Rosenthal, E.: Completeness for Linear Regular Negation Normal Form Inference Systems. State University of New York, Albany, Technical Report 97-2 (1997).Google Scholar
- 2.Lloyd, J. W.: Foundations of Logic Programming, 2nd ed. Springer-Verlag (1987).Google Scholar
- 3.Malinowski, G.: Many-Valued Logics. Oxford University Press (1993).Google Scholar
- 5.McAllester, D.: Truth Maintenance. Proc. AAAI-90 (1990) 1109–1116.Google Scholar
- 8.Roy-Chowdhury, R. and Dalai, M.: Model Theoretic Semantics and Tractable Algorithm for CNF-BCP. Proc. AAAI-97 (1997) 227–232.Google Scholar
- 9.Shankar, S. and Slage, J.: Connection Based Strategies for Deciding Prepositional Temporal Logic. Proc. AAAI-97 (1997) 172–177.Google Scholar
- 10.Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer Academic Publishers (1996).Google Scholar