Linearity and regularity with negation normal form

Theoretical Computer Science

Volumn 328, Issue 3, 2004, Pages 325-354

  Hähnle, Reiner ^a   Murray, Neu V ^b   Rosenthal, Erik ^c  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b State University of New York   (United States)

^c UNIVERSITY OF NEW HAVEN   (United States)

Author keywords

Automated theorem proving; Excess literal technique; Linear resolution; Negation normal form; Non clausal resolution; Regular tableaux; Resolution; Tableaux

Indexed keywords

AUTOMATION; COMPUTATIONAL METHODS; COMPUTER SCIENCE; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS;

AUTOMATED THEOREM PROVING; EXCESS LITERAL TECHNIQUE; LINEAR RESOLUTION; NEGATION NORMAL FORM; NON-CLAUSAL RESOLUTION; REGULAR TABLEAUX; RESOLUTION; TABLEAUX;

THEOREM PROVING;

EID: 9544254853     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.001     Document Type: Article

References (24)

1. R. Anderson, W. Bledsoe, A linear format for resolution with merging and a new technique for establishing completeness, J. Assoc. Comput. Mach. 17 (3) (1970) 525-534.
2. P.B. Andrews, Theorem proving via general matings, J. Assoc. Comput. Mach. 28 (2) (1981) 193-214.
3. L. Bachmair, H. Ganzinger, Resolution theorem proving, in: A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, Vol. 1, Elsevier, Amsterdam, 2001, pp. 19-100 (Chapter 2).
4. P. Baumgartner, U. Furbach, Model elimination without contrapositives, in: Bundy (Ed.), Proc. 12th Conf. on Automated Deduction CADE, Nancy, France, Lecture Notes in Artificial Intelligence, Vol. 814, Springer, Berlin, 1994, pp. 87-101.
5. W. Bibel, On matrices with connections, J. Assoc. Comput. Mach. 28 (1981) 633-645.
6. M. D'Agostino, D.M. Gabbay, R. Hähnle, J. Posegga, Handbook of Tableau Methods, Kluwer Academic Publishers, Dordrecht, 1999.
7. M. Davis, H. Putnam, A computing procedure for quantification theory, J. Assoc. Comput. Mach. 7 (1960) 201-215.
8. M. Fitting, First-Order Logic and Automated Theorem Proving, second ed., Springer, New York, 1996.
9. R. Hähnle, Tableaux and related methods, in: A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, Vol. 1, Elsevier, Amsterdam, 2001, pp. 101-178 (Chapter 3).
10. R. Hähnle, N.V. Murray, E. Rosenthal, Completeness for linear regular negation normal form inference systems, Proc. of the Tenth Internat. Symp. on Methodologies for Intelligent Systems, Charlotte, NC, Lecture Notes in Artificial Intelligence, Vol. 1325, Springer, Berlin, 1997, pp. 590-599.
11. R. Kowalski, D. Kuehner, Linear resolution with selection function, Artificial Intelligence 2 (3) (1971) 227-260.
12. R. Letz, First-order calculi and proof procedures for automated deduction, Ph.D. Dissertation, TU Darmstadt, 1993.
13. D.W. Loveland, Automated Theorem Proving: A Logical Basis, North-Holland, New York, 1978.
14. Z. Manna, R. Waldinger, A deductive approach to program synthesis, ACM Trans. Progr. Languages Systems 2 (1) (1980) 90-121.
15. Z. Manna, R. Waldinger, Special relations in automated deduction, J. Assoc. Comput. Mach. 33 (1) (1986) 1-59.
16. N.V. Murray, Completely non-clausal theorem proving, Artificial Intelligence 18(1) (1982) 67-85.
17. N.V. Murray, E. Rosenthal, Inference with path resolution and semantic graphs, J. Assoc. Comput. Mach. 34 (2) (1987) 225-254.
18. N.V. Murray, E. Rosenthal, Dissolution: making paths vanish, J. Assoc. Comput. Mach. 40 (3) (1993) 504-535.
19. A. Ramesh, N.V. Murray, An application of non-clausal deduction in diagnosis, in: Proc. of the Eighth Internat. Symp. on Artificial Intelligence, Monterrey, Mexico, 1995, pp. 378-385.
20. R. Reiter, A theory of diagnosis from first principles, Artificial Intelligence J. 32 (1987) 57-95.
21. J.A. Robinson, The generalized resolution principle, in: D. Michie (Ed.), Machine Intelligence, Vol. 3, American Elsevier, New York, 1968, pp. 77-94.
22. E.E. Sibert, A machine-oriented logic incorporating the equality relation, in: Meltzer, Michie (Eds.), Machine Intelligence, Vol. 4, Edinburgh University Press, Edinburgh, 1969, pp. 103-133.
23. R.M. Smullyan, First-Order Logic, second ed., Dover Press, New York, 1995.
24. K. Wallace, G. Wrightson, Regressive merging in model elimination tableau-based theorem provers, J. Interest Group Pure Appl. Logics (Special Issue: Selected Papers from Tableaux'94) 3 (1995) 921-938.