Abstract
Perfect discrimination trees [12] are used by many efficient resolution and superposition-based theorem provers (e.g. E-prover [17], Waldmeister [10], Logic Reasoner, ...) in order to efficiently implement rewriting and unit subsumption. We extend this indexing technique to handle a class of terms with integer exponents (or I-terms), a schematisation language allowing to capture sequences of iterated patterns [8]. We provide an algorithm to construct the so called perfect discrimination graphs from I-terms and to retrieve indexed I-terms from their instances. Our research is essentially motivated (but not restricted to) by some approaches to inductive proofs, for which termination of the proof procedure is capital.
This work has been partly funded by the project ASAP of the French Agence Nationale de la Recherche (ANR-09-BLAN-0407-01).
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
Bensaid, H., Caferra, R., Peltier, N.: Towards systematic analysis of theorem provers search spaces: First steps. In: Leivant, D., de Queiroz, R.J.G.B. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 38–52. Springer, Heidelberg (2007)
Bensaid, H., Caferra, R., Peltier, N.: Dei: A theorem prover for terms with integer exponents. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol. 5663, pp. 146–150. Springer, Heidelberg (2009)
Bouhoula, A., Kounalis, E., Rusinowitch, M.: Spike, an automatic theorem prover. In: Voronkov (ed.) [18], pp. 460–462
Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning 14, 14–189 (1995)
Bundy, A.: The automation of proof by mathematical induction. In: Robinson, Voronkov (eds.) [15], pp. 845–911
Chen, H., Hsiang, J., Kong, H.: On finite representations of infinite sequences of terms. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol. 516, pp. 100–114. Springer, Heidelberg (1991)
Comon, H.: Inductionless induction. In: David, R. (ed.) 2nd Int. Conf. in Logic For Computer Science: Automated Deduction. Lecture notes, Chambéry, Univ. de Savoie (1994)
Comon, H.: On unification of terms with integer exponents. Mathematical Systems Theory 28(1), 67–88 (1995)
Hermann, M., Galbavý, R.: Unification of infinite sets of terms schematized by primal grammars. Theor. Comput. Sci. 176(1-2), 111–158 (1997)
Hillenbrand, T., Buch, A., Vogt, R., Löchner, B.: Waldmeister - high-performance equational deduction. J. Autom. Reason. 18(2), 265–270 (1997)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison Wesley, Reading (2000)
McCune, W.: Experiments with discrimination-tree indexing and path indexing for term retrieval. J. Autom. Reasoning 9(2), 147–167 (1992)
Peltier, N.: Increasing model building capabilities by constraint solving on terms with integer exponents. Journal of Symbolic Computation 24(1), 59–101 (1997)
Ramakrishnan, I.V., Sekar, R.C., Voronkov, A.: Term indexing. In: Robinson, Voronkov (eds.) [15], pp. 1853–1964
Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier/MIT Press (2001)
Salzer, G.: The unification of infinite sets of terms and its applications. In: Voronkov [18], pp. 409–420
Schulz, S.: System description: E 0.81. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 223–228. Springer, Heidelberg (2004)
Voronkov, A. (ed.): LPAR 1992. LNCS, vol. 624. Springer, Heidelberg (1992)
Walsh, T.: A divergence critic for inductive proof. Journal of Artificial Intelligence Research 4(1), 209–235 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bensaid, H., Caferra, R., Peltier, N. (2010). Perfect Discrimination Graphs: Indexing Terms with Integer Exponents. In: Giesl, J., Hähnle, R. (eds) Automated Reasoning. IJCAR 2010. Lecture Notes in Computer Science(), vol 6173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14203-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-14203-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14202-4
Online ISBN: 978-3-642-14203-1
eBook Packages: Computer ScienceComputer Science (R0)