Compilation to boolean satisfiability has become a powerful paradigm for solving AI problems. However, domains that require metric reasoning cannot be compiled e#ciently to SAT even if they would otherwise benefit from compilation. We address this problem by introducing the lcnf representation which combines propositional logic with metric constraints. We present lpsat, an engine which solves lcnf problems by interleaving calls to an incremental simplex algorithm with systematic satisfaction methods. We describe a compiler which converts metric resource planning problems into lcnf for processing by lpsat. The experimental section of the paper explores several optimizations to lpsat, including learning from constraint failure and randomized cuto#s. 1
|
740
|
Fast planning through planning graph analysis
– Blum, Furst
- 1995
|
|
432
|
Pushing the envelope: Planning propositional logic, and stochastic search
– Kautz, Selman
- 1996
|
|
357
|
Constraint Satisfaction in Logic Programming
– Hentenryck
- 1989
|
|
307
|
O-Plan: the Open Planning Architecture
– Currie
- 1991
|
|
291
|
R.H.C.: The CLP(R ) language and system
– Jaffar, Michaylov, et al.
- 1992
|
|
270
|
Simplification by cooperating decision procedures
– Nelson, Oppen
- 1979
|
|
221
|
Boosting combinatorial search through randomization
– Gomes, Selman, et al.
- 1998
|
|
194
|
Experimental results on the crossover point in satisfiability problems
– Crawford, Auton
- 1996
|
|
194
|
Concurrent Constraint Programming Languages
– Saraswat
- 1989
|
|
188
|
Local Search Strategies for Satisfiability Testing
– Selman, Kautz, et al.
- 1995
|
|
158
|
Using csp look-back techniques to solve realworl sat instances
– Bayardo, Shrag
- 1997
|
|
158
|
Extending planning graphs to an ADL subset
– Koehler, Nebel, et al.
- 1997
|
|
125
|
Numerica: A Modeling Language for Global Optimization
– Hentenryck, Michel, et al.
- 1997
|
|
111
|
Blackbox: A new approach to the application of theorem proving to problem solving
– Kautz, Selman
- 1998
|
|
103
|
Automatic SAT-compilation of planning problems
– Ernst, Millstein, et al.
- 1997
|
|
94
|
Heuristics based on unit propagation for satisfiability problems
– Li, Anbulagan
- 1997
|
|
90
|
Temporal planning with continuous change
– Penberthy, Weld
- 1994
|
|
82
|
D.G.: Finding hard instances of the satisfiability problem: a survey
– Cook, Mitchell
- 1997
|
|
79
|
Planning Under Resource Constraints
– Koehler
- 1998
|
|
61
|
The Cassowary linear arithmetic constraint solving algorithm: Interface and implementation
– Badros, Borning
- 1998
|
|
60
|
Maxplan: A new approach to probabilistic planning
– Majercik, Littman
- 1998
|
|
60
|
Ten challenges in propositional reasoning and search
– Selman, Kautz, et al.
- 1997
|
|
57
|
State-space planning by integer optimization
– Kautz, Walser
- 1999
|
|
54
|
Can AI planners solve practical problems
– Wilkins
- 1990
|
|
52
|
Solving linear arithmetic constraints for user interface applications
– Borning, Marriott, et al.
- 1997
|
|
40
|
based on unit propagation for satisfiability problems
– Heuristics
- 1997
|
|
38
|
On the use of integer programming models in ai planning
– Vossen, Ball, et al.
- 1999
|
|
32
|
On integrating constraint propagation and linear programming for combinatorial optimization
– Hooker, Ottosson, et al.
- 1999
|
|
14
|
The LPSAT system and its Application to Resource Planning
– Wolfman, Weld
- 1999
|
|
12
|
PDDL — The Planning Domain Definition Language. AIPS-98 Competition Committee, draft 1.6 edition
– McDermott
- 1998
|
|
12
|
Can AI planners solve practical problems? Computational Intelligence 6(4):232--246
– Wilkins
- 1990
|
|
11
|
Setting up large scale qualitative models
– Falkenhainer, Forbus
- 1988
|
|
4
|
Linear Programming
– Karloff
- 1991
|
|
3
|
Linear Programming
– Karlo
- 1991
|
