Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings
暂无分享,去创建一个
Albert Rubio | Robert Nieuwenhuis | Guillem Godoy | Miquel Bofill | R. Nieuwenhuis | A. Rubio | Miquel Bofill | G. Godoy | Guillem Godoy
[1] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[2] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.
[3] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.
[4] Nachum Dershowitz,et al. Orderings for Equational Proofs , 1986, LICS.
[5] Nachum Dershowitz,et al. Existence, Uniqueness, and Construction of Rewrite Systems , 1988, SIAM J. Comput..
[6] Hervé Devie,et al. Linear Completion , 1990, CTRS.
[7] C. Kirchner,et al. Deduction with symbolic constraints , 1990 .
[8] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[9] Michaël Rusinowitch,et al. Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.
[10] Michaël Rusinowitch,et al. Any Gound Associative-Commutative Theory Has a Finite Canonical System , 1991, RTA.
[11] Claude Marché,et al. On Ground AC-Completion , 1991, RTA.
[12] Wolfgang Wechler,et al. Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.
[13] Michaël Rusinowitch,et al. The unifiability problem in ground AC theories , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[14] Nachum Dershowitz,et al. Equational inference, canonical proofs, and proof orderings , 1994, JACM.
[15] Harald Ganzinger,et al. Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..
[16] Albert Rubio,et al. Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..
[17] Albert Rubio,et al. A Total AC-Compatible Ordering Based on RPO , 1995, Theor. Comput. Sci..
[18] Wayne Snyder,et al. Basic Paramodulation , 1995, Inf. Comput..
[19] Harald Ganzinger,et al. Complexity analysis based on ordered resolution , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[20] Christopher Lynch,et al. Oriented Equational Logic Programming is Complete , 1995, J. Symb. Comput..
[21] H. Comon,et al. Induction = I − Axiomatization + First − Order Consistency Research Report LSV , 1998 .
[22] Robert Nieuwenhuis,et al. Decidability and Complexity Analysis by Basic Paramodulation , 1998, Inf. Comput..
[23] H. Ganzinger,et al. Equational Reasoning in Saturation-Based Theorem Proving , 1998 .
[24] Albert Rubio,et al. Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.
[25] Guillem Godoy,et al. On the Completeness of Arbitrary Selection Strategies for Paramodulation , 2001, ICALP.
[26] Thomas Hillenbrand,et al. WALDMEISTER - High-Performance Equational Deduction , 1997, Journal of Automated Reasoning.
[27] Christoph Weidenbach. SPASS - Version 0.49 , 2004, Journal of Automated Reasoning.
[28] Michaël Rusinowitch,et al. Any ground associative-commutative theory has a finite canonical system , 1996, Journal of Automated Reasoning.