SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion

No abstract is available for this paper.

• Publication year

  1989

• Venue

  International Conference on Rewriting Techniques and Applications

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-51081-8_131
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.

  1989cited by this paper
• Complete Inference Rules for the Cancellation Laws

  1987cited by this paper
• On Word Problems in Equational Theories

  1987cited by this paper
• Méthodes de filtrage équationnel et de preuve automatique de théorèmes

  1986cited by this paper
• A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity

  1984cited by this paper
• Complete Sets of Reductions for Some Equational Theories

  1981cited by this paper

• Automatically Checking an Implementation against Its Formal Specification

  2000cites this paper
• Déduction avec contraintes et simplification dans les théories équationnelles

  1999cites this paper
• A history of CLU

  1996cites this paper
• Automating Algebraic Proofs in Algebraic Logic

  1996cites this paper
• Towards a Foundation of Completion Procedures as Semidecision Procedures

  1995cites this paper
• Modelling and proving of truly concurrent systems with CATNets

  1993cites this paper
• A history of CLU

  1993cites this paper
• A Case Study of Completion Modulo Distributivity and Abelian Groups

  1993cites this paper
• Rewriting Methods for Word Problems

  1992cites this paper
• The application of automated reasoning to questions in mathematics and logic

  1992cites this paper
• A Goal Oriented Strategy Based on Completion

  1992cites this paper
• Some Experiments with a Completion Theorem Prover

  1992cites this paper
• First-order theorem proving modulo equations

  1992cites this paper
• Distributed automated deduction

  1992cites this paper
• Rewrite Systems

  1991cites this paper
• Automated deduction with associative-commutative operators

  1991cites this paper
• Design and development of ENprover, an automated theorem proving system based on EN-strategy

  1990cites this paper
• SBR3: A Refutational Prover for Equational Theorems

  1990cites this paper
• An Application of Automated Equational Reasoning to Many-valued Logic

  1990cites this paper
• Automated proofs of the moufang identities in alternative rings

  1990cites this paper
• Heuristical Criteria in Refutational Theorem Proving

  1990cites this paper
• Completion Procedures as Semidecision Procedures

  1990cites this paper
• Automated proofs in Lukasiewicz logic

  1989cites this paper
• An Application of the Theorem Prover SBR 3 to Many-valued Logic

  year unknowncites this paper