PTTP+GLiDeS: Guiding linear deductions with semantics

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

Volumn 1747, Issue , 1999, Pages 244-254

  Brown, Marianne ^a   Sutcliffe, Geoff ^a  

^a JAMES COOK UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

AUTOMATED THEOREM PROVING; LIMITED ATTENTIONS; MODEL GENERATOR;

SEMANTICS;

EID: 84957682309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46695-9_21     Document Type: Conference Paper

References (18)

1. A. Bundy. The Computer Modelling of Mathematical Reasoning. Academic Press, 1983.
2. H. Chu. CLIN-S User’s Manual. Chapel Hill, USA, 1994.
3. D.A. de Waal and J.P. Gallagher. The Applicability of Logic Programming Analysis and Transformation to Theorem Proving. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, number 814 in Lecture Notes in Artificial Intelligence, pages 207-221. Springer-Verlag, 1994.
4. D.W. Loveland. Mechanical Theorem Proving by Model Elimination. Journal of the ACM, 15(2):236-251, 1968.
5. D.W. Loveland. A Linear Format for Resolution. In Laudet M. et al, editor, Proceedings of the IRIA Symposium on Automatic Demonstration, pages 147-162. Springer-Verlag, 1970.
6. D. Luckham. Some Tree-paring Strategies for Theorem Proving. Machine Intelligence, 3:95-112, 1968.
7. D. Luckham. Refinement Theorems in Resolution Theory. In Laudet M. et al., editor, Proceedings of the Symposium on Automatic Demonstration, pages 163-190. Springer-Verlag, 1970.
8. W.W. McCune. A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasigroup Existence Problems. Technical Report Technical Report ANL/MCS-TM-194, Argonne National Laboratory, Argonne, USA, 1994.
9. J.A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, 12(1):23-41, January 1965.
10. J.R. Slagle. Automatic Theorem Proving with Renamable and Sematic Resolution. Journal of the ACM, 14:687-697, October 1967.
11. J.K. Slaney. SCOTT: A Model-Guided Theorem Prover. In R. Bajcsy, editor, Proceedings of the 13th International Conference on Artificial Intelligence, pages 109-114. Morgan-Kaufman, 1993.
12. M.E. Stickel. A Prolog Technology Theorem Prover. In Proceedings of the 1st International Symposium on Logic Programming, pages 211-217. IEEE Computer Society Press, 1984.
13. M.E. Stickel. A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. Technical Report Technical Note 464, SRI International, Menlo Park, USA, 1989.
14. G. Sutcliffe. Linear-Input Subset Analysis. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, number 607 in Lecture Notes in Artifical Intelligence, pages 268-280, Saratoga Springs, NY, USA, June 1992. Springer-Verlag.
15. G. Sutcliffe and C.B. Suttner. The TPTP Problem Library: CNF Release vl.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
16. L. Wos. Automated Reasoning - 33 Basic Research Problems. Prentice-Hall, 1988.
17. L. Wos, D. Carson, and G.A. Robinson. The Unit Preference Strategy in Theorem Proving. In Proceedings of the AFIPS1964 FaM Joint Computer Conference, pages 615-621. Spartan Books, 1964.
18. L. Wos, R. Overbeek, E. Lusk, and J. Boyle. Automated Reasoning Introduction and Applications. Prentice-Hall, Englewood Cliffs, New Jersey, 1984.