Revisiting grounded circumscription in description logics

DOI10.1007/978-3-319-45276-0_5MaRDI QIDQ5268432zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stathis Delivorias, Sebastian Rudolph

Publication date 20 June 2017

Published in Web Reasoning and Rule Systems (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-01400068/file/groundedscotland.pdf

Mathematics Subject Classification ID

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

Recommendations

• Decidability of circumscribed description logics revisited
• The complexity of circumscription in DLs
• scientific article; zbMATH DE number 640290
• Counterexample guided abstraction refinement algorithm for propositional circumscription
• scientific article; zbMATH DE number 4026858

Cites work

• Circumscription - a form of non-monotonic reasoning
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• Revisiting grounded circumscription in description logics
• The complexity of circumscription in DLs

Cited in

(5)

• The complexity of circumscription in DLs
• Counterexample guided abstraction refinement algorithm for propositional circumscription
• Decidability of circumscribed description logics revisited
• Revisiting grounded circumscription in description logics
• Query answering in circumscribed OWL2 profiles

This page was built for publication: Revisiting grounded circumscription in description logics

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