Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
DOI10.1016/J.ARTINT.2008.03.004zbMATH Open1183.68569OpenAlexW2141404824MaRDI QIDQ2389669FDOQ2389669
Authors: Blai Bonet, Hector Geffner 
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10230/36436
Recommendations
- An LP-Based Heuristic for Optimal Planning
- Improving delete relaxation heuristics through explicitly represented conjunctions
- Set-structured and cost-sharing heuristics for classical planning
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
- Solving delete free planning with relaxed decision diagram based heuristics
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Fast planning through planning graph analysis
- Title not available (Why is that?)
- Extending and implementing the stable model semantics
- Propositional semantics for disjunctive logic programs
- Title not available (Why is that?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Planning as heuristic search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sokoban: Enhancing general single-agent search methods using domain knowledge
- The computational complexity of propositional STRIPS planning
- Answer set programming and plan generation
- The FF planning system: Fast plan generation through heuristic search
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Decomposable negation normal form
- Title not available (Why is that?)
- Using regression-match graphs to control search in planning
- Title not available (Why is that?)
- Title not available (Why is that?)
- A heuristic search approach to planning with temporally extended preferences
- Compiling propositional weighted bases
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389669)
