2 papers
cs.FL2015
Optimised determinisation and completion of finite tree automata
John P. Gallagher, Mai Ajspur, Bishoksan Kafle
Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical pro…
cs.LO2012
Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge
Mai Ajspur, Valentin Goranko, Dmitry Shkatov
We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common a…