Deriving focused calculi for transitive relations

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

Volumn 2051 LNCS, Issue , 2001, Pages 291-305

  Struth, Georg ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PATHOLOGY; SEMANTICS;

INFERENCE RULES; KNUTH-BENDIX COMPLETION; MODULAR APPROACH; ORDERED RESOLUTION; POSTERIORI; PROCEDURAL ASPECTS; SEMANTIC COMPLETENESS; TRANSITIVE RELATION;

BIOMINERALIZATION;

EID: 23044526897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_22     Document Type: Conference Paper

References (15)

1. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. Logic and Computation, 4(3):217-247, 1994.
2. L. Bachmair and H. Ganzinger. Rewrite techniques for transitive relations. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 384-393. IEEE Computer Society Press, 1994.
3. L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM, 45(6):1007-1049, 1998.
4. L. Bachmair and H. Ganzinger. Strict basic superposition. In 15th International Conference on Automated Deduction, volume 1421 of LNAI, pages 160-17 4. Springer-Verlag, 1998.
5. W. Bledsoe, K. Kunen, and R. Shostak. Completeness results for inequality provers. Artificial Intelligence, 27:255-288, 1985.
6. W. W. Bledsoe and L. M. Hines. Variable elimination and chaining in a resolution-based prover for inequalities. In W. Bibel and R. Kowalski, editors, 5th Conference on Automated Deduction, volume 87 of LNCS, pages 70-87. Springer-Verlag, 1980.
7. L. M. Hines. Completeness of a prover for dense linear logics. J. Automated Reasoning, 8:45-75, 1992.
8. J. Levy and J. Agustí. Bi-rewrite systems. J. Symbolic Computation, 22:279-314, 1996.
9. U. Martin and T. Nipkow. Ordered rewriting and confluence. In M. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of LNCS, pages 366-380. Springer-Verlag, 1990.
10. M. M. Richter. Some reordering properties for inequality proof trees. In E. Borger, G. Hasenjaeger, and D. Rödding, editors, Logic and Machines: Decision Problems and Complexity, Proc. Symposium "Rekursive Kombinatorik", volume 171 of LNCS, pages 183-197. Springer-Verlag, 1983.
11. J. R. Slagle. Automatic theorem proving with built-in theories including equality, partial ordering, and sets. Journal ofthe ACM, 19(1):120-135, 1972.
12. M. Stickel. Automated deduction by theory resolution. In A. Joshi, editor, 9th International Joint Conference on Artificial Intelligence, pages 1181-1186. Morgan Kaufmann, 1985.
13. G. Struth. Deriving focused calculi for transitive relations (extended version). http://www.informatik.uni-freiburg.de/~struth/papers/focus.ps.gz.
14. G. Struth. Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut für Informatik, Universität des Saarlandes, 1998.
15. L. Wos, G.A. Robinson, and D.F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal ofthe ACM, 12(4):536-541, 1965.