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

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.

Representing Normative Reasoning in Answer Set Programming Using Weak Constraints

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.

On Combining Abstract Argumentation Frameworks with Knowledge Bases

A Minimal Framework for Knowledge Representation Sufficient to Support Analogical Reasoning and Other Forms of Inductive Inference

Semantics for Description Logics via Assumption-Based Argumentation: Preliminary Results

This paper explores how reasoning over DL terminologies can be captured in argumentative terms, by establishing a translation into Assumption-Based Argumentation (ABA), a rule-based formalism comprising defeasible assumptions, where argumentation semantics are used to retrieve sets of jointly acceptable assumptions.

Same Formulas, Different Semantics: Do Language Models Follow Modal Logic Specifications?

This work constructs paired modal problems with identical premises and conjecture but different frame or domain conditions; automated reasoning verifies opposite labels and releases the formulas, oracle artifacts, countermodels, and responses.