English
Related papers

Related papers: A logic for reasoning with inconsistent knowledge …

200 papers

Classical higher-order logic, when utilized as a meta-logic in which various other (classical and non-classical) logics can be shallowly embedded, is well suited for realising a universal logic reasoning approach. Universal logic reasoning…

Artificial Intelligence · Computer Science 2017-03-29 Christoph Benzmüller

Human reasoning can often be understood as an interplay between two systems: the intuitive and associative ("System 1") and the deliberative and logical ("System 2"). Neural sequence models -- which have been increasingly successful at…

Artificial Intelligence · Computer Science 2021-12-16 Maxwell Nye , Michael Henry Tessler , Joshua B. Tenenbaum , Brenden M. Lake

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

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

In systems modelling, a 'system' typically comprises located resources relative to which processes execute. One important use of logic in informatics is in modelling such systems for the purpose of reasoning (perhaps automated) about their…

Logic in Computer Science · Computer Science 2024-12-18 Alexander V. Gheorghiu , Tao Gu , David J. Pym

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…

Logic · Mathematics 2025-10-14 Oscar Ramírez

We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…

Logic · Mathematics 2026-05-29 Søren Brinck Knudstorp

Posibilistic logic is the most extended approach to handle uncertain and partially inconsistent information. Regarding normal forms, advances in possibilistic reasoning are mostly focused on clausal form. Yet, the encoding of real-world…

Artificial Intelligence · Computer Science 2021-11-16 Gonzalo E. Imaz

Natural language reasoning plays an increasingly important role in improving language models' ability to solve complex language understanding tasks. An interesting use case for reasoning is the resolution of context-dependent ambiguity. But…

Computation and Language · Computer Science 2023-10-24 Stefan F. Schouten , Peter Bloem , Ilia Markov , Piek Vossen

Large language models are increasingly integrated into decision-making in areas such as healthcare, law, finance, engineering, and government. Yet they share a critical limitation: they produce fluent outputs even when their internal…

Artificial Intelligence · Computer Science 2026-04-17 Rikard Rosenbacke , Carl Rosenbacke , Victor Rosenbacke , Martin McKee

Recent years have seen a boom in interest in machine learning systems that can provide a human-understandable rationale for their predictions or decisions. However, exactly what kinds of explanation are truly human-interpretable remains…

Artificial Intelligence · Computer Science 2018-02-05 Menaka Narayanan , Emily Chen , Jeffrey He , Been Kim , Sam Gershman , Finale Doshi-Velez

We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form "If $\sim A$, then $A$", should not hold,…

Logic · Mathematics 2021-09-13 Niki Pfeifer , Giuseppe Sanfilippo

One main goal of argumentation theory is to evaluate arguments and to determine whether they should be accepted or rejected. When there is no clear answer, a third option, being undecided, has to be taken into account. Indecision is often…

Artificial Intelligence · Computer Science 2022-03-07 Daniela Schuster

Defeasible reasoning is a kind of reasoning where some generalisations may not be valid in all circumstances, that is general conclusions may fail in some cases. Various formalisms have been developed to model this kind of reasoning, which…

Artificial Intelligence · Computer Science 2024-03-06 Gabriele Sacco , Loris Bozzato , Oliver Kutz

Probability theory, epistemically interpreted, provides an excellent, if not the best available account of inductive reasoning. This is so because there are general and definite rules for the change of subjective probabilities through…

Artificial Intelligence · Computer Science 2013-04-10 Wolfgang Spohn

Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…

Artificial Intelligence · Computer Science 2013-03-08 John Fox , Paul J. Krause , Morten Elvang-Gøransson

We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with…

Artificial Intelligence · Computer Science 2017-03-27 Mathieu Beirlaen , Jesse Heyninck , Christian Straßer

Judgmental forecasting employs human opinions to make predictions about future events, rather than exclusively historical data as in quantitative forecasting. When these opinions form an argumentative structure around forecasts, it is…

Artificial Intelligence · Computer Science 2025-08-26 Deniz Gorur , Antonio Rago , Francesca Toni

We apply a paraconsistent logic to reason about fractions.

Logic in Computer Science · Computer Science 2015-03-09 Jan A. Bergstra , Inge Bethke

Negation is both an operation in formal logic and in natural language by which a proposition is replaced by one stating the opposite, as by the addition of "not" or another negation cue. Treating negation in an adequate way is required for…

Computation and Language · Computer Science 2021-10-14 Claudia Schon , Sophie Siebert , Frieder Stolzenburg