1381 search results - page 41 / 277 » Computational Complexity of Constraint Satisfaction |
ICTL
1994
14 years 1 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
ENDM
2000
13 years 9 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
COLING
1992
13 years 11 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...
EVOW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
CSCLP
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...