A Semantic Notion of Interference for Planning Modulo Theories. Bofill, M.; Arxer, J. E.; and Villaret, M. In
A Semantic Notion of Interference for Planning Modulo Theories [link]Paper  abstract   bibtex   
The aim of being able to reason about quantities, time, space and much more has been the main objective of the many efforts on the integration of propositional planning with extensions to handle different theories. Planning Modulo Theories (PMT) is an approximation inspired by Satisfiability Modulo Theories (SMT) that generalizes the integration of arbitrary theories with propositional planning. Parallel plans are crucial to reduce plan lengths and hence the time needed to reach a feasible plan in many approaches. Parallelization of actions relies on the notion of (non-)interference, which is usually determined syntactically at compile time. In this paper we present a general semantic notion of interference between actions in PMT. Along its generality, this notion can be efficiently checked at compile time by means of satisfiability checks.
@inproceedings {icaps16-82,
    track    = {​Main Track},
    title    = {A Semantic Notion of Interference for Planning Modulo Theories},
    url      = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12989},
    author   = {Miquel Bofill and  Joan Espasa Arxer and  Mateu Villaret},
    abstract = {The aim of being able to reason about quantities, time, space and
much more has been the main objective of the many efforts on the
integration of propositional planning with extensions to handle
different theories. Planning Modulo Theories (PMT) is an
approximation inspired by Satisfiability Modulo Theories (SMT) that 
generalizes the integration of arbitrary theories with propositional
planning. Parallel plans are crucial to reduce plan lengths and
hence the time needed to reach a feasible plan in many approaches.
Parallelization of actions relies on the notion of
(non-)interference, which is usually determined syntactically at
compile time. In this paper we present a general semantic notion of
interference between actions in PMT. Along its generality, this 
notion can be efficiently checked at compile time by means of
satisfiability checks.},
    keywords = {Classical planning,Planning in mixed discrete / continuous domains}
}
Downloads: 0