Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FUIN
2007
86views more  FUIN 2007»
10 years 11 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
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 ...
Stéphane Demri, Ewa Orlowska
LOGCOM
2006
90views more  LOGCOM 2006»
10 years 11 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
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...
Nick Bezhanishvili, Balder ten Cate
LOGCOM
2006
101views more  LOGCOM 2006»
10 years 11 months ago
Tableau-based Decision Procedures for Hybrid Logic
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...
Thomas Bolander, Torben Braüner
ENTCS
2007
95views more  ENTCS 2007»
10 years 11 months ago
Hybridizing a Logical Framework
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...
Jason Reed
LOGCOM
2008
94views more  LOGCOM 2008»
10 years 11 months ago
Preservation of Interpolation Features by Fibring
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...
Walter Alexandre Carnielli, João Rasga, Cri...
DSS
2007
98views more  DSS 2007»
10 years 11 months ago
Modelling uncertain positive and negative reasons in decision aiding
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...
Meltem Öztürk, Alexis Tsoukiàs
JOLLI
2008
122views more  JOLLI 2008»
10 years 11 months ago
The Basic Constructive Logic for Negation-Consistency
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...
Gemma Robles
JOLLI
2008
84views more  JOLLI 2008»
10 years 11 months ago
The basic constructive logic for a weak sense of consistency
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...
Gemma Robles, José M. Méndez
IPL
2006
120views more  IPL 2006»
10 years 11 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
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....
Martin Lange, Rafal Somla
CORR
2007
Springer
78views Education» more  CORR 2007»
10 years 11 months ago
Hybrid Branching-Time Logics
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...
Volker Weber
books