GLUE: Opening the world to theorem provers

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

Volumn 1265, Issue , 1997, Pages 410-419

  Neugebauer, Gerd ^a   Schäfer, Dorothea ^a  

^a University of Koblenz   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; GLUES; GLUING; LOGIC PROGRAMMING;

ACCESS METHODS; DISTRIBUTED SOURCES; EXTERNAL SOURCES; REAL-WORLD PROBLEM; STAND -ALONE; THEOREM PROVERS;

THEOREM PROVING;

EID: 33749724312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_31     Document Type: Conference Paper

References (7)

1. Peter Baumgartner. Refinements of theory model elimination and a variant without contrapositives. In A.G. Cohn, editor, 11th European Conference on Artificial Intelligence, ECAI’94, pages 90-94. Wiley, 1994.
2. Peter Baumgartner and Ulrich Furbach. Model elimination without contrapositives. In Bundy [4], pages 87-101.
3. Peter Baumgartner and Ulrich Furbach. PROTEIN: A Prover with a Theory Extension INterface. In Bundy [4], pages 769-773.
4. th Conference on Automated Deduction, Nancy, France, June/July 1994. Springer Verlag, Berlin, Heidelberg, New-York, 1994.
5. Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison Wesley, Reading, MA, 1973.
6. D. W. Loveland. A simplified version for the model elimination theorem proving procedure. Journal of the ACM, 16(3), 1969.
7. Mark E. Stickel. A Prolog Technology Theorem Prover: Implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4: 353-380, 1988.