Planning as satisfiability: heuristics

DOI10.1016/j.artint.2012.08.001zbMath1270.68276OpenAlexW2048644716MaRDI QIDQ359984

Jussi Rintanen

Publication date: 23 August 2013

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212001014

Mathematics Subject Classification ID

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

Related Items

Progress in clasp Series 3, Approximate Model Counting via Extension Rule, SAT-Based Model Checking, Formally verified algorithms for upper-bounding state space diameters, Domain-Independent Cost-Optimal Planning in ASP, What is answer set programming to propositional satisfiability, On the completeness of pruning techniques for planning with conditional effects, Two approximate algorithms for model counting, plasp 3: Towards Effective ASP Planning, Computing programs for generalized planning using a classical planner, Red-black planning: a new systematic approach to partial delete relaxation

Uses Software

• Walksat
• Siege
• Chaff
• Graphplan
• MathSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contingent planning under uncertainty via stochastic satisfiability
• The intractability of resolution
• Fast planning through planning graph analysis
• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Limitations of restricted branching in clause learning
• AI 2007: Advances in artificial intelligence. 20th Australian joint conference on artificial intelligence, Gold Coast, Australia, December 2--6, 2007. Proceedings
• Planning as satisfiability: parallel plans and algorithms for plan search
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Experimental results on the crossover point in random 3-SAT
• A probabilistic analysis of propositional STRIPS planning
• The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
• GRASP: a search algorithm for propositional satisfiability
• Logics in Artificial Intelligence
• Automated Technology for Verification and Analysis
• Formal Methods in Computer-Aided Design
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Algorithm portfolios
• Planning as heuristic search