| F. Baader and K.U. Schulz. Combining constraint solving. In H. Comon, C. March, and R. Treinen, editors, Constraints in Computational Logics: Theory and Applications, volume 2002. |
....several steps. The first one requires an extended narrowing procedure: roughly, we want to anticipate all possible simplifications occurring after any instantiation or combination of subterms of the original constraint. Our algorithm is inspired by combination techniques for unification algorithms [3, 17] and unification modulo ACUN [13] In the future, it should be possible to extend it to other equational theories, typically the theory of Abelian groups, for which in this paper we already prove NP membership in the ground case. 2 Ground reachability in the presence of 2.1 The setting We ....
....With such identifications, we get the three terms f(x y; x) f(0; x) f(x; x) Consider now = fx 7 a b y 7 ag. t contains a redex and t #= f(b; a b) is not an instance of any of the above three terms. We use a procedure which is similar to the combination of unification procedures of [17, 3], but we insert step 3: 1. Introduce a new variable x t for each non variable t 2 St(C) We record this variable introduction in a set of equalities E containing x f(t1 ; t n ) f(x t 1 ; x t n ) where, by convention, when t i is a variable, x t i is the variable t i itself. 7 x = ....
F. Baader and K. Schulz. Combining constraint solving. In Constraints in Computational Logics (CCL '99), volume 2002.
No context found.
F. Baader and K.U. Schulz. Combining constraint solving. In H. Comon, C. March, and R. Treinen, editors, Constraints in Computational Logics: Theory and Applications, volume 2002.
No context found.
F. Baader and K. Schulz. Combining constraint solving. In Constraints in Computational Logics (CCL '99), volume 2002.
No context found.
F. Baader and K. U. Schulz. Combining constraint solving. In H. Comon, C. Marche, and R. Treinen, editors, Constraints in Computational Logics, volume 2002 of Lecture Notes in Computer Science, pages 104-158, 2001.
No context found.
F. Baader and K. U. Schulz. Combining constraint solving. In Constraints in Computational Logics, volume 2002 of Lecture Notes in Computer Science, pages 104--158. Springer, 2001.
No context found.
F. Baader and K. U. Schulz. Combining constraint solving. In Constraints in Computational Logics, 2001.
No context found.
F. Baader and K. Schulz. Combining constraint solving. In Constraints in Computational Logics (CCL '99), volume 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC