A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Principles of artificial intelligence
Principles of artificial intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Frames in the space of situations (research note)
Artificial Intelligence
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Representing action: indeterminacy and ramifications
Artificial Intelligence
On the logic of causal explanation
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
An action language based on causal explanation: preliminary report
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
A machine program for theorem-proving
Communications of the ACM
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
Improvements to the Evaluation of Quantified Boolean Formulae
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Open World Planning in the Situation Calculus
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Planning as Satisfiability in Nondeterministic Domains
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Tuning SAT Checkers for Bounded Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Conformant Planning via Model Checking
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
System Description: *SAT: A Platform for the Development of Modal Decision Procedures
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
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
Heuristic search + symbolic model checking = efficient conformant planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Planning with incomplete information
MoChArt'10 Proceedings of the 6th international conference on Model checking 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
Understanding planning with incomplete information and sensing
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
Theory and Practice of Logic Programming
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Probabilistic Reasoning by SAT Solvers
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Forward-chaining planning in nondeterministic domains
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Conformant planning for domains with constraints: a new approach
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
An extension to conformant planning using logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Understanding planning with incomplete information and sensing
Artificial Intelligence
Strong planning under partial observability
Artificial Intelligence
Set-structured and cost-sharing heuristics for classical planning
Annals of Mathematics and Artificial Intelligence
Experimenting with look-back heuristics for hard ASP programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
CPP: a constraint logic programming based planner with preferences
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Complexity of planning in action formalisms based on description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
An overview of AI research in Italy
Artificial intelligence
Approximation of action theories and its application to conformant planning
Artificial Intelligence
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Journal of Computer and System Sciences
An approximation of action theories of AL and its application to conformant planning
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The second QBF solvers comparative evaluation
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
Hi-index | 0.01 |
Planning as satisfiability is a very efficient technique for classical planning, i.e., for planning domains in which both the effects of actions and the initial state are completely specified. In this paper we present C-SAT, a SAT-based procedure capable of dealing with planning domains having incomplete information about the initial state, and whose underlying transition system is specified using the highly expressive action language C. Thus, C-SAT allows for planning in domains involving (i) actions which can be executed concurrently; (ii) (ramification and qualification) constraints affecting the effects of actions; and (iii) nondeterminism in the initial state and in the effects of actions. We first prove the correctness and the completeness of C-SAT, discuss some optimizations, and then we present C-PLAN, a system based on C-SAT. C-PLAN works on any C planning problem, but some optimizations have not been fully implemented yet. Nevertheless, the experimental analysis shows that SAT-based approaches to planning with incomplete information are viable, at least in the case of problems with a high degree of parallelism.