K. U. Schulz. Combining unification- and disunification algorithms---tractable and intractable instances. Research Report CIS-Rep-96-99, CIS, LMU Munich, Germany, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimisation Techniques for Combining Constraint Solvers - Kepser, Richts (1998) (2 citations) (Correct)
....method lies in the interchange of information between the component algorithms. The impact of this interchange is highlighted by the fact that, although developed for the more general case, our combination algorithm turns out to be an implementation of the PTIME combination algorithm given in [15, 12] for a special subclass of constraint solvers. We also present a selection strategy for choosing the next non deterministic decision. In order to detect unsolvability of a single component faster, we first make all non deterministic decisions relative to one component before we proceed to the next ....
....only lead to redundant solutions. A longer discussion of this side issue would be beyond the limited scope of this paper. Deterministic Combination It is interesting to observe that there exists a class of constraint systems for which the deductive combination algorithm has PTIME complexity. In [15], Schulz gives a general description of a PTIME combination algorithm for certain equational theories. This algorithm is extended to the combination of quasi free structures in [12] The class of structures that are deterministically combinable is quite restricted. Currently, only unitary regular ....
[Article contains additional citation context not shown here]
K. U. Schulz. Combining unification- and disunification algorithms---tractable and intractable instances. Research Report CIS-Rep-96-99, CIS, LMU Munich, Germany, 1996.
Negation in Combining Constraint Systems - Kepser (1998) (2 citations) (Correct)
....hence has the independence property. The theorem is based on the fact that there exists a deterministic combination algorithm for unitary regular and non collapsing quasi free structures, which was developed for the more specific case of the combination of equational theories by K. U. Schulz in [15]. This algorithm computes most general solutions (see [10] 8 Conclusion We analysed the role of negation in the combination of quasi free structures. The contribution of this paper is twofold. In the first half, we showed that the existential fragment of the free amalgamated product A ....
Klaus U. Schulz. Combining Unification and Disunification Algorithms--- Tractable and Intractable Instances. Technical Report CIS-Bericht-96-99, CIS, Universitat Munchen, 1996.
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