83,716 Hits in 6.0 sec

Planning as satisfiability: parallel plans and algorithms for plan search

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
2006 Artificial Intelligence  
For the first problem we consider three semantics for plans with parallel operator application in order to make the search for plans more efficient.  ...  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  ...  Acknowledgments We thank Lawrence Ryan for his assistance with Siege.  ... 
doi:10.1016/j.artint.2006.08.002 fatcat:kmcw2fkh6vdfzggdqlny4a2dhu

Planning as satisfiability: Heuristics

Jussi Rintanen
2012 Artificial Intelligence  
as VSIDS, and often lifts it to the same level with other search methods such as explicit state-space search with heuristic search algorithms.  ...  In this work we propose a planning-specific variable selection strategy for SAT solving.  ...  Acknowledgements We thank Hector Geffner and Patrik Haslum for comments and suggestions on early versions of this paper, and Blai Bonet for providing us with updated versions of the HSP 2.0 planner.  ... 
doi:10.1016/j.artint.2012.08.001 fatcat:e75kvn6ncjavzooozno7j725su

SAS+ Planning as Satisfiability

R. Huang, Y. Chen, W. Zhang
2012 The Journal of Artificial Intelligence Research  
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS.  ...  The new scheme exploits the structural information in SAS+, resulting in an encoding that is both more compact and efficient for planning.  ...  We thank Joerg Hoffmann, Jussi Rintanen and several anonymous reviewers for the helpful comments. We particularly thank Malte Helmert for making the SAS+ parser available.  ... 
doi:10.1613/jair.3442 fatcat:ug5taksm6bgk7nlsldt3q4ngm4

Parallel Encodings of Classical Planning as Satisfiability [chapter]

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
2004 Lecture Notes in Computer Science  
We consider a more relaxed definition of parallel plans, first proposed by Dimopoulos et al., as well as normal forms for parallel plans that require every operator executed as early as possible, first  ...  We consider a number of semantics for plans with parallel operator application.  ...  Acknowledgements We thank Lawrence Ryan for assistance with the Siege solver.  ... 
doi:10.1007/978-3-540-30227-8_27 fatcat:t2trquaz6fbeffuz4ezwqnemzq

μ-SATPLAN: Multi-agent planning as satisfiability

Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos Moraitis
2012 Knowledge-Based Systems  
In this algorithm, agents use l-SATPLAN as the underlying planner for generating individual and joint consistent plans.  ...  The underlying algorithm is again l-SATPLAN, and is used for the generation of individual (based on assistance) and joint consistent plans.  ...  For a description of the latest version of SATPLAN the reader is referred to [22] , and for an introduction to planning as satisfiability to [25] .  ... 
doi:10.1016/j.knosys.2011.07.019 fatcat:yuz5tuzqgvgx3hz7zm2mwsn7uu

Introducing Preferences in Planning as Satisfiability

E. Giunchiglia, M. Maratea
2010 Journal of Logic and Computation  
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: SATPLAN has been the winning system in the deterministic track for optimal planners in the 4th  ...  Given a planning problem Π and a makespan n, the approach based on satisfiability (a.k.a., SAT-based) simply works by (i) constructing a SAT formula Πn; and (ii) checking Πn for satisfiability: if there  ...  As an example. if we have two preferences p 1 and p 2 with p 1 ≺ p 2 , then the algorithm works as follows: it 1. looks for assignments extending {v(p 1 ), v(p 2 )}: if the search fails (meaning that no  ... 
doi:10.1093/logcom/exq023 fatcat:fgojeq2rvbg3ve34jppgah72mi

Planning as satisfiability with IPC simple preferences and action costs

Marco Maratea
2012 AI Communications  
At the same time, as a side effect of this analysis, challenging Max-SAT and PB benchmarks have been identified, as well as the Max-SAT and PB solvers performing best on these planning problems.  ...  Alessandro Saetti and Malte Helmert are, instead, thanked for their help with IPC-5 and IPC-6 benchmarks, and Menkes van den Briel for insights on the approach based on Integer Programming. ** Corresponding  ...  Algorithms for finding optimal plans Now we define approaches for finding "optimal" plans, compiling the problem at fixed makespan into an optimization problem as shown before.  ... 
doi:10.3233/aic-2012-0540 fatcat:7c7zcgz7ufazte7xwpn2b3vrqm

Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings

C. Domshlak, J. Hoffmann, A. Sabharwal
2009 The Journal of Artificial Intelligence Research  
Planning as satisfiability, as implemented in, for instance, the SATPLAN tool, is a highly competitive method for finding parallel step-optimal plans.  ...  Surprisingly, the idea turns out to appear quite hopeless in the context of planning as satisfiability.  ...  A preliminary version of this work appeared at ICAPS'06, the 16 th International Conference on Automated Planning and Scheduling (Hoffmann, Sabharwal, & Domshlak, 2006  ... 
doi:10.1613/jair.2817 fatcat:wlgeq6fx6nhqhcvobi37zqr3se

Planning as heuristic search

Blai Bonet, Héctor Geffner
2001 Artificial Intelligence  
We then consider variations and extensions such as reversing the direction of the search for speeding node evaluation, and extracting information about propositional invariants for avoiding dead-ends.  ...  They differ from specialized problem solvers such as those developed for the 24-Puzzle and Rubik's Cube in that they use a general declarative language for stating problems and a general mechanism for  ...  Acknowledgements We thank Daniel Le Berre, Rina Dechter, Patrik Haslum, Jörg Hoffmann, Rao Kambhampati, Richard Korf, and Drew McDermott for discussions related to this work.  ... 
doi:10.1016/s0004-3702(01)00108-4 fatcat:cm6bir2gbfgxbdcbzqwyonvn5i

Refinement Planning as a Unifying Framework for Plan Synthesis

Subbarao Kambhampati
1997 The AI Magazine  
Work on efficient planning algorithms still continues to be a hot topic for research in AI and has led to several exciting developments in the past few years.  ...  This article provides a tutorial introduction to all the algorithms and approaches to the planning problem in AI.  ...  Acknowledgments This article is based on an invited talk given at the 1996 American Association for  ... 
doi:10.1609/aimag.v18i2.1295 dblp:journals/aim/Kambhampati97 fatcat:wwjpgsn6vne4pp426iqacqv6oa

Constraint Expressions and Workflow Satisfiability [article]

Jason Crampton, Gregory Gutin
2013 arXiv   pre-print
An algorithm for determining whether such an assignment exists is important, both as a static analysis tool for workflow specifications, and for the construction of run-time reference monitors for workflow  ...  These methods are surprising versatile, enabling us to develop algorithms for, and determine the complexity of, a number of different problems related to workflow satisfiability.  ...  We consider each possible plan in turn and for each plan we check whether every constraint is satisfied.  ... 
arXiv:1301.3402v2 fatcat:7hiyz3dzqzes7bwzv7y5zmm2a4

Satisfying Interaction Constraints [chapter]

Alex Noort, Rafael Bidarra, Willem F. Bronsvoort
2002 From Geometric Modeling to Shape Modeling  
It searches a model in which such constraints are satisfied, by sampling the parameter space for the model.  ...  This paper describes a solver for constraints on interactions that involve spatial overlap between feature shapes.  ...  Acknowledgment We thank Adrian Bowyer for showing us the way to parameter space.  ... 
doi:10.1007/978-0-387-35495-8_5 fatcat:2a6viqwxfvdexnyahna55jobsi

Component-Oriented Programming as an AI-Planning Problem [chapter]

Debasis Mitra, Walter P. Bond
2002 Lecture Notes in Computer Science  
We have looked into some closely related AI-planning algorithms and suggested directions on how to adopt them for the purpose.  ...  Formalization a type of component-oriented programming (COP) problem (that does not need any non-trivial effort for gluing components together) shows a surprising similarity to the problem of Planning  ...  The planning algorithm uses these two special variables for unification/resolution directing the search for satisfying the temporal constraints.  ... 
doi:10.1007/3-540-48035-8_55 fatcat:dc6mkh7geja6pgt4r55fkuon7u

Contingent planning under uncertainty via stochastic satisfiability

Stephen M. Majercik, Michael L. Littman
2003 Artificial Intelligence  
This is the first work extending the planning-as-satisfiability paradigm to stochastic domains.  ...  We describe a new planning technique that efficiently solves probabilistic propositional contingent planning problems by converting them into instances of stochastic satisfiability (SSAT) and solving these  ...  Acknowledgements We would like to thank Blai Bonet, Zhengzhu Feng, Eric Hansen, Henry Kautz, Donald Loveland, Nilufer Onder, Mark Peot, Toni Pitassi, and our anonymous reviewers for their help during this  ... 
doi:10.1016/s0004-3702(02)00379-x fatcat:qio3lcif6zg4fkzo3kjkwpzh5a

COMPUTER SCIENCE: Satisfied with Physics

C. P. Gomes
2002 Science  
Mézard et al. (1) provide a remarkably detailed picture of the search space of a random K-SAT problem and introduce a new algorithm for finding a satisfying assignment.  ...  It may be tempting to search for an oceanic (and hence climatic) origin for the observed change in J 2 , but as yet there is no evidence.  ... 
doi:10.1126/science.1074599 pmid:12161641 fatcat:nqkaca4bfvgili3esbz4swml4e
« Previous Showing results 1 — 15 out of 83,716 results