The following pages link to (Q4252522):
Displaying 34 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Undoing the effects of action sequences (Q946576) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Reasoning about actions with imprecise and incomplete state descriptions (Q1037952) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Unified QBF certification and its applications (Q2441712) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Solution Directed Backjumping for QCSP (Q3523056) (← links)
- A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636) (← links)
- Planning with partial observability by SAT (Q6545568) (← links)
- A knowledge compilation perspective on queries and transformations for belief tracking (Q6630720) (← links)
