Decidability of Circumscribed Description Logics Revisited

We revisit non-monotonic description logics based on circumscription (with preferences) and prove several decidability results for their satisfiability problem. In particular, we consider circumscribed description logics without the finite model property (DL-Lite $_{\mathcal{F}}$ and $\mathcal{ALCFI...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Knowledge Representation, Logic Programming, and Abstract Argumentation pp. 112 - 124
Main Authors Bonatti, Piero, Faella, Marco, Lutz, Carsten, Sauro, Luigi, Wolter, Frank
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2015
SeriesLecture Notes in Computer Science
Subjects
Binary Predicate
Concept Inclusion
Description Logic
Finite Model Property
Model Property
Online AccessGet full text
ISBN9783319147253
3319147250
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-14726-0_8

Cover

More Information
Summary:We revisit non-monotonic description logics based on circumscription (with preferences) and prove several decidability results for their satisfiability problem. In particular, we consider circumscribed description logics without the finite model property (DL-Lite $_{\mathcal{F}}$ and $\mathcal{ALCFI}$ ) and with fixed roles (DL-Lite $_{\mathcal{F}}$ and a fragment of DL-Lite $_{\mathcal{R}}$ ), improving upon previous decidability results that are limited to logics which have the finite model property and do not allow to fix roles during minimization.
Bibliography:Original Abstract: We revisit non-monotonic description logics based on circumscription (with preferences) and prove several decidability results for their satisfiability problem. In particular, we consider circumscribed description logics without the finite model property (DL-Lite\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$_{\mathcal{F}}$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{ALCFI}$\end{document}) and with fixed roles (DL-Lite\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$_{\mathcal{F}}$\end{document} and a fragment of DL-Lite\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$_{\mathcal{R}}$\end{document}), improving upon previous decidability results that are limited to logics which have the finite model property and do not allow to fix roles during minimization.
ISBN:9783319147253
3319147250
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-14726-0_8