X and more Parallelism. Integrating LTL-Next into SAT-based Planning with Trajectory Constraints while Allowing for even more Parallelism
Linear temporal logic (LTL) provides expressive means to specify temporally extended goals as well as preferences. Recent research has focussed on compilation techniques, i.e., methods to alter the domain ensuring that every solution adheres to the temporally extended goals. This requires either new...
Main Authors: | Gregor Behnke, Susanne Biundo |
---|---|
Format: | Article |
Language: | English |
Published: |
Asociación Española para la Inteligencia Artificial
2018-09-01
|
Series: | Inteligencia Artificial |
Subjects: | |
Online Access: | https://journal.iberamia.org/index.php/intartif/article/view/226 |
Similar Items
-
An Experimental Survey of Extended Resolution Effects for SAT Solvers on the Pigeonhole Principle
by: Tomohiro Sonobe
Published: (2022-12-01) -
A hierarchy of tractable subclasses for SAT and counting SAT problems
by: Rinard, Martin C., et al.
Published: (2010) -
LTL-Specification of Counter Machines
by: Egor V. Kuzmin
Published: (2021-03-01) -
LTL-Specification of Bounded Counter Machines
by: Egor V. Kuzmin
Published: (2022-03-01) -
Bob Miller's SAT math for the clueless : SAT math /
by: Miller, Robert, 1943-
Published: (1999)