Planning with Incomplete Information in Quantified Answer Set Programming
From MaRDI portal
Publication:5019607
DOI10.1017/S1471068421000259OpenAlexW3203120728MaRDI QIDQ5019607FDOQ5019607
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)
Full work available at URL: https://arxiv.org/abs/2108.06405
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
- Blocked clause elimination for QBF
- Title not available (Why is that?)
- Dependency Learning for QBF
- Answer set programming and plan generation
- Compiling uncertainty away in conformant planning problems with bounded width
- Answer Set Programming without Unstratified Negation
- Title not available (Why is that?)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- Approximation of action theories and its application to conformant planning
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Hybrid conditional planning using answer set programming
- QRATPre+: effective QBF preprocessing via strong redundancy properties
- Temporal answer set programming on finite traces
- Positional games and QBF: the corrective encoding
- Beyond NP: quantifying over answer sets
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
Uses Software
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)
