Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
The logic of games and its applications
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
Bisimulation through probabilistic testing
Information and Computation
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Conditional logics of belief change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Handbook of logic in computer science (vol. 3)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Reasoning about Uncertainty
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Closure Properties of Coalgebra Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The Description Logic Handbook
The Description Logic Handbook
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Shallow Models for Non-iterative Modal Logics
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation
Information and Computation
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Rank-1 modal logics are coalgebraic
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Beyond rank 1: algebraic semantics and finite models for coalgebraic logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Presburger modal logic is PSPACE-Complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Ultrafilter extensions for coalgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Modular algorithms for heterogeneous modal logics
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Probabilistic Logical Characterization
Information and Computation
Hi-index | 0.00 |
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' firm belief that the systematic exploitation of this coalgebraic nature will not only have impact on the field of modal logic itself but also lead to significant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility.