English
Related papers

Related papers: Pragmatic Nonsense

200 papers

The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…

Logic in Computer Science · Computer Science 2024-05-30 Michael J. Maher

Convincing someone of the truth value of a premise requires understanding and articulating the core logical structure of the argument which proves or disproves the premise. Understanding the logical structure of an argument refers to…

Computation and Language · Computer Science 2025-08-21 Krunal Shah , Dan Roth

Why is ordinary language vague? We argue that in contexts in which a cooperative speaker is not perfectly informed about the world, the use of vague expressions can offer an optimal tradeoff between truthfulness (Gricean Quality) and…

Computation and Language · Computer Science 2022-09-02 Paul Egré , Benjamin Spector , Adèle Mortier , Steven Verheyen

In the 1950-ies P. F. Strawson proposed the Logic of Presuppositions. In this system sentences with empty subject are considered neither true nor false. Strawson considered only simple sentences with two predicate letters. But the concept…

Logic in Computer Science · Computer Science 2020-01-29 X. Y. Newberry

In Knowledge Representation, it is crucial that knowledge engineers have a good understanding of the formal expressions that they write. What formal expressions state intuitively about the domain of discourse is studied in the theory of the…

Artificial Intelligence · Computer Science 2019-01-29 Marc Denecker , Yuliya Lierler , Miroslaw truszczynski , Joost Vennekens

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

Interpretability is the study of explaining models in understandable terms to humans. At present, interpretability is divided into two paradigms: the intrinsic paradigm, which believes that only models designed to be explained can be…

Machine Learning · Computer Science 2024-11-14 Andreas Madsen , Himabindu Lakkaraju , Siva Reddy , Sarath Chandar

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of `maximal formula', `segment' and `maximal segment' suitable to the system, and gives…

Logic in Computer Science · Computer Science 2023-04-25 Nils Kürbis

Some attack scientific rationality, others defend it, but both miss the point. What both parties take to be scientific rationality is actually a species of irrationality masquerading as scientific rationality. The current orthodox…

History and Philosophy of Physics · Physics 2020-01-29 Nicholas Maxwell

In many real-world situations, there is often not enough information to know that a certain strategy will succeed in achieving the goal, but there is a good reason to believe that it will. The paper introduces the term ``doxastic'' for such…

Artificial Intelligence · Computer Science 2023-12-14 Junli Jiang , Pavel Naumov

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

Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…

Artificial Intelligence · Computer Science 2026-02-10 Quentin Cohen-Solal , Alexandre Niveau , Maroua Bouzid

This paper introduces conceptual relations that synthesize utilitarian and logical concepts, extending the logics of preference of Rescher. We define first, in the context of a possible worlds model, constraint-dependent measures that…

Artificial Intelligence · Computer Science 2013-03-26 Enrique H. Ruspini

We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to…

Logic · Mathematics 2025-01-22 Antonio Piccolomini d'Aragona

We propose new definitions of (causal) explanation, using structural equations to model counterfactuals. The definition is based on the notion of actual cause, as defined and motivated in a companion paper. Essentially, an explanation is a…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Judea Pearl

Neyman and Pearson's theory of testing hypotheses does not warrant minimal epistemic reliability: the feature of driving to true conclusions more often than to false ones. The theory does not protect from the possible negative effects of…

Statistics Theory · Mathematics 2021-07-07 Adam P. Kubiak , Pawel Kawalec , Adam Kiersztyn

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

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

Logic · Mathematics 2013-12-17 Jesse Alama

This paper introduces pragmatic hypotheses and relates this concept to the spiral of scientific evolution. Previous works determined a characterization of logically consistent statistical hypothesis tests and showed that the modal operators…

Other Statistics · Statistics 2019-10-02 Luis G. Esteves , Rafael Izbicki , Rafael B. Stern , Julio M. Stern

This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…

Logic in Computer Science · Computer Science 2026-02-05 Paul Gorbow
‹ Prev 1 3 4 5 6 7 10 Next ›