Many-dimensional Modal Logic of Tense and Temporal Interval and its Decidability
نویسندگان
چکیده
منابع مشابه
Many-dimensional Modal Logic of Tense and Temporal Interval and its Decidability
Linear tense logics are widely accepted for structural temporal representation, where the basic has two modal operators G and H, each of which represents the future and the past, respectively. On the other hand, the temporal interval relations arranged by Allen have long been the standard of natural language semantics, though it still lacks the modal-logical foundation. Van Benthem [10] propose...
متن کاملExpressiveness, Decidability, and Undecidability of Interval Temporal Logic
Interval Temporal Logics are formalisms particularly suitable to express temporal properties. Unlike standard temporal logics, they use intervals, instead of points, as primitive ontological entities. The most studied propositional interval temporal logic is Halpern and Shoham’s Modal Logic of Time Intervals (HS for short). It features a modal operator for each possible ordering relation betwee...
متن کاملDecidability of the interval temporal logic AABB over the rationals
The classification of the fragments of Halpern and Shoham’s logic with respect to decidability/undecidability of the satisfiability problem is now very close to the end. We settle one of the few remaining questions concerning the fragment AĀBB̄, which comprises Allen’s interval relations “meets” and “begins” and their symmetric versions. We already proved that AĀBB̄ is decidable over the class of...
متن کاملInsights into Modal Slash Logic and Modal Decidability
The present paper has a two-fold task. On the one hand, it aims to provide an overview on Independence friendly modal logic as defined in (Tulenheimo, 2003; Tulenheimo, 2004) and studied in a number of subsequent publications. For systematic reasons to be explained, the logic is here referred to as modal slash logic (MsL). On the other hand, we take a close look at a syntactic fragment of MsL, ...
متن کاملInterval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be capt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2006
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.21.257