منابع مشابه
Adventures in Associative-Commutative Unification
We have discovered an eecient algorithm for matching and uniication in associa-tive-commutative (AC) equational theories. In most cases of AC uniication our method obviates the need for solving diophantine equations, and thus avoids one of the bottlenecks of other associative-commutative uniication techniques. The algorithm eeciently utilizes powerful constraints to eliminate much of the search...
متن کاملOn the Parameterized Complexity of Associative and Commutative Unification
This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and associative-commutative unification problems are W [1]-hard. A fixed-parameter algorithm and a polynomialtime algorithm are presented for special cases of commutat...
متن کاملA Complete Unification Algorithm for Associative-Commutative Functions
An important component of mechanical theorem proving systems are unification algorithms which find most genaral substitutions which, when applied to two expresssions, maka them equivalent. Functions which are associative and commutative (such as the arithmetic addition and multiplication functions) are often the subject of mechanical theorem proving. An algorithm which unifies terms whose funct...
متن کاملComplexity of Associative-commutative Unification Check and Related Problems *
The uniication problem for terms containing associative and commutative functions is of great importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of determining whether two such terms are uniiable was known to be NP-hard. It is proved that the problem is NP-complete by describing a nondeterministic polynomial time algorith...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1987
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(87)80004-4