601 search results - page 17 / 121 » Quantified Equality Constraints |
JCO
2000
13 years 9 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
RTA
2000
Springer
14 years 1 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
FOSSACS
2008
Springer
13 years 11 months ago
2008
Springer
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
LOGCOM
2002
13 years 9 months ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
RTA
1998
Springer
14 years 2 months ago
1998
Springer
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 i...