منابع مشابه
Monadic Simultaneous Rigid E-Unification and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. 1 Section
متن کاملMonadic Simultaneous Rigid E-Uni cation and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.
متن کاملThe Undecidability of Simultaneous Rigid E-Unification with Two Variables
Recently it was proved that the problem of simultaneous rigid E-unification, or SREU, is undecidable. Here we show that 4 rigid equations with ground left-hand sides and 2 variables already imply undecidability. As a corollary we improve the undecidability result of the 3*-fragment of intuitionistic logic with equality. Our proof shows undecidability of a very restricted subset of the 33-fragme...
متن کاملThe Decidability of Simultaneous Rigid E-Unification with One Variable
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the ∀∗∃∀∗ fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the ∃∃-fragment, we obtain a complete classification of decidability of the prenex fragment of intui...
متن کاملImplementing rigid e-unification
Rigid E-unification problems arise naturally in automated theorem provers that deal with equality. While there is a lot of theory about rigid E-unification, only few implementations exist. Since the problem is NPcomplete, direct implementations of the theory are slow. In this paper we discuss how to implement a rigid E-unifier, focussing on efficiency. First, we introduce an efficient represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00123-6