FUIN
2007
13 years 4 months ago
2007
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
LOGCOM
2006
13 years 4 months 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...
LOGCOM
2006
13 years 4 months ago
2006
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
ENTCS
2007
13 years 4 months ago
2007
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
LOGCOM
2008
13 years 4 months ago
2008
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
DSS
2007
13 years 4 months ago
2007
The use of positive and negative reasons in inference and decision aiding is a recurrent issue of investigation as far as the type of formal language to use within a DSS is concer...
JOLLI
2008
13 years 4 months ago
2008
In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic BK c4 , which is adequate to this sense of consis...
JOLLI
2008
13 years 4 months ago
2008
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
IPL
2006
13 years 4 months ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...