scientific article; zbMATH DE number 1305704
From MaRDI portal
Publication:4252522
zbMath0916.68139MaRDI QIDQ4252522
Publication date: 20 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Concise finite-domain representations for PDDL planning tasks ⋮ Task decomposition on abstract states, for planning under nondeterminism ⋮ The complexity of constraint satisfaction games and QCSP ⋮ Preprocessing for DQBF ⋮ Backdoors to Satisfaction ⋮ Planning as satisfiability: heuristics ⋮ Small Resolution Proofs for QBF using Dependency Treewidth ⋮ Solution Directed Backjumping for QCSP ⋮ Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results ⋮ Unified QBF certification and its applications ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ Quantified Constraints in Twenty Seventeen ⋮ Conformant planning via heuristic forward search: A new approach ⋮ Strong planning under partial observability ⋮ Undoing the effects of action sequences ⋮ On deciding subsumption problems ⋮ A Unified Framework for Certificate and Compilation for QBF ⋮ Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP ⋮ Linear temporal logic as an executable semantics for planning languages ⋮ Using decomposition-parameters for QBF: mind the prefix! ⋮ A solver for QBFs in negation normal form ⋮ Reasoning about actions with imprecise and incomplete state descriptions ⋮ Backdoor sets of quantified Boolean formulas ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement ⋮ Computational complexity of planning and approximate planning in the presence of incompleteness ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 ⋮ Planning with Incomplete Information in Quantified Answer Set Programming ⋮ A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system ⋮ Backjumping for quantified Boolean logic satisfiability ⋮ Weak, strong, and strong cyclic planning via symbolic model checking ⋮ SAT-based planning in complex domains: Concurrency, constraints and nondeterminism ⋮ Conformant planning via symbolic model checking and heuristic search
Uses Software
This page was built for publication:
