A framework for Conditional Reasoning in Answer Set Programming

TL;DR

This paper introduces Conditional ASP, a framework that extends Answer Set Programming with conditional reasoning using a multi-preferential semantics, enabling advanced reasoning capabilities and formal encoding within ASP.

Contribution

It presents a novel Conditional ASP framework combining conditional logic with ASP, including formal semantics and complexity analysis.

Findings

Conditional ASP supports reasoning over extended answer sets.

The framework is formalized using KLM preferential semantics.

Complexity bounds for reasoning tasks are established.

Abstract

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.