Abstract
The Halpern-Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We contribute to this effort by showing (among other results), that the BD fragment (where only the operators "begins" and "during" are allowed) is undecidable over discrete structures. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Marcinkowski, J., Michaliszyn, J., & Kieroński, E. (2010). B and D are enough to make the Halpern-Shoham logic undecidable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6199 LNCS, pp. 357–368). https://doi.org/10.1007/978-3-642-14162-1_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
