Skip navigation
Skip navigation

Planning as satisfiability: Parallel plans and algorithms for plan search

Rintanen, Jussi; Heljanko, Keijo; Niemela, Ilkka


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...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Artificial Intelligence
DOI: 10.1016/j.artint.2006.08.002


File Description SizeFormat Image
01_Rintanen_Planning_as_satisfiability:_2006.pdf1.21 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator