Planning with Incomplete Information in Quantified Answer Set Programming

DOI10.1017/S1471068421000259OpenAlexW3203120728MaRDI QIDQ5019607

Francois Laferriere, Torsten Schaub, Javier Romero, Jorge Fandinno, 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

zbMATH Keywords

planninganswer set programmingquantified logics

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Solving problems in the polynomial hierarchy with ASP(Q)

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of action theories and its application to conformant planning
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Answer set programming and plan generation
• QRATPre+: effective QBF preprocessing via strong redundancy properties
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Positional games and QBF: the corrective encoding
• Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width
• Temporal Answer Set Programming on Finite Traces
• Hybrid conditional planning using answer set programming
• Dependency Learning for QBF
• Beyond NP: Quantifying over Answer Sets
• Blocked Clause Elimination for QBF
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Logic Programming and Nonmonotonic Reasoning
• Answer Set Programming without Unstratified Negation

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