Sciweavers

312 search results - page 6 / 63
» On Temporal Planning as CSP
Sort
View
AAAI
1997
13 years 8 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag
EAAI
2008
104views more  EAAI 2008»
13 years 7 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
MATES
2007
Springer
14 years 1 months ago
Using DESs for Temporal Diagnosis of Multi-agent Plan Execution
The most common reason for plan repair are the violation of a plan’s temporal constraints. Air Traffic Control is an example of an area in which violations of the plan’s tempo...
Femke de Jonge, Nico Roos, Huib Aldewereld
ICDE
2000
IEEE
116views Database» more  ICDE 2000»
14 years 8 months ago
Query Plans for Conventional and Temporal Queries Involving Duplicates and Ordering
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
AAAI
2008
13 years 9 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith