Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Partial commutation and traces
Handbook of formal languages, vol. 3
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
CPlan: a constraint programming approach to planning
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
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Artificial Intelligence
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Effective SAT Planning by Speculative Computation
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Optimal Parallelization of Las Vegas Algorithms
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Merged processes: a new condensed representation of Petri net behaviour
CONCUR 2005 - Concurrency Theory
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
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
Incremental and complete bounded model checking for full PLTL
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Symbolic Step Encodings for Object Based Communicating State Machines
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
sgen1: A generator of small but difficult satisfiability benchmarks
Journal of Experimental Algorithmics (JEA)
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Planning as satisfiability with relaxed ∃-step plans
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Heuristics for planning with SAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A weighted CSP approach to cost-optimal planning
AI Communications
Everything you always wanted to know about planning (but were afraid to ask)
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Exploiting step semantics for efficient bounded model checking of asynchronous systems
Science of Computer Programming
An optical solution to the 3-SAT problem using wavelength based selectors
The Journal of Supercomputing
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
On the utility of landmarks in SAT based planning
Knowledge-Based Systems
Planning as satisfiability: Heuristics
Artificial Intelligence
Asynchronous multi-core incremental SAT solving
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A SAT-based approach to cost-sensitive temporally expressive planning
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
Hi-index | 0.00 |
We address two aspects of constructing plans efficiently by means of satisfiability testing: efficient encoding of the problem of existence of plans of a given number t of time points in the propositional logic and strategies for finding plans, given these formulae for different values of t. For the first problem we consider three semantics for plans with parallel operator application in order to make the search for plans more efficient. The standard semantics requires that parallel operators are independent and can therefore be executed in any order. We consider a more relaxed definition of parallel plans which was first proposed by Dimopoulos et al., as well as a normal form for parallel plans that requires every operator to be executed as early as possible. We formalize the semantics of parallel plans emerging in this setting and present translations of these semantics into the propositional logic. The sizes of the translations are asymptotically optimal. Each of the semantics is constructed in such a way that there is a plan following the semantics exactly when there is a sequential plan, and moreover, the existence of a parallel plan implies the existence of a sequential plan with as many operators as in the parallel one. For the second problem we consider strategies based on testing the satisfiability of several formulae representing plans of n time steps for several values of n concurrently by several processes. We show that big efficiency gains can be obtained in comparison to the standard strategy of sequentially testing the satisfiability of formulae for an increasing number of time steps.