A Semantic Notion of Interference for Planning Modulo Theories. Bofill, M., Arxer, J. E., & Villaret, M. In 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
{"_id":"72ZR4TPcFuf9D6m7i","bibbaseid":"bofill-arxer-villaret-asemanticnotionofinterferenceforplanningmodulotheories","downloads":0,"creationDate":"2016-03-09T03:04:32.974Z","title":"A Semantic Notion of Interference for Planning Modulo Theories","author_short":["Bofill, M.","Arxer, J. E.","Villaret, M."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/papers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","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":[{"firstnames":["Miquel"],"propositions":[],"lastnames":["Bofill"],"suffixes":[]},{"firstnames":["Joan","Espasa"],"propositions":[],"lastnames":["Arxer"],"suffixes":[]},{"firstnames":["Mateu"],"propositions":[],"lastnames":["Villaret"],"suffixes":[]}],"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","bibtex":"@inproceedings {icaps16-82,\r\n track = {Main Track},\r\n title = {A Semantic Notion of Interference for Planning Modulo Theories},\r\n url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12989},\r\n author = {Miquel Bofill and Joan Espasa Arxer and Mateu Villaret},\r\n abstract = {The aim of being able to reason about quantities, time, space and\r\nmuch more has been the main objective of the many efforts on the\r\nintegration of propositional planning with extensions to handle\r\ndifferent theories. Planning Modulo Theories (PMT) is an\r\napproximation inspired by Satisfiability Modulo Theories (SMT) that \r\ngeneralizes the integration of arbitrary theories with propositional\r\nplanning. Parallel plans are crucial to reduce plan lengths and\r\nhence the time needed to reach a feasible plan in many approaches.\r\nParallelization of actions relies on the notion of\r\n(non-)interference, which is usually determined syntactically at\r\ncompile time. In this paper we present a general semantic notion of\r\ninterference between actions in PMT. Along its generality, this \r\nnotion can be efficiently checked at compile time by means of\r\nsatisfiability checks.},\r\n keywords = {Classical planning,Planning in mixed discrete / continuous domains}\r\n}\r\n\r\n","author_short":["Bofill, M.","Arxer, J. E.","Villaret, M."],"key":"icaps16-82","id":"icaps16-82","bibbaseid":"bofill-arxer-villaret-asemanticnotionofinterferenceforplanningmodulotheories","role":"author","urls":{"Paper":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12989"},"keyword":["Classical planning","Planning in mixed discrete / continuous domains"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["semantic","notion","interference","planning","modulo","theories","bofill","arxer","villaret"],"keywords":["classical planning","planning in mixed discrete / continuous domains"],"authorIDs":[],"dataSources":["iMkx859KiXcegwsin","EZtZjCTnxcdTTyeij"]}