Searching for authors named "Carlos Areces" – sorted by Relevance.
48 documents found, showing 1 through 10.
Next 10 →
-
Rijke. Feature Interaction as a Satisfiability Problem
- …We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the specification of additional features (Call Waiting, Call Forwarding, etc.). Furthermore, by using standard re…
- Cited by 6 (0 self) – Add To MetaCart
-
editors. Methods for Modalities 3
- …et ses Applications ” organized the third instance of the Methods for Modalities Workshop (M4M-3) in Nancy, France. As in the previous instances of the workshop, the focus of the meeting was on reasoning methods, decision methods and proof tools for modal and modal-like languages and, also as in pre…
- Cited by 1 (1 self) – Add To MetaCart
-
Description and/or Hybrid Logics
- …Abstract: Improving on work by Schild, De Giacomo and Lenzerini, we establish a tight connection between description logics and hybrid logics, and use this to transfer results on complexity and expressive power from one to the other. Keywords: modal and description logic, hybrid logic, T-Box and A-B…
- Add To MetaCart
-
Iterated Revision in the Spirit of Update: A Lazy Update
- …Since they were introduced, AGM revision and Katsuno and Mendelzon's update have been considered orthogonal theory change operations serving different purposes. This work provides a new presentation of AGM revision based on the update semantic apparatus establishing in such a way a bridge between…
- Add To MetaCart
-
Concrete Domains and Nominals United
- …While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be PSpace-complete, in this article we show that the combination ALCO(D) of these two logics can have a NExpTime-ha…
- Cited by 3 (1 self) – Add To MetaCart
-
HTab: Terminating tableaux system for hybrid logic. Master’s thesis, Département de formation doctorale en informatique
- …Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof system, HyLoRes, is based on the resolution method. An alternative to resolution is the tableaux method…
- Cited by 1 (1 self) – Add To MetaCart
-
HyLoRes: Direct Resolution for Hybrid Logics
- …Introduction Hybrid languages are modal languages that allow direct reference to the elements of the model. Already the basic hybrid language (H(@)) which extends the basic modal language with the addition of nominals (i; j; k; : : :) and satis ability operators (@ i ; @ j ; @ k ; : : :), obviousl…
- Cited by 2 (0 self) – Add To MetaCart
-
Analyzing the Core of Categorial Grammar
- …Even though residuation is at the core of Categorial Grammar [11], it is not always immediate to realize how standard logic systems like Multi-modal Categorial Type Logics (MCTL) [17] actually embody this property. In this paper we focus on the basic system NL [12] and its extension with unary modal…
- Cited by 5 (2 self) – Add To MetaCart
-
HyLoRes: A Hybrid Logic Prover Based on Direct Resolution
- …In recent years, an important number of theoretical results concerning axiomatizability, proof systems (tableaux, natural deduction, etc.), interpolation, expressive power, complexity, etc. for hybrid logics has been obtained. The next natural step is to develop provers that can handle these languag…
- Cited by 3 (3 self) – Add To MetaCart
-
Failure of Interpolation in Combined Modal Logics
- …We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation. The same holds for combinations by taking unions, a generalization of Humberstone’s inaccessibility lo…
- Cited by 11 (5 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
