Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/ai/KontchakovWZ10, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2010.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126608643 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62048631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data complexity of query answering in description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning and efficient query answering in description logics: The DL-Lite family / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linking Data to Ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DL-Lite Family and Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular ontologies. Concepts, theories and techniques for knowledge modularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic forgetting in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an interpretation of second order quantification in first order intuitionistic propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Properties of Modularisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adaptive multi-engine solver for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Logic for Life Science Ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: CASL reference manual. The complete documentation of the common algebraic specification language. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the refinement of ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical characterizations and complexity of equivalences in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Strong Equivalence for Logic Programs with Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding inseparability and conservative extensions in the description logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logical Difference Problem for Description Logic Terminologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first order properties of products of algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Boolean algebra with Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Clause Reasoning in QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Dependency Schemes in Search-Based QBF Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Seventh QBF Solvers Evaluation (QBFEVAL’10) / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ai/KontchakovWZ10 / rank
 
Normal rank

Latest revision as of 14:56, 13 November 2024

scientific article
Language Label Description Also known as
English
Logic-based ontology comparison and module extraction, with an application to DL-Lite
scientific article

    Statements

    Logic-based ontology comparison and module extraction, with an application to DL-Lite (English)
    0 references
    0 references
    0 references
    0 references
    31 January 2011
    0 references
    The paper, which is an extended version of two previous papers, gives formalizations of five variants of \(\Sigma\)-difference, \(\Sigma\)-entailment and \(\Sigma\)-inseparability and analyzes a framework for signature-based notions of difference, entailment and inseparability between ontologies in the description logics DL-Lite. These notions can be used to compare two versions of an ontology, to check whether importing one ontology into another has (possibly unwanted) side-effects, and to study and define refinements of a given ontology. It is demonstrated that \(\Sigma\)-inseparability can be used as a framework for both module extraction and forgetting. In addition, the computational complexity of deciding our \(\Sigma\)-entailment relations between DL-Lite ontologies is studied and the corresponding decision algorithms are presented. Finally, experimental results of using QBF solvers to decide \(\Sigma\)-inseparability and extract (minimal) modules are given together with a discussion of problems that remain unsolved.
    0 references
    description logic
    0 references
    ontology
    0 references
    module extraction
    0 references
    entailment
    0 references
    computational complexity
    0 references
    uniform interpolation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers