Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics

DOI10.1007/978-3-319-99906-7_12MaRDI QIDQ6104767zbMATH OpenOpenAlexFDO

Authors Sebastian Rudolph, Lukas Schweizer

Publication date 28 June 2023

Published in Rules and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99906-7_12

zbMATH Keywords

axiomsdescription logicdescription logic knowledge basefinite model reasoningfixed domain

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 6902546
• Description Logics
• Combining answer set programming with description logics for the semantic web
• A formal theory of justifications
• The loop formula based semantics of description logic programs

Cites work

• A theory of diagnosis from first principles
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 6902546 (Why is no real title available?)
• Justifications for logic programs under answer set semantics
• Logic programs with stable model semantics as a constraint programming paradigm
• Stepwise debugging of answer-set programs
• The complexity of facets resolved
• The complexity of finite model reasoning in description logics
• The Description Logic Handbook
• Understanding the complexity of axiom pinpointing in lightweight description logics

Cited in

(2)

• scientific article; zbMATH DE number 6902546 (Why is no real title available?)
• A general framework for preferences in answer set programming

This page was built for publication: Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104767)