An Epistemic Halpern-Shoham Logic
نویسندگان
چکیده
We define a family of epistemic extensions of Halpern–Shoham logic for reasoning about temporal-epistemic properties of multi-agent systems. We exemplify their use and study the complexity of their model checking problem. We show a range of results ranging from PTIME to PSPACE– hard depending on the logic considered.
منابع مشابه
Model Checking Epistemic Halpern-Shoham Logic Extended with Regular Expressions
The Epistemic Halpern-Shoham logic (EHS) is a temporalepistemic logic that combines the interval operators of the HalpernShoham logic with epistemic modalities. The semantics of EHS is based on interpreted systems whose labelling function is defined on the endpoints of intervals. We show that this definition can be generalised by allowing the labelling function to be based on the whole interval...
متن کاملSearching for Well-Behaved Fragments of Halpern-Shoham Logic
Temporal reasoning constitutes one of the main topics within the field of Artificial Intelligence. Particularly interesting are interval-based methods, in which time intervals are treated as basic ontological objects, in opposite to point-based methods, where time-points are considered as basic. The former approach is more expressive and seems to be more appropriate for such applications as nat...
متن کاملDecidability of model checking multi-agent systems against a class of EHS specifications
We define and illustrate the expressiveness of the AB̄L fragment of the Epistemic Halpern–Shoham Logic as a specification language for multi-agent systems. We consider the model checking problem for systems against specifications given in the logic. We show its decidability by means of a novel technique that may be reused in other contexts for showing decidability of other logics based on interv...
متن کاملB and D Are Enough to Make the Halpern-Shoham Logic Undecidable
The Halpern Shoham logic is a modal logic of time intervals. Some e ort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satis ability problem. We contribute to this e ort by showing (among other results), that the BD fragment (where only the operators begins and during are allowed) is undecidable over discrete structures.
متن کاملEpistemic Semantics for Fixed-Points Non-Monotonic Logics
1 I N T R O D U C T I O N Exist ing nonmonotonic logics can be divided roughly into two kinds. One is based on fixed points, like default logic [Reiter 1980] or autoepistemic logic ([Moore 1983], [Konolige 1988], and [Levesque 1989]). The other is based on minimal models, like circumscription ( [McCarthy 1980, 1984] and [Lifschitz 1987]) or minimal knowledge ([Halpern and Moses 1984], [Shoham 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013