\({\mathcal E}\)-connections of abstract description systems
From MaRDI portal
Publication:814594
DOI10.1016/j.artint.2004.02.002zbMath1085.68162OpenAlexW1981237135MaRDI QIDQ814594
Oliver Kutz, Frank Wolter, Carsten Lutz, Michael Zakharyashchev
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2004.02.002
Related Items (12)
Towards resolution-based reasoning for connected logics ⋮ Linking Open-World Knowledge Bases Using Nonmonotonic Rules ⋮ A framework for modular ERDF ontologies ⋮ Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design ⋮ Distributed first order logic ⋮ Mapping Properties of Heterogeneous Ontologies ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ Flexible software architectures for ontology-based information systems ⋮ Formal Properties of Modularisation ⋮ On Importing Knowledge from Ontologies. ⋮ Formal and Conceptual Comparison of Ontology Mapping Languages ⋮ Ontology Integration Using ε-Connections
Uses Software
Cites Work
- Maintaining knowledge about temporal intervals
- The complexity of reasoning about knowledge and time. I: Lower bounds
- A guide to completeness and complexity for modal logics of knowledge and belief
- Modal languages and bounded fragments of predicate logic
- On the expressivity of feature logics with negation, functional uncertainty, and sort equations
- Adding a temporal dimension to a logic system
- Frontiers of combining systems. First international workshop, Munich, Germany, March 26--29, 1996
- Many-dimensional modal logics: theory and applications
- Frontiers of combining systems. 4th international workshop, FroCos 2002, Santa Margherita Ligure, Italy, April 8--10, 2002. Proceedings
- First-order modal logic
- Frontiers of combining systems. 3rd international workshop, FroCoS 2000, Nancy, France, March 22--24, 2000. Proceedings
- A note on graded modal logic
- In so many possible worlds
- PSPACE Reasoning for Graded Modal Logics
- Axiomatizing Distance Logics
- The complexity of propositional linear temporal logics
- Properties of independently axiomatizable bimodal logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Decision procedures for BDI logics
- Complexity of products of modal logics
- A propositional modal logic of time intervals
- Time-dependent concepts: representation and reasoning using temporal description logics
- Towards a Logic of Rational Agency
- Practical reasoning for very expressive description logics
- The computational complexity of hybrid temporal logics
- « Everywhere » and « here »
- On modal logics betweenK × K × KandS5 × S5 × S5
- A multi-dimensional terminological knowledge representation language
- Logics of metric spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \({\mathcal E}\)-connections of abstract description systems