F. Baader and K. U. Schulz. General A- and AX-unification via optimized combination procedures. In H. Abdulrab and J.-P. Pecuchet, editors, Proc. of the Second Int. Workshop on Word Equations and Related Topics, IWWERT-91, volume 677 of LNCS, pages 23--42, Rouen, France, 7--9 October 1991. Springer Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Final CCL report - Jouannaud (Correct)
....contributions including those by Manfred Schidt Schauss (member of CCL II) and Alexandre Boudet from UPS. We believe that it has now obtained a final stable form described in [10] The connection between linear constant restrictions and quantifier alternations in positive formulae, as described in [9], and the modularity results for decision procedures for the positive fragments of theories established in [11] have led to a complete understanding of this type of combination problems, both from a logical and from an algebraic point of view. The more general problem of combining constraint ....
F. Baader and K.U. Schulz. General A- and AX-unification via optimized combination procedures. In Proceedings of the Second International Workshop on Word Equations and Related Topics, IWWERT-91, volume 677 of Lecture Notes in Computer Science, pages 23--42, Rouen (France), 1992. Springer--Verlag.
Combination Techniques and Decision Problems for Disunification - Baader, Schulz (17 citations) Self-citation (Baader Schulz) (Correct)
....in the combined theory. 3) If, for E 1 and E 2 , solvability of disunification problems with linear constant restriction can be decided by an NP algorithm, then solvability of disunification problems in the combined theory is also NP decidable. Proof. The proof is very similar to the one given in [BS91a, BS91b] for the analogous results for unification problems. 1) Let Gamma be a general (E; Sigma) disunification problem, and let Omega : Sigma n sig(E) The system Gamma may be considered as a disunification problem in the union of the theory E with the free theory F Omega : ff(x 1 ; x ....
....= sig(E 1 ) Delta Delta Delta [ sig(E n ) Omega Gamma In order to get decidability of (E; Sigma) disunification problems one just applies Theorem 3.1 to the combination of E 1 ; E n , and F Omega . 3) It is easy to see that the decomposition algorithm is an NP algorithm (see [BS91b] for a detailed analysis for the case of unification problems) The resulting systems Gamma 5;1 ; Gamma 5;2 are of a size that is polynomial in the size of the original system. If deciding whether these systems are solvable can also be done by an NP algorithm, then the overall decision method is ....
[Article contains additional citation context not shown here]
F. Baader, K.U. Schulz, "General A- and AX-Unification via Optimized Combination Procedures," CIS-Report 92-58, CIS, University Munich; also to appear in the Proceedings of the Second Workshop on Word Equations and Related Topics IWWERT '91, Rouen 1991, LNCS.
Unification in the Union of Disjoint Equational Theories.. - Baader, Schulz (1992) (49 citations) Self-citation (Baader Schulz) (Correct)
....lifted to general unification: in order to get decidability of general unification modulo E 1 [ E n , apply the theorem to E 1 ; E n ; F Omega . 3. General A unifiability is decidable. For A, decidability of unification problems with constant restriction is an easy consequence (see [BS91]) of a result by Schulz [Sh91] on a generalization of Makanin s procedure. This result shows that it is still decidable whether a given A unification problem with constants has a solution for which the words substituted for the variables in the problem are elements of given regular languages over ....
....where AI : A [ ff(x; x) xg, is decidable. This was also stated as an open problem in [KN91] For AI, decidability of unification problems with constant restriction easily follows from the wellknown fact (see e.g. Ho76] that finitely generated idempotent semigroups are finite (see [BS91] for details) 5. If solvability of the E i unification problems with linear constant restriction can be decided by an NP algorithm, then unifiability in the combined theory is also NP decidable. This fact will become obvious once we have described our decomposition algorithm. As a consequence ....
[Article contains additional citation context not shown here]
F. Baader, K.U. Schulz, "General A- and AX-Unification via Optimized Combination Procedures," Proceedings of the Second International Workshop on Word Equations and Related Topics, Rouen 1991, to appear as Springer LNCS.
Solving Equations Involving Sequence Variables and Sequence.. - Kutsia (2004) (1 citation) (Correct)
No context found.
F. Baader and K. U. Schulz. General A- and AX-unification via optimized combination procedures. In H. Abdulrab and J.-P. Pecuchet, editors, Proc. of the Second Int. Workshop on Word Equations and Related Topics, IWWERT-91, volume 677 of LNCS, pages 23--42, Rouen, France, 7--9 October 1991. Springer Verlag.
Solving Equations Involving Sequence Variables and Sequence.. - Kutsia (2004) (1 citation) (Correct)
No context found.
F. Baader and K. U. Schulz. General A- and AX-unification via optimized combination procedures. In H. Abdulrab and J.-P. Pecuchet, editors, Proc. of the Second Int. Workshop on Word Equations and Related Topics, IWWERT-91, volume 677 of LNCS, pages 23--42, Rouen, France, 7--9 October 1991. Springer Verlag.
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