English
Related papers

Related papers: Redundancy in Logic III: Non-Mononotonic Reasoning

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

In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may be hardwired in the inference mechanism, for example…

Artificial Intelligence · Computer Science 2011-05-30 J. Rintanen

In dialogues in which both agents are autonomous, each agent deliberates whether to accept or reject the contributions of the current speaker. A speaker cannot simply assume that a proposal or an assertion will be accepted. However, an…

cmp-lg · Computer Science 2016-08-31 Marilyn A. Walker

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…

Artificial Intelligence · Computer Science 2013-02-28 Philippe Besnard , Jerome Lang

W.C. Rounds and G.-Q. Zhang (2001) have proposed to study a form of disjunctive logic programming generalized to algebraic domains. This system allows reasoning with information which is hierarchically structured and forms a (suitable)…

Artificial Intelligence · Computer Science 2007-05-23 Pascal Hitzler

Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…

Artificial Intelligence · Computer Science 2013-04-10 Carl Kadie

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Artificial Intelligence · Computer Science 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the…

Programming Languages · Computer Science 2007-05-23 Maria Alpuente , Santiago Escobar , Salvador Lucas

This paper discusses the processes by which conversants in a dialogue can infer whether their assertions and proposals have been accepted or rejected by their conversational partners. It expands on previous work by showing that logical…

cmp-lg · Computer Science 2008-02-03 Marilyn A. Walker

Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models. The interpretability of decision trees motivates explainability approaches by so-called intrinsic interpretability, and it is at the core of…

Artificial Intelligence · Computer Science 2022-10-04 Yacine Izza , Alexey Ignatiev , Joao Marques-Silva

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing…

Artificial Intelligence · Computer Science 2007-05-23 Richard Booth

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…

Artificial Intelligence · Computer Science 2007-05-23 J. Engelfriet

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

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…

Logic · Mathematics 2007-09-20 Denis I. Saveliev

Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…

Logic in Computer Science · Computer Science 2023-10-09 Federico L. G. Faroldi , Meghdad Ghari , Eveline Lehmann , Thomas Studer

We present a theoretical framework that extends classical information theory to finite and structured systems by redefining redundancy as a fundamental property of information organization rather than inefficiency. In this framework,…

Machine Learning · Computer Science 2025-10-14 Yuda Bi , Ying Zhu , Vince D Calhoun