On the Equational Definition of the Least Prefixed Point
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Calculus of Circular Proofs and Its Categorical Semantics
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
On Hybrid Systems and the Modal µ-calculus
Hybrid Systems V
On the equational definition of the least prefixed point
Theoretical Computer Science - Mathematical foundations of computer science
Automata logics, and infinite games
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
An axiomatization of bisimulation quantifiers via the µ-calculus
Theoretical Computer Science
A Tableau System for the Modal μ-Calculus
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Representing and verifying temporal epistemic properties in multi-agent systems
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Completeness for flat modal fixpoint logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the logic of argumentation theory
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Flat coalgebraic fixed point logics
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science (ENTCS)
The modal µ-calculus caught off guard
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Verifying real-time temporal, cooperation and epistemic properties for uncertain agents
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Model checking for epistemic and temporal properties of uncertain agents
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Sahlqvist theorem for modal fixed point logic
Theoretical Computer Science
Deriving non-determinism from conjunction and disjunction
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Argumentation in the view of modal logic
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
Tangled modal logic for spatial reasoning
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |