238 search results - page 4 / 48 » Planning as Satisfiability |
AAAI
1997
13 years 11 months ago
1997
Most work on AI planning has focused on the development of fully automated methods for generating plans that satisfy user-speci ed goals. However, users in many domains want the a...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
JAR
2000
13 years 9 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
CONSTRAINTS
2010
13 years 7 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
C3S2E
2010
ACM
13 years 11 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...