Associative-commutative Deduction with Constraints Associative-commutative Deduction with Constraints
نویسنده
چکیده
Associative-commutative equational reasoning is known to be highly complex for theorem proving. Hence, it is very important to focus deduction by adding constraints, such as uniication and ordering, and to deene eecient strategies, such as the basic requirements a la Hullot. Constraints are formulas used for pruning the set of ground instances of clauses deduced by a theorem prover. We propose here an extension of AC-paramodulation and AC-superposition with these constraint mechanisms ; we do not need to compute AC-uniiers anymore. The method is proved to be refutationally complete, even with simpliication. The power of this approach is exempliied by a very short proof of the equational version of SAM's Lemma using DATAC, our implementation of the strategy.
منابع مشابه
Automated Verification by Induction with Associative-Commutative Operators
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets, : : : are ubiquitous in software and hardware veriication. These AC operators are diicult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. ...
متن کاملOn the Use of Constraints in Automated Deduction
This paper presents three approaches dealing with constraints in automated deduction. Each of them illustrates a diierent point. The expression of strategies using constraints is shown through the example of a completion process using ordered and basic strategies. The schemati-zation of complex uniication problems through constraints is illustrated by the example of an equational theorem prover...
متن کاملAutomated Veri cation by Induction and Associative-Commutative Operators
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets, : : : are ubiquitous in software and hardware veriication. These AC operators are diicult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. ...
متن کاملElementary Deduction Problem for Locally Stable Theories with Normal Forms
We present an algorithm to decide the intruder deduction problem (IDP) for a class of locally stable theories enriched with normal forms. Our result relies on a new and efficient algorithm to solve a restricted case of higher-order associative-commutative matching, obtained by combining the Distinct Occurrences of AC-matching algorithm and a standard algorithm to solve systems of linear Diophan...
متن کاملAdventures in Associative-commutative Uniication
We have discovered an eecient algorithm for matching and uniication in associative-commutative (AC) and associative-commutative-idempotent (ACI) equational theories. In most cases of AC uniication and in all cases of ACI uniication our method obviates the need for solving diophantine equations, and thus avoids one of the bottlenecks of other associative-commutative uniication techniques. The al...
متن کامل