Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies

Ahmed Laouar; Sihem Belabbès; Salem Benferhat

doi:10.1007/978-3-031-43619-2_25

ScienceGate Book Chapters

BOOK-CHAPTER

Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies

Ahmed Laouar Sihem Belabbès Salem Benferhat

Year: 2023 Lecture notes in computer science Pages: 353-368 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-031-43619-2_25

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Ontology Closure (psychology) Formal concept analysis Conjunctive query Theoretical computer science Rationality Data mining Algorithm

Metrics

Cited By

2.60

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Semantic Web and Ontologies

Physical Sciences → Computer Science → Artificial Intelligence

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies

Metrics

Citation History

Topics

Related Documents

Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies

DL-Lite: tractable description logics for ontologies

Possibilistic DL-Lite

Min-based possibilisticDL-Lite

Conflict Resolution in Partially Ordered OWL DL Ontologies