English
Related papers

Related papers: Defeasible Conditional Obligation in a Two-tiered …

200 papers

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

We give an overview of logical and semantical rules for nonmonotonic and related logics.

Logic · Mathematics 2008-08-25 Dov Gabbay , Karl Schlechta

We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according…

Artificial Intelligence · Computer Science 2020-09-07 Laura Giordano , Daniele Theseider Dupré

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…

Logic in Computer Science · Computer Science 2014-02-20 Julio Lemos

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by…

Artificial Intelligence · Computer Science 2025-04-25 Lucas Carr , Nicholas Leisegang , Thomas Meyer , Sergei Obiedkov

In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a deep neural network model. Weighted knowledge bases for description logics are considered under…

Artificial Intelligence · Computer Science 2021-01-26 Laura Giordano , Daniele Theseider Dupré

Starting from the observation that rational closure has the undesirable property of being an "all or nothing" mechanism, we here propose a multipreferential semantics, which enriches the preferential semantics underlying rational closure in…

Artificial Intelligence · Computer Science 2018-01-23 Laura Giordano , Valentina Gliozzi

This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type "if ... then ...",…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann , Menachem Magidor

The primary theme of this investigation is a decision theoretic account of conditional ought statements (e.g., "You ought to do A, if C") that rectifies glaring deficiencies in classical deontic logic. The resulting account forms a sound…

Artificial Intelligence · Computer Science 2013-03-08 Judea Pearl

In this paper we present a theorem proving methodology for a restricted but significant fragment of the conditional language made up of (boolean combinations of) conditional statements with unnested antecedents. The method is based on the…

Logic in Computer Science · Computer Science 2007-05-23 Alberto Artosi , Guido Governatori

Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof theory and, until now, has had no model theory. In this paper a model-theoretic semantics is given for defeasible logic. The logic is sound and…

Logic in Computer Science · Computer Science 2007-05-23 Michael J. Maher

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible…

Artificial Intelligence · Computer Science 2020-08-11 Laura Giordano , Daniele Theseider Dupré

An account of utterance interpretation in discourse needs to face the issue of how the discourse context controls the space of interacting preferences. Assuming a discourse processing architecture that distinguishes the grammar and…

cmp-lg · Computer Science 2008-02-03 Megumi Kameyama

In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…

Logic in Computer Science · Computer Science 2025-12-23 Mario Piazza , Andrea Sabatini

Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized…

Logic in Computer Science · Computer Science 2024-02-14 Martin Abadi , Gordon Plotkin

In this paper we make a contribution to the unification of formal models of defeasible reasoning. We present several translations between formal argumentation frameworks and nonmonotonic logics for reasoning with plausible assumptions. More…

Artificial Intelligence · Computer Science 2016-04-04 Jesse Heyninck , Christian Straßer

This paper considers KLM-style preferential non-monotonic reasoning in the setting of propositional team semantics. We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated…

Artificial Intelligence · Computer Science 2024-05-14 Kai Sauerwald , Juha Kontinen