Linear Paramodulation modulo Equality

作者: Ulrich Furbach , Steffen Hölldobler , Joachim Schreiber

DOI: 10.1007/978-3-642-75100-4_13

关键词:

摘要: We propose to use E-paramodulation, i.e. linear paramodulation modulo equality, compute with generalized equational programs consisting of a conditional theory and program. Simple examples from deduction systems motivate our approach. formally define the calculus for which is based on inference rules E-paramodulation E-reflection. This proven be sound complete by using fixpoint theory. Finally, we discuss why functional reflexive axioms have used ensure these results.

参考文章(23)
Hans-Jürgen Bitrckert, Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung. pp. 277- 288 ,(1986) , 10.1007/978-3-642-71385-9_28
Steffen Hölldobler, From Paramodulation to Narrowing. international conference on lightning protection. pp. 327- 342 ,(1988)
John Wylie Lloyd, Foundations of logic programming ,(1984)
Peter Padawitz, Computing in Horn Clause Theories ,(2011)
Jieh Hsiang, Michael Rusinowitch, On word problems in equational theories international colloquium on automata, languages and programming. pp. 54- 71 ,(1987) , 10.1007/3-540-18088-5_6
Jean -Pierre Jouannaud, Claude Kirchner, Helene Kirchner, Incremental Construction of Unification Algorithms in Equational Theories international colloquium on automata, languages and programming. pp. 361- 373 ,(1983) , 10.1007/BFB0036921
Gérard Huet, Derek C. Oppen, Equations and rewrite rules: a survey Formal Language Theory#R##N#Perspectives and Open Problems. pp. 349- 405 ,(1980) , 10.1016/B978-0-12-115350-2.50017-8
Jean H. Gallier, Wayne Snyder, A General Complete E-Unification Procedure rewriting techniques and applications. pp. 216- 227 ,(1987) , 10.1007/3-540-17220-3_19
Ulrich Furbach, Steffen H�lldobler, Joachim Schreiber, Horn equational theories and paramodulation Journal of Automated Reasoning. ,vol. 5, pp. 309- 337 ,(1989) , 10.1007/BF00248322