Formal Properties of Modularisation
From MaRDI portal
Publication:3631354
DOI10.1007/978-3-642-01907-4_3zbMath1242.68315OpenAlexW2122325470MaRDI QIDQ3631354
Frank Wolter, Carsten Lutz, Dirk Walther, Boris Konev
Publication date: 9 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01907-4_3
Related Items (10)
Progression of Decomposed Local-Effect Action Theories ⋮ Semantic forgetting in expressive description logics ⋮ Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design ⋮ Distributed first order logic ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ On decidability of the decomposability problem for finite theories ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Towards a functional approach to modular ontologies using institutions ⋮ (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data complexity of query answering in description logics
- Forgetting for knowledge bases in DL-lite
- \({\mathcal E}\)-connections of abstract description systems
- Deciding inseparability and conservative extensions in the description logic
- Model theory.
- Many-dimensional modal logics: theory and applications
- Undefinability of propositional quantifiers in the modal system S4
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- The Logical Difference Problem for Description Logic Terminologies
- Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- Institutions: abstract model theory for specification and programming
- Complexity of interpolation and related problems in positive calculi
- Semantical characterizations and complexity of equivalences in answer set programming
- Strongly equivalent logic programs
This page was built for publication: Formal Properties of Modularisation