Completeness for linear regular negation normal form inference systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1325, Issue , 1997, Pages 590-599

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

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b State University of New York   (United States)

^c UNIVERSITY OF NEW HAVEN   (United States)

Author keywords

Completeness; Logic for artificial intelligence; Negation normal form; Non clausal inference; Resolution; Tableau method

Indexed keywords

BIOMINERALIZATION; INTELLIGENT SYSTEMS; OPTICAL RESOLVING POWER;

COMPLETENESS; LOGIC FOR ARTIFICIAL INTELLIGENCES; NON-CLAUSAL; NORMAL FORM; TABLEAU METHOD;

BOOLEAN FUNCTIONS;

EID: 84947792202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63614-5_57     Document Type: Conference Paper

References (15)

1. Anderson, R., and Bledsoe, W., A linear format for resolution with merging and a new technique for establishing completeness, J. ACM 17(3) (1970), 525-534.
2. Baumgartner, P. and Furbach, U. Model elimination without contrapositives. Proc. 12th Conference on Automated Deduction CADE, Nancy/France. In Lecture Notes in Artificial Intelligence, (Bundy, Ed.), Springer-Verlag, Vol. 814, 87-101.
3. Bibel, W, On matrices with connections, J. ACM 28 (1981), 633-645.
4. Davis, M. and Putnam, H. A computing procedure for quantification theory. J. ACM7, 1960, 201-215.
5. Hehnle, R., Murray, N. V. and Rosenthal, E. On proving completeness. Tech. Rep. TR 96-6, Dept. of Comp. Sci., SUNY Albany, NY, December, 1996.
6. Kowalski, R. and Kuehner D., Linear Resolution with Selection Function. Artificial Intelligence, 2(3), (1971), 227-260.
7. Letz, R., First-order calculi and proof procedures for automated deduction, Ph. D. dissertation, TU Darmstadt.
8. Lovetand, D. W., Automated Theorem Proving: A Logical Basis, North-Holland, New York (1978).
9. Murray, N. V., and Rosenthal, E., Inference with path resolution and semantic graphs. J. ACM 34, 2 (1987), 225-254.
10. Murray, N. V., and Rosenthal, E. Dissolution: Making paths vanish. J. ACM 40, 3 (July 1993), 504-535.
11. Oppacher, F. and Suen, E. HARP: A tableau-based theorem prover, Journal of Automated Reasoning 4 (1988), 69-100.
12. Ramesh, A. and Murray, N. V. An application of non-clausal deduction in diagnosis. Proceedings of the Eighth International Symposium on Artificial Intelligence, Monterrey, Mexico, October 17-20, 1995, 378-385.
13. Reiter, R., A theory of diagnosis from first principles. A. I. Journal, 32 (1987), 57-95.
14. Smullyan, R. M., First-Order Logic (2 nd Edition), Dover Press, 1995.
15. Wallace, K. and Wrightson, G. Regressive merging in model elimination tableaubased theorem provers, Journal of the Interest Group in Pure and Applied Logics, (Special Issue: Selected Papers from Tableaux'94), 3 (Oct. 1995), 921-938.