Abstract
We present a method of integrating linear rational arithmetic into superposition calculus for first-order logic. One of our main results is completeness of the resulting calculus under some finiteness assumptions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University press, Cambridge (1998)
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)
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)
Godoy, G., Nieuwenhuis, R.: Superposition with completely built-in Abelian groups. J. Symb. Comput. 37(1), 1–33 (2004)
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)
Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. Journal version (in preparation)
Le Chenadec, P.: Canonical forms in finitely presented algebras. In: Research Notes in Theoretical Computer Science, Wiley, Chichester (1986)
Marché, C.: Normalized rewriting: An alternative to rewriting modulo a set of equations. J. Symb. Comput. 21(3), 253–288 (1996)
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)
Rogers, H.: Theory of recursive functions and effective computability. MIT Press, Cambridge (1988)
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)
Stuber, J.: Superposition theorem proving for Abelian groups represented as integer modules. Theor. Comput. Sci. 208(1-2), 149–177 (1998)
Waldmann, U.: Superposition and chaining for totally ordered divisible Abelian groups. In: International Joint Conference for Automated Reasoning, pp. 226–241 (2001)
Waldmann, U.: Cancellative Abelian monoids and related structures in refutational theorem proving (part I, II). Journal of Symbolic Computation 33(6), 777–829 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korovin, K., Voronkov, A. (2007). Integrating Linear Arithmetic into Superposition Calculus. In: Duparc, J., Henzinger, T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74915-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-74915-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74914-1
Online ISBN: 978-3-540-74915-8
eBook Packages: Computer ScienceComputer Science (R0)