A framework for Conditional Reasoning in Answer Set Programming
Not on the map. Why?
Abstract (arXiv)
In this paper we introduce a Conditional Answer Set Programming framework (Conditional ASP) for the definition of conditional extensions of Answer Set Programming (ASP). The approach builds on a conditional logic with typicality, and on the combination of a conditional knowledge base with an ASP program, and allows for conditional reasoning over the answer sets of the program. The formalism relies on a multi-preferential semantics, and on the KLM preferential semantics, as a special case. Conditional entailment is encoded in ASP and a complexity upper-bound is provided.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 40 references that are in the map. First posted on arXiv 4 Jun 2025.
Builds on
8 of 40 references.
References · 8
- 2020An ASP approach for reasoning in a concept-aware multipreferential lightweight DLcited by 12
- 2018On Rational Entailment for Propositional Typicality Logiccited by 7
- 2020A framework for a modular multi-concept lexicographic closure semanticscited by 5
- 2021Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measurescited by 4
- 2016ASP for Minimal Entailment in a Rational Extension of SROELcited by 2
- 2018Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closurecited by 2
- 2023Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicalitycited by 2
- 2023A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicalitycited by 1
Built on by
Not cited yet.