#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1980

2016

- This year (0)
- Last 5 years (20)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jerzy Marcinkowski, Jakub Michaliszyn
- 2011 IEEE 26th Annual Symposium on Logic in…
- 2011

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 complete this classification by showing - what we believe is quite an unexpected result - that the logic of subintervals, the fragment of the… (More)

- Alessio Lomuscio, Jakub Michaliszyn
- IJCAI
- 2013

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.

Artifact-centric systems are a recent paradigm for representing and implementing business processes. We present further results on the verification problem of artifact-centric systems specified by means of FO-CTL specifications. While the general problem is known to be undecidable, results in the literature prove decidability for artifact systems with… (More)

- Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
- 2012 27th Annual IEEE Symposium on Logic in…
- 2012

We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary… (More)

- Alessio Lomuscio, Jakub Michaliszyn
- ECAI
- 2014

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… (More)

- Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski
- ICALP
- 2010

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… (More)

- Jerzy Marcinkowski, Jakub Michaliszyn
- Fundam. Inform.
- 2014

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 complete this classification by showing — what we believe is quite an unexpected result — that the logic of subintervals, the fragment of the… (More)

- Jakub Michaliszyn
- ICALP
- 2009

We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fragment with transitive guards, and in fact extends its expressive power non-trivially, preserving the complexity: we prove that its satis ability problem is 2Exptime-

- Jakub Michaliszyn, Jan Otop
- 2012 27th Annual IEEE Symposium on Logic in…
- 2012

In this paper, the modal logic over classes of structures definable by universal first-order Horn formulas is studied. We show that the satisfiability problems for that logics are decidable, confirming the conjecture from [E. Hemaspaandra and H. Schnoor, On the Complexity of Elementary Modal Logics, STACS 08]. We provide a full classification of logics… (More)

- Emanuel Kieronski, Jakub Michaliszyn
- CSL
- 2012

We prove that the satisfiability problem for the two-variable, universal fragment of first-order logic with constants (or, alternatively phrased, for the Bernays-Schönfinkel class with two universally quantified variables) remains decidable after augmenting the fragment by the transitive closure of a single binary relation. We give a 2-NExpTime-upper bound… (More)