1421 search results - page 4 / 285 » Satisfying KBO Constraints |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
COLING
1992
13 years 8 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
IPL
2000
13 years 6 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
GEO
2000
13 years 8 months ago
2000
: In feature modelling, constraints can be used to store design intent in a model. Interaction constraints are an important type of constraints, which limit the extent to which fea...
IJCAI
1989
13 years 8 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...