Structural complexity 1
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Fast planning through planning graph analysis
Artificial Intelligence
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Inferring state constraints for domain-independent planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A machine program for theorem-proving
Communications of the ACM
Improvements to the Evaluation of Quantified Boolean Formulae
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Planning for contingencies: a decision-based approach
Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Polynomial-Length Planning Spans the Polynomial Hierarchy
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On Computing Solutions to Belief Change Scenarios
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Linear Time Logic, Conditioned Models, and Planning with Incomplete Knowledge
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Planning under Incomplete Knowledge
CL '00 Proceedings of the First International Conference on Computational Logic
CL '00 Proceedings of the First International Conference on Computational Logic
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Perspectives on artificial intelligence planning
Eighteenth national conference on Artificial intelligence
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
On Deciding Subsumption Problems
Annals of Mathematics and Artificial Intelligence
Conformant planning via symbolic model checking and heuristic search
Artificial Intelligence
An Effective Algorithm for the Futile Questioning Problem
Journal of Automated Reasoning
Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
On quantified weighted MAX-SAT
Decision Support Systems
Conformant planning via heuristic forward search: a new approach
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Local search for quantified Boolean formulas
Proceedings of the 43rd annual Southeast regional conference - Volume 1
A SAT-based solver for Q-ALL SAT
Proceedings of the 44th annual Southeast regional conference
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Continual planning and acting in dynamic multiagent environments
PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
Theory and Practice of Logic Programming
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Fundamenta Informaticae
A solver for QBFs in negation normal form
Constraints
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
A Unified Framework for Certificate and Compilation for QBF
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Reasoning about actions with imprecise and incomplete state descriptions
Fuzzy Sets and Systems
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A Solver for QBFs in Nonprenex Form
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Strong Cyclic Planning under Partial Observability
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The complexity of constraint satisfaction games and QCSP
Information and Computation
Regression with respect to sensing actions and partial states
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Deconstructing planning as satisfiability
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Abstract branching for quantified formulas
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Solving QBF with combined conjunctive and disjunctive normal form
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Contingent planning with goal preferences
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Conformant planning for domains with constraints: a new approach
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Asymptotically optimal encodings of conformant planning in QBF
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Fusing procedural and declarative planning goals for nondeterministic domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
On reversing actions: algorithms and complexity
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Scoring functions of approximation of STRIPS planning by linear programming
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Updates, actions, and planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Backjumping for quantified Boolean logic satisfiability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Heuristic search + symbolic model checking = efficient conformant planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning in nondeterministic domains under partial observability via symbolic model checking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Extracting certificates from quantified boolean formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Continual planning and acting in dynamic multiagent environments
Autonomous Agents and Multi-Agent Systems
Conformant planning via heuristic forward search: A new approach
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Scoring functions of approximation of STRIPS planning by linear programming - block world example
WSEAS Transactions on Computers
A first step towards a unified proof checker for QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Dynamically partitioning for solving QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Bounded universal expansion for preprocessing QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Solution directed backjumping for QCSP
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Solving non-deterministic planning problems with pattern database heuristics
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Active learning of plans for safety and reachability goals with partial observability
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An AIG-Based QBF-solver using SAT for preprocessing
Proceedings of the 47th Design Automation Conference
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
Task planning for an autonomous service robot
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Resolution proofs and Skolem functions in QBF evaluation and applications
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Detecting and repairing anomalous evolutions in noisy environments
Annals of Mathematics and Artificial Intelligence
A more efficient BDD-based QBF solver
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Planning under continuous time and resource uncertainty: a challenge for AI
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Mapping conformant planning into SAT through compilation and projection
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
QBF reasoning on real-world instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Planning under uncertainty and its applications
Reasoning, Action and Interaction in AI Theories and Systems
A branching heuristics for quantified renamable horn formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Dependency quantified horn formulas: models and complexity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Solving quantified boolean formulas with circuit observability don't cares
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
QBF modeling: exploiting player symmetry for simplicity and efficiency
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Unified QBF certification and its applications
Formal Methods in System Design
The Multivariate Algorithmic Revolution and Beyond
Parallel QBF Solving with Advanced Knowledge Sharing
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Fundamenta Informaticae
Planning as satisfiability: Heuristics
Artificial Intelligence
Hi-index | 0.00 |
The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on. Without these assumptions the sequences of operations that achieve the goals depend on the initial state and the outcomes of nondeterministic changes in the system. This setting raises the questions of how to represent the plans and how to perform plan search. The answers are quite different from those in the simpler classical framework. In this paper, we approach conditional planning from a new viewpoint that is motivated by the use of satisfiability algorithms in classical planning. Translating conditional planning to formulae in the propositional logic is not feasible because of inherent computational limitations. Instead, we translate conditional planning to quantified Boolean formulae. We discuss three formalizations of conditional planning as quantified Boolean formulae, and present experimental results obtained with a theorem-prover.