Abstract
We present a semi-decision procedure to prove ground theorems in Horn theories with built-in algebras. This is a maximal-unit-strategy based method, i.e in all our inference rules at least one of the premises clauses is an unit one. As in [4], constraint formalism is used as well; but more general specifications are studied. To limit the search space, an rpo-like ordering is used. Neither unification nor matching modulo the predefined algebra is needed. As a result, thanks to available constraint solvers on finite domains, naturals, integers, finite sets,... our method is easy to implement and it is actually efficient to prove ground theorems.
Thanks to Klaus Becker for his fruitful comments on this work.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Anantharaman, S., Andrianarivelo, N.: A semi-decision procedure in Horn Theories. technical report, Laboratoire d'Informatique Fondamentale d'Orléans-Laboratoire de Recherche en Informatique d'Orsay, (1991)
Bousdira, W., Andrianarivelo, N.: A rewrite-based strategy for theorem proving in first order logic with equality and ordering constraints. technical report, Laboratoire d'Informatique Fondamentale d'Orléans, (1994), 94-4
Avenhaus, J., Becker, K.: Conditional Rewriting modulo a Built-in Algebra. technical report Number 11, Universitat Kaiserslautern, West Germany, (1992)
Avenhaus, J., Becker, K.: Operational Specifications with Built-Ins. 7th Symposium on Theoretical Aspects of Computer Science, Caen, France, (1994), 263–274
Dershowitz, N.: Corrigendum to Termination of Rewriting. In Journal of Symbolic Computation, Vol. 4, 409–410
Dershowitz, N.: A maximal-literal strategy for Horn Clauses. 2nd International Workshop on Conditional Term Rewriting Systems, Montreal, Canada, (1990), 143–154
Ganzinger, H.: Ground Term Confluence in Parametric Conditional Equational Specifications. 4th annual Sympoisum on Theoretical Aspects of Computer Science, Passau, RFA, (1987), Vol. 247, 286–298
Kirchner, C. and Kirchner, H. and Rusinowitch, M.: Deduction with Symbolic Constraints. Revue Française d'Intelligence Artificielle, (1990), Vol. 4, Number. 3, 9–52
Kounalis, E., Rusinowitch, M.: Mechanizing Inductive Reasoning. EATCS Bulletin, Vol. 41, (1990), 216–226
Smolka, G.: Logic Programming over Polymorphically Order-Sorted Types. PHD Thesis, Universitat Kaiserslautern, West Germany, (1989)
Vorobyov, S.G.: Conditional Rewrite Rules Systems with Built-in Arithmetic and Induction. 3rd International Conference on Rewriting Techniques and Applications, Chapel Hill, North California, (1989), 492–512
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andrianarivelo, N., Bousdira, W., Talbot, J.M. (1996). On theorem-proving in Horn theories with built-in algebras. In: Calmet, J., Campbell, J.A., Pfalzgraf, J. (eds) Artificial Intelligence and Symbolic Mathematical Computation. AISMC 1996. Lecture Notes in Computer Science, vol 1138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61732-9_66
Download citation
DOI: https://doi.org/10.1007/3-540-61732-9_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61732-7
Online ISBN: 978-3-540-70740-0
eBook Packages: Springer Book Archive