Revisiting grounded circumscription in description logics

DOI10.1007/978-3-319-45276-0_5zbMATH Open1366.68283DBLPconf/rr/DelivoriasR16OpenAlexW2509849843WikidataQ54824447 ScholiaQ54824447MaRDI QIDQ5268432FDOQ5268432

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The complexity of circumscription in DLs
• Circumscription - a form of non-monotonic reasoning
• Revisiting grounded circumscription in description logics

Cited In (5)

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

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)