Planning with Incomplete Information in Quantified Answer Set Programming

DOI10.1017/S1471068421000259MaRDI QIDQ5019607zbMATH OpenOpenAlexFDO

Authors Jorge Fandinno, Francois Laferriere, Javier Romero, Torsten Schaub, Tran Cao Son

Publication date 10 January 2022

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2108.06405

zbMATH Keywords

planninganswer set programmingquantified logics

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Planning with incomplete information (invited paper)
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Logic Programming and Nonmonotonic Reasoning
• A generic approach to planning in the presence of incomplete information: theory and implementation
• scientific article; zbMATH DE number 1696837
• Efficient Reasoning About Action and Change in the Presence of Incomplete Information and Its Application in Planning
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Answer set programming and its applications in planning and multi-agent systems
• Planning in answer set programming using ordered task decomposition
• Planning in answer set programming using ordered task decomposition

Cites work

• scientific article; zbMATH DE number 1305704 (Why is no real title available?)
• scientific article; zbMATH DE number 1931653 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• Answer Set Programming without Unstratified Negation
• Answer set programming and plan generation
• Approximation of action theories and its application to conformant planning
• Beyond NP: quantifying over answer sets
• Blocked clause elimination for QBF
• Compiling uncertainty away in conformant planning problems with bounded width
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Dependency Learning for QBF
• Hybrid conditional planning using answer set programming
• Logic Programming and Nonmonotonic Reasoning
• Positional games and QBF: the corrective encoding
• QRATPre+: effective QBF preprocessing via strong redundancy properties
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Temporal answer set programming on finite traces

Cited in

(6)

• Approximate Epistemic Planning with Postdiction as Answer-Set Programming
• Logic Programming and Nonmonotonic Reasoning
• Hybrid conditional planning using answer set programming
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Solving problems in the polynomial hierarchy with ASP(Q)
• Logic Programming

Describes a project that uses

Uses Software

• QESTO
• QRATPre+
• HQSpre
• CAQE
• DepQBF
• Bloqqer

This page was built for publication: Planning with Incomplete Information in Quantified Answer Set Programming

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