Effective SAT planning by speculative computation

DOI10.1007/3-540-36187-1_74MaRDI QIDQ4415235zbMATH OpenFDO

Authors Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2557/25570726.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Planning as satisfiability: heuristics
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• SAS+ planning as satisfiability
• Planning as satisfiability with IPC simple preferences and action costs
• Introducing preferences in planning as satisfiability

Cited in

(7)

• Guiding high-performance SAT solvers with unsat-core predictions
• Planning as satisfiability: parallel plans and algorithms for plan search
• Planning as satisfiability: heuristics
• Exploiting macro-actions and predicting plan length in planning as satisfiability
• Concrete planning in Plan\textsc{ics} framework by combining SMT with GEO and simulated annealing
• Mining definitions in Kissat with Kittens
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

This page was built for publication: Effective SAT planning by speculative computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415235)