405 search results - page 19 / 81 » On the Complexity of Global Constraint Satisfaction |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
ACL
1990
14 years 10 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
MST
2008
14 years 9 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
84
Voted
AAAI
2008
14 years 12 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...