Integrating linear arithmetic into superposition calculus

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

Volumn 4646 LNCS, Issue , 2007, Pages 223-237

  Korovin, Konstantin ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; FORMAL LOGIC; INTEGRATION;

FINITENESS ASSUMPTIONS; FIRST ORDER LOGIC; LINEAR ARITHMETIC; SUPERPOSITION CALCULUS;

NUMERICAL ANALYSIS;

EID: 38049091964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_19     Document Type: Conference Paper

References (14)

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University press, Cambridge (1998)
2. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, pp. 19-100. Elsevier, Amsterdam (2001)
3. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational Theorem Proving for Hierarchic First-Order Theories. Applicable Algebra in Engineering, Communication and Computing 5(3/4), 193-212 (1994)
4. Godoy, G., Nieuwenhuis, R.: Superposition with completely built-in Abelian groups. J. Symb. Comput. 37(1), 1-33 (2004)
5. Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics with a concrete domain in the framework of resolution. In: ECAI, pp. 353-357 (2004)
6. Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. Journal version (in preparation)
7. Le Chenadec, P.: Canonical forms in finitely presented algebras. Research Notes in Theoretical Computer Science, Wiley, Chichester (1986)
8. Marché, C.: Normalized rewriting: An alternative to rewriting modulo a set of equations. J. Symb. Comput. 21(3), 253-288 (1996)
9. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 371-443. Elsevier, Amsterdam (2001)
10. Rogers, H. : Theory of recursive functions and effective computability. MIT Press, Cambridge (1988)
11. Rubio, A., Nieuwenhuis, R.: A precedence-based total AC-compatible ordering. In: Kirchner, C. (ed.) Rewriting Techniques and Applications. LNCS, vol. 690, pp. 374-388. Springer, Heidelberg (1993)
12. Stuber, J.: Superposition theorem proving for Abelian groups represented as integer modules. Theor. Comput. Sci. 208(1-2), 149-177 (1998)
13. Waldmann, U.: Superposition and chaining for totally ordered divisible Abelian groups. In: International Joint Conference for Automated Reasoning, pp. 226-241 (2001)
14. Waldmann, U.: Cancellative Abelian monoids and related structures in refutational theorem proving (part I, II). Journal of Symbolic Computation 33(6), 777-829, 831-861 (2002)