Skip to content

Representing Normative Reasoning in Answer Set Programming Using Weak Constraints

· 1 citation · 32 references

TL;DR

This work encodes a range of famous paradoxes in Answer Set Programming (ASP) using weak constraints, which abstraction and generalization provides a plain methodology for encoding normative systems in this language.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

A Simple Doxastic Deontic Logic for Norm-Guided Decision Making

Making decisions despite conflicting norms and incomplete or unreliable information is a fundamental challenge for autonomous systems. We introduce a simple doxastic deontic logic for this setting: a classically reducible fragment of Chellas'Minimal Deontic Logic, extended with explicit conditional norms and combined w...

Thorsten Engesser, Agata Ciabattoni · 0 citations
Aug 2026

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

This work proposes to consider the three refined GAS principles as alternative principles for answer set semantics in general and for answer set and world view construction in particular and analyzes the computational complexity of well-supportedness and the rational answer set and world view semantics.

Yi-Dong Shen, Thomas Eiter · 0 citations
Open access 2026

Ezumezu Deontic Logic: An African–inspired formal framework for normative reasoning

Artificial intelligence systems increasingly operate in normative domains where ethical and legal obligations must be formally represented. Standard Deontic Logic (SDL), a central reference point in formal treatments of normative reasoning, presupposes bivalence and deontic necessitation, and its structural commitments...

R. Leeuwendal · 0 citations
#artificial intelligence Preprint Aug 2026

Preference Reasoning under Indeterminacy in Large Language Models

It is argued that indeterminacy, rather than correctness alone, is a central challenge for AI reasoning, and that state-of-the-art language models systematically fail to distinguish between determined and undetermined instances, exhibiting miscalibrated reasoning even in verification settings.

Hadi Hosseini, Samarth Khanna, Xiyuan Wang · 0 citations

Knowledge Engineering and Reasoning with Answer Set Programs and Conditional Belief Bases

This paper points out general differences between the reasoning processes of ASP vs. conditionals and provides guidelines for knowledge engineering with ASP and conditionals, and illustrates how choosing either of the two frameworks has significant effects on the resulting solutions.

Alexander Hahn, A. Thevapalan, Gabriele Kern-Isberner et al. · 0 citations
#artificial intelligence Preprint Sep 2026

ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning

Recent progress in large language model reasoning has been driven by benchmarks and reinforcement learning environments with automatically verifiable rewards, particularly in mathematics, code, and formal logic. These settings make model accuracy easier to evaluate and optimize, but it remains unclear how far success u...

Ibrahim Ethem Deveci, Funda Tan Çalık, Barış Deniz Sağlam et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.