Modular proof systems for partial functions with weak equality

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3097, Issue , 2004, Pages 168-182

  Ganzinger, Harald ^a   Sofronie Stokkermans, Viorica ^a   Waldmann, Uwe ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS; AUTOMATION; CALCULATIONS; THEOREM PROVING;

PARTIAL FUNCTIONS; POLYNOMIAL TIME DECIDABILITY; REFUTATIONAL THEOREM; SUPERPOSITION CALCULUS; FIRST ORDER THEORIES; PROOF SYSTEM;

FUNCTIONS; COMPUTATION THEORY;

EID: 9444282139     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25984-8_10     Document Type: Conference Paper

References (15)

1. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
2. Leo Bachmair and Harald Ganzinger. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM, 45(6), 1998.
3. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing, 5(3/4):193-212, 1994.
4. Peter Burmeister. A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application of Partial Algebras, Part I, vol. 31 of Mathematical Research. Akademie-Verlag, Berlin, 1986.
5. Stanley Burris. Polynomial time uniform word problems. Mathematical Logic Quarterly, 41:173-182, 1995.
6. T. Evans. Embeddability and the word problem. J. London Math. Soc., 28:76-80, 1953.
7. Harald Ganzinger. Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems. In Sixteenth Annual IEEE Symposium on Logic in Computer Science, 2001, pp. 81-92. IEEE Computer Society Press.
8. Silvio Ghilardi. Quantifier elimination and provers integration. Electronic Notes in Theoretical Computer Science, 86(1), 2003.
9. George Grätzer. Universal algebra. Springer Verlag, 2. edition, 1968.
10. Manfred Kerber and Michael Kohlhase. A mechanization of strong Kleene logic for partial functions. In Alan Bundy, ed., Twelfth International Conference on Automated Deduction, Nancy, France, 1994, LNAI 814, pp. 371-385. Springer-Verlag.
11. Stephen C. Kleene. Introduction to Metamathematics. D. Van Nostrand Company, Inc., Princeton, New Jersey, 1952.
12. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
13. Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-31, 2003.
14. Cesare Tinelli and Mehdi Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Franz Baader and Klaus U. Schulz, eds., Frontiers of Combining Systems, First International Workshop, Munich, Germany, 1996, Applied Logic Series, Vol. 3, pp. 103-119. Kluwer Academic Publishers.
15. Cesare Tinelli and Calogero Zarba. Combining non-stably infinite theories. Electronic Notes in Theoretical Computer Science, 86(1), 2003.