Sciweavers

711 search results - page 114 / 143
» Modal Logics are Coalgebraic
Sort
View
JAPLL
2008
76views more  JAPLL 2008»
14 years 10 months ago
The many faces of counts-as: A formal analysis of constitutive rules
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...
Davide Grossi, John-Jules Ch. Meyer, Frank Dignum
ICFP
2002
ACM
15 years 10 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
CONCUR
2004
Springer
15 years 3 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
LMCS
2007
132views more  LMCS 2007»
14 years 10 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
DALT
2005
Springer
15 years 3 months ago
Beliefs in Agent Implementation
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
Laurens Winkelhagen, Mehdi Dastani, Jan Broersen