B and D Are Enough to Make the Halpern-Shoham Logic Undecidable

Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisability problem. We contribute to this eort by showing (among other results), that the

• Type: Conference
• Year: 2010
• Where: ICALP
• Authors: Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski
• Keywords: HalpernShoham Logic, ICALP 2010, Logic, Modal Logic, Programming Languages