Reasoning on with Defeasibility in ASP
From MaRDI portal
Publication:6063881
DOI10.1017/s1471068421000132zbMath1530.68244arXiv2106.14801OpenAlexW3175443120MaRDI QIDQ6063881
Thomas Eiter, Luciano Serafini, Loris Bozzato
Publication date: 12 December 2023
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.14801
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-monotonic description logic for reasoning about typicality
- The complexity of propositional closed world reasoning and circumscription
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Enhancing context knowledge repositories with justifiable exceptions
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Description logic, theory combination, and all that. Essays dedicated to Franz Baader on the occasion of his 60th birthday
- Combining answer set programming with description logics for the semantic web
- Including quantification in defeasible reasoning for the description logic \(\mathcal{EL}_{\bot}\)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Logics in artificial intelligence. 12th European conference, JELIA 2010, Helsinki, Finland, September 13--15, 2010. Proceedings
- Introducing Role Defeasibility in Description Logics
- Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
- Disjunctive logic programs with inheritance
- The power of non-ground rules in Answer Set Programming
- Rational Closure for Defeasible Description Logics
- Efficient Inferencing for OWL EL
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Strongly equivalent logic programs
This page was built for publication: Reasoning on with Defeasibility in ASP
