Using SAT and Logic Programming to Design Polynomial-Time Algorithms for Planning in Non-Deterministic Domains.
Chitta BaralThomas EiterJicheng ZhaoPublished in: AAAI (2005)
Keyphrases
- logic programming
- deterministic domains
- logic programs
- pseudo boolean constraints
- planning problems
- programming language
- answer set programming
- computational complexity
- general purpose
- learning algorithm
- inductive logic programming
- orders of magnitude
- answer sets
- sat problem
- stochastic domains
- incomplete information
- satisfiability problem
- symbolic model checking
- knowledge representation