Abstract
Automated theorem proving (ATP) is an important research area in artificial intelligence. The objective of an ATP system is to find out whether or not a query (or goal) is a logical consequence of a set of axioms (the query and the axioms have to be formally specified, for example in first-order clause logic). For this purpose, system-specific inference rules are applied systematically. A sequence of inference rule applications which shows that a given query is a logical consequence of a given set of axioms is called a proof.
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
References
Ibens, O.: Automated theorem proving with disjunctive constraints. Technical report AR-99-03, Institut für Informatik, TU München (1999)
Letz, R., Mayr, K., Goller, C.: Controlled Integration of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning 13, 297–337 (1994)
Sutcliffe, G., Suttner, C.B., Yemenis, T.: The TPTP problem library. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 778–782. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibens, O. (1999). Automated Theorem Proving with Disjunctive Constraints. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive