Refine
Has Fulltext
- no (168)
Year of publication
Document Type
- Article (168) (remove)
Is part of the Bibliography
- yes (168)
Keywords
- answer set programming (7)
- Answer Set Programming (6)
- Answer set programming (6)
- Answer Set Programming (ASP) (2)
- Constraint Answer Set Programming (CASP) (2)
- Multi-objective optimization (2)
- Theory (2)
- bioinformatics (2)
- Aggregates (1)
- Algorithm configuration (1)
- Algorithm portfolios (1)
- Architecture synthesis (1)
- Automated parallelization (1)
- Boolean logic models (1)
- Boolean networks (1)
- Combinatorial multi-objective optimization (1)
- Complex optimization (1)
- Conformant Planning (1)
- Constraint Processing (CP) (1)
- Constraint Programming (CP) (1)
- Course timetabling (1)
- Educational timetabling (1)
- Epistemic Logic Programs (1)
- Incremental answer set programming (1)
- Knowledge representation (1)
- Localization (1)
- Logic programming (1)
- Meta-Programming (1)
- Minimal perturbation problems (1)
- Model identification (1)
- Multiplex phosphoproteomics data (1)
- Non-Monotonic (1)
- Nonmonotonic reasoning (1)
- Parallel SAT solving (1)
- Preference Handling (1)
- Programming by optimization (1)
- Reasoning (1)
- Reconfigurable architecture (1)
- Sat Modulo Theories (SMT) (1)
- Signaling transduction networks (1)
- System design (1)
- Systems biology (1)
- Technology mapping (1)
- Theory Solving (1)
- Time series data (1)
- Tracking (1)
- Wireless Sensor Networks (1)
- action and change (1)
- algorithm schedules (1)
- automated guided vehicle routing (1)
- automated planning (1)
- belief merging (1)
- belief revision (1)
- car assembly operations (1)
- consistency (1)
- course timetabling (1)
- declarative problem solving (1)
- diagnosis (1)
- educational timetabling (1)
- finite model computation (1)
- gap-filling (1)
- hybrid solving (1)
- knowledge representation and nonmonotonic reasoning (1)
- linear programming (1)
- metabolic network (1)
- planning (1)
- portfolio-based solving (1)
- program encodings (1)
- proof complexity (1)
- quantified logics (1)
- strong equivalence (1)
- tableau calculi (1)
- technical notes and rapid communications (1)
We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.