Defeasible Conditionals using Answer Set Programming

Racquel Dennison, Jesse Heyninck, Thomas Meyer
1/7/2026
cs.AIcs.LO

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Defeasible entailment is concerned with drawing plausible conclusions from incomplete information. A foundational framework for modelling defeasible entailment is the KLM framework. Introduced by Kraus, Lehmann, and Magidor, the KLM framework outlines several key properties for defeasible entailment. One of the most prominent algorithms within this framework is Rational Closure (RC). This paper presents a declarative definition for computing RC using Answer Set Programming (ASP). Our approach enables the automatic construction of the minimal ranked model from a given knowledge base and supports entailment checking for specified queries. We formally prove the correctness of our ASP encoding and conduct empirical evaluations to compare the performance of our implementation with that of existing imperative implementations, specifically the InfOCF solver. The results demonstrate that our ASP-based approach adheres to RC's theoretical foundations and offers improved computational efficiency.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Towards Propositional KLM-Style Defeasible Standpoint Logics

79% match2024

Refining Gelfond Rationality Principle Towards More Comprehensive Foundational Principles for Answer Set Semantics

79% match2025

Using ASP(Q) to Handle Inconsistent Prioritized Data

76% match2026

Formally Explaining Decision Tree Models with Answer Set Programming

76% match2026

Can LLMs Solve ASP Problems? Insights from a Benchmarking Study (Extended Version)

75% match1 repo12025

Generalizing Level Ranking Constraints for Monotone and Convex Aggregates

75% match2023

Cite this paper

@article{dennison2026defeasible,
  title  = {Defeasible Conditionals using Answer Set Programming},
  author = {Racquel Dennison and Jesse Heyninck and Thomas Meyer},
  year   = {2026},
  eprint = {2601.03840},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.03840v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.03840.svg)](https://codeofpaper.com/paper/2601.03840)

Discussion