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

Ahmed Laouar; Salem Benferhat

doi:10.1007/978-3-032-04587-4_15

ScienceGate Book Chapters

BOOK-CHAPTER

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

Ahmed Laouar Salem Benferhat

Year: 2025 Lecture notes in computer science Pages: 240-256 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-032-04587-4_15

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Closure (psychology) Inference Fuzzy inference Theoretical computer science Algorithm Artificial intelligence Adaptive neuro fuzzy inference system Fuzzy logic

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.46

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Semantic Web and Ontologies

Physical Sciences → Computer Science → Artificial Intelligence

Natural Language Processing Techniques

Physical Sciences → Computer Science → Artificial Intelligence

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

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

Metrics

Topics

Related Documents

Tractable Closure-Based Possibilistic Repair for 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