Assertional Removed Sets Merging of DL-Lite Knowledge Bases

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-35514-2_16
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Adding DL-Lite TBoxes to Proper Knowledge Bases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Extending Removed Sets Revision to Partially Preordered Belief Bases

International Journal of Approximate Reasoning
Applied MathematicsTheoretical Computer ScienceArtificial IntelligenceSoftware
2011English

Two Approaches to Merging Knowledge Bases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Capturing Instance Level Ontology Evolution for DL-Lite

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The Non-Archimedean Polynomials and Merging of Stratified Knowledge Bases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Complexity of Answering Counting Aggregate Queries Over DL-Lite

SSRN Electronic Journal
2015English

Temporal Query Answering in DL-Lite With Negation

English

Interpreting Embedding Models of Knowledge Bases.

English

Refactoring Methods for Knowledge Bases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy