#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2014

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mai Ajspur, Valentin Goranko, Dmitry Shkatov
- Logic Journal of the IGPL
- 2013

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multiagent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for CMAEL(CD) and prove that satisfiability in such… (More)

- John P. Gallagher, Mai Ajspur, Bishoksan Kafle
- ArXiv
- 2014

Determinisation is an important concept in the theory of finite tree automata. However the complexity of the textbook procedure for determinisation is such that it is not viewed as a being a practical procedure for manipulating tree automata, even fairly small ones. The computational problems are exacerbated when an automaton has to be both determinised and… (More)

- Mai Ajspur, Valentin Goranko
- ICLA
- 2013

Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and… (More)

The model-checking problem is to decide, given a formula φ and an interpretation M , whether M satisfies φ, written M |= φ. Model-checking algorithms for temporal logics were initially developed with finite models (such as models of hardware) in mind so that M |= φ is decidable. As interest grew in model-checking infinite systems, other approaches were… (More)

- ‹
- 1
- ›