2022 search results - page 42 / 405 » Complexity of Non-Monotonic Logics |
LOGCOM
2006
15 years 16 days ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
109
Voted
RELMICS
1998
Springer
15 years 4 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
124
Voted
DALT
2007
Springer
15 years 6 months ago
2007
Springer
Agent-based modelling approaches are usually based on logical languages, whereas in many areas dynamical system models based on differential equations are used. This paper shows ho...
97
Voted
FOSSACS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
153
click to vote
FROCOS
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the temporal extension of the description logic DL-Lite(RN ) bool with the until operator on concepts, rigid (time-independent) and local (time-dependent) roles, and...