1705 search results - page 80 / 341 » Representing Constraints with Automata |
SPDP
1991
IEEE
14 years 1 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
AIPS
2008
14 years 13 days ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
ASIAN
2009
Springer
13 years 11 months ago
2009
Springer
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
COMSIS
2006
13 years 10 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
JAIR
2006
13 years 10 months ago
2006
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...