Wehrle, MartinRintanen, Jussi2015-12-08December 20302-9743http://hdl.handle.net/1885/36697Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator application based on ∃-step semantics. Operators can be applied in paralleKeywords: Formal logic; Mathematical operators; Parallel processing systems; Semantics; Parallel operator applications; Planning problems; Relaxed semantics; Problem solving20072015-12-08