Reasoning on with Defeasibility in ASP
type: Item
instance of: scholarly article
title: Reasoning on with Defeasibility in ASP
zbMATH Open document ID: 1530.68244
arXiv ID: 2106.14801
author: Loris Bozzato
author: Thomas Eiter
author: Luciano Serafini
published in: Theory and Practice of Logic Programming
publication date: 2023-12-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/2106.14801
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 7776342
zbMATH Keywords: defeasible knowledge
zbMATH Keywords: description logics
zbMATH Keywords: answer-set programming
zbMATH Keywords: justifiable exceptions
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3175443120
cites work: Q4406531
cites work: The power of non-ground rules in Answer Set Programming
cites work: Q3112648
cites work: Enhancing context knowledge repositories with justifiable exceptions
cites work: Description logic, theory combination, and all that. Essays dedicated to Franz Baader on the occasion of his 60th birthday
cites work: Introducing Role Defeasibility in Description Logics
cites work: Disjunctive logic programs with inheritance
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: Tractable reasoning and efficient query answering in description logics: The DL-Lite family
cites work: Rational Closure for Defeasible Description Logics
cites work: A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
cites work: Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
cites work: Combining answer set programming with description logics for the semantic web
cites work: Q4863622
cites work: Q3983043
cites work: A non-monotonic description logic for reasoning about typicality
cites work: Logics in artificial intelligence. 12th European conference, JELIA 2010, Helsinki, Finland, September 13--15, 2010. Proceedings
cites work: Efficient Inferencing for OWL EL
cites work: Strongly equivalent logic programs
cites work: Including quantification in defeasible reasoning for the description logic \(\mathcal{EL}_{\bot}\)
cites work: Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
cites work: A common view on strong, uniform, and other notions of equivalence in answer-set programming
DOI: 10.1017/S1471068421000132
description: scientific article; zbMATH DE number 7776342