3 search results - page 1 / 1 » Entailment of Atomic Set Constraints is PSPACE-Complete |
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
LICS
1997
IEEE
13 years 9 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
LPNMR
2009
Springer
13 years 12 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...