Approximation of action theories and its application to conformant planning

DOI10.1016/j.artint.2010.04.007zbMath1230.68185OpenAlexW2000712072MaRDI QIDQ543583

A. Ricardo Morales, Tran Cao Son, Phan Huy Tu, Michael Gelfond

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1016/j.artint.2010.04.007

zbMATH Keywords

knowledge representationincomplete informationanswer set programmingreasoning about action and changeconformant planning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

Reasoning about actions with Temporal Answer Sets ⋮ Proof systems for planning under 0-approximation semantics ⋮ A generic approach to planning in the presence of incomplete information: theory and implementation ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ John McCarthy's legacy ⋮ An action language for multi-agent domains ⋮ A multiparametric view on answer set programming ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement ⋮ Position systems in dynamic domains ⋮ Planning with Incomplete Information in Quantified Answer Set Programming

Uses Software

• Cmodels
• Smodels
• PDDL
• Graphplan

Cites Work

• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Conformant planning via symbolic model checking and heuristic search
• Answer set based design of knowledge systems
• On the logic of causal explanation
• Representing action: indeterminacy and ramifications
• Ramification and causality
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Answer set programming and plan generation
• Extending and implementing the stable model semantics
• Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)
• Using temporal logics to express search control knowledge for planning
• Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
• Representing action and change by logic programs
• Representing actions in logic programs and default theories a situation calculus approach
• Diagnostic reasoning with A-Prolog
• Domain-dependent knowledge in answer set planning
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Formalizing sensing actions -- a transition function based approach
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation of action theories and its application to conformant planning