ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
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
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
An intermediate design language and its analysis
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
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
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
Act, and the rest will follow: exploiting determinism in planning as satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Control knowledge in planning: benefits and tradeoffs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
State-space planning by integer optimization
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
On the utility of plan-space (causal) encodings
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Automating first-order relational logic
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Finding bugs with a constraint solver
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
Encoding domain knowledge for prositional planning
Logic-based artificial intelligence
Parallel cooperative propositional theorem proving
Annals of Mathematics and Artificial Intelligence
A propositional theorem prover to solve planning and other problems
Annals of Mathematics and Artificial Intelligence
On Reformulating Planning as Dynamic Constraint Satisfaction
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Dependent and Independent Variables in Propositional Satisfiability
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
Annals of Mathematics and Artificial Intelligence
Design-as-satisfiability: A new approach to automated synthesis
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Combining linear programming and satisfiability solving for resource planning
The Knowledge Engineering Review
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
Applying integer programming to AI planning
The Knowledge Engineering Review
Integer optimization models of AI planning problems
The Knowledge Engineering Review
Faster constraint solving with subtypes
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Annals of Mathematics and Artificial Intelligence
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Non-Clausal Reasoning with Definite Theories
Fundamenta Informaticae
Discrete Applied Mathematics
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Hierarchical Classifiers for Complex Spatio-temporal Concepts
Transactions on Rough Sets IX
Compiling finite linear CSP into SAT
Constraints
Probabilistic Reasoning by SAT Solvers
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
New Encodings of Pseudo-Boolean Constraints into CNF
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Continuous time in a SAT-based planner
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
Answer Set Programming for Single-Player Games in General Game Playing
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Finite Satisfiability in Infinite-Valued Łukasiewicz Logic
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
SAT-encodings, search space structure, and local search performance
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The LPSAT engine & its application to resource planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Reachability, relevance, resolution and the planning as satisfiability approach
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
To encode or not to encode-1: linear planning
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Solving non-Boolean satisfiability problems with stochastic local search
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
An ontological account of action in processes and plans
Knowledge-Based Systems
Planned and traversable play-out: a flexible method for executing scenario-based programs
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
CGRASS: a system for transforming constraint satisfaction problems
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Variable dependency in local search: prevention Is better than cure
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Tunable static inference for generic universe types
Proceedings of the 25th European conference on Object-oriented programming
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Optimizations for compiling declarative models into boolean formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Programming for modular reconfigurable robots
Programming and Computing Software
Non-Clausal Reasoning with Definite Theories
Fundamenta Informaticae
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
| Hi-index | 0.01 |
Recent work by Kautz et al., provides tantalizing evidence that large, classical planning problems may be efficiently solved by translating them into propositional satisfiability problems, using stochastic search techniques, and translating the resulting truth assignments back into plans for the original problems. We explore the space of such transformations, providing a simple framework that generates eight major encodings (generated by selecting one of four action representations and one of two frame axioms) and a number of subsidiary ones. We describe a fully-implemented compiler that can generate each of these encodings, and we test the compiler on a suite of STRIPS planning problems in order to determine which encodings have the best properties.