Results 1 -
7 of
7
Towards constructive hybrid logic (Extended Abstract)
- IN ELEC. PROC. OF METHODS FOR MODALITIES 3
, 2003
"... ..."
Constructive CK for Contexts
- In Proceedings of the First Workshop on Context Representation and Reasoning, CONTEXT’05
, 2005
"... Abstract. This note describes possible world semantics for a constructive modal logic CK. The system CK is weaker than other constructive modal logics K as it does not satisfy distribution of possibility over disjunctions, neither binary (✸(A ∨ B) → ✸A ∨ ✸B) nor nullary (✸ ⊥ → ⊥). We are intereste ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Abstract. This note describes possible world semantics for a constructive modal logic CK. The system CK is weaker than other constructive modal logics K as it does not satisfy distribution of possibility over disjunctions, neither binary (✸(A ∨ B) → ✸A ∨ ✸B) nor nullary (✸ ⊥ → ⊥). We are interested in this version of constructive K for its application to contexts in AI [dP03]. However, our previous work on CK described only a categorical semantics [BdPR01] for the system, while most logicians interested in contexts prefer their semantics possible worlds style. This note fills the gap by providing the possible worlds model theory for the constructive modal system CK, showing soundness and completeness of the proposed semantics, as well as the finite model property and (hence) decidability of the system. Wijesekera [Wij90] investigated possible worlds semantics of a system similar to CK, without the binary distribution, but satisfying the nullary one. The semantics presented here for CK is new and considerably simpler than the one of Wijesekera. 1
Calculi for intuitionistic normal modal logic
- In Proceedings of Programming and Programming Languages
, 2007
"... This paper provides a call-by-name and a call-by-value term calculus, both of which have a Curry-Howard correspondence to the box fragment of the intuitionistic modal logic IK. The strong normalizability and the confluency of the calculi are shown. Moreover, we define a CPS transformation from the c ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper provides a call-by-name and a call-by-value term calculus, both of which have a Curry-Howard correspondence to the box fragment of the intuitionistic modal logic IK. The strong normalizability and the confluency of the calculi are shown. Moreover, we define a CPS transformation from the call-by-value calculus to the call-by-name calculus, and show its soundness and completeness. 1
Call-by-name and call-by-value in normal modal logic
"... Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extensions of the λµ-calculi, and their semantics are given by CPS transformations into a calculus corresponding to the intuition ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extensions of the λµ-calculi, and their semantics are given by CPS transformations into a calculus corresponding to the intuitionistic fragment of K. The duality between call-by-name and call-by-value with modalities is investigated in our calculi. 1
Exponential Speedup in UL Subsumption Checking Relative to General TBoxes for the Constructive Semantics
"... Abstract. The complexity of the subsumption problem in description logics can vary widely with the choice of the syntactic fragment and the semantic interpretation. In this paper we show that the constructive semantics of concept descriptions, which includes the classical descriptive semantics as a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. The complexity of the subsumption problem in description logics can vary widely with the choice of the syntactic fragment and the semantic interpretation. In this paper we show that the constructive semantics of concept descriptions, which includes the classical descriptive semantics as a special case, offers exponential speed-up in the existentialdisjunctive fragment UL of ALC. 1
Towards Constructive Decision . . .
, 2009
"... This paper explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truth-value interpretation to a constructive interpretation. We argue that such a strengthened interpretation is ..."
Abstract
- Add to MetaCart
This paper explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truth-value interpretation to a constructive interpretation. We argue that such a strengthened interpretation is essential to represent applications with partial information adequately and to achieve consistency under abstraction as well as robustness under refinement. We introduce a constructive version of ALC, called cALC, for which we give a sound and complete Hilbert axiomatisation and a Gentzen tableau calculus showing finite model property and decidability. 1 When Constructiveness Matters Knowledge representatio

