63 search results - page 10 / 13 » Conditional Logics of Normality as Modal Systems |
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
FUIN
2010
13 years 6 months ago
2010
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
AGP
1995
IEEE
13 years 11 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
APSEC
2008
IEEE
13 years 9 months ago
2008
IEEE
Reactive systems are often described by interconnecting sub-components along architectural connectors defining communication policies. Generally, such global systems may exhibit p...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...