English
Related papers

Related papers: Two Modes of Nonmonotonic Consequence

200 papers

In order to take steps towards establishing a methodology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to anaphoric processing in discourse by comparing the accuracy and…

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

Much research has studied foundations for correct and reliable communication-centric systems. A salient approach to correctness uses session types to enforce structured communications; a recent approach to reliability uses reversible…

Logic in Computer Science · Computer Science 2016-06-21 Claudio A. Mezzina , Jorge A. Pérez

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…

Logic in Computer Science · Computer Science 2024-11-26 Victoria Vollmer , Danielle Marshall , Harley Eades , Dominic Orchard

Recent advances in Bayesian probability theory and its application to cognitive science in combination with the development of a new generation of computational tools and methods for probabilistic computation have led to a 'probabilistic…

Computation and Language · Computer Science 2025-09-29 Christoph Unger , Hendrik Buschmeier

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…

Artificial Intelligence · Computer Science 2016-11-26 Henry E. Kyburg

Detecting semantic arguments of a predicate word has been conventionally modeled as a sentence-level task. The typical reader, however, perfectly interprets predicate-argument relations in a much wider context than just the sentence where…

Computation and Language · Computer Science 2024-08-09 Paul Roit , Aviv Slobodkin , Eran Hirsch , Arie Cattan , Ayal Klein , Valentina Pyatkin , Ido Dagan

We seize the opportunity of the publication of selected papers from the \emph{Logic, categories, semantics} workshop in the \emph{Journal of Applied Logic} to survey some current trends in logic, namely intuitionistic and linear type…

Category Theory · Mathematics 2014-02-07 Jean Gillibert , Christian Retoré

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

Artificial Intelligence · Computer Science 2025-05-08 Luise Ge , Brendan Juba , Kris Nilsson

We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We first introduce a simple logical language which makes it possible to express that a fact causes another…

Artificial Intelligence · Computer Science 2010-05-02 Philippe Besnard , Marie-Odile Cordier , Yves Moinard

The sequential structure of language, and the order of words in a sentence specifically, plays a central role in human language processing. Consequently, in designing computational models of language, the de facto approach is to present…

Computation and Language · Computer Science 2021-08-25 Rishi Bommasani

We study a propositional variant of Hoare logic that can be used for reasoning about programs that exhibit both angelic and demonic nondeterminism. We work in an uninterpreted setting, where the meaning of the atomic actions is specified…

Logic in Computer Science · Computer Science 2019-03-14 Konstantinos Mamouras

A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the…

Logic in Computer Science · Computer Science 2009-07-10 Sonja Georgievska , Suzana Andova

It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…

Logic · Mathematics 2021-07-09 Naosuke Matsuda , Kento Takagi

We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic automata with nondeterminism. For both choices, we show that…

Formal Languages and Automata Theory · Computer Science 2018-05-30 Gerco van Heerdt , Justin Hsu , Joël Ouaknine , Alexandra Silva

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

In this paper, we introduce Linear Logic with a nondeterministic facility, which has a self-dual additive connective. In the system the proof net technology is available in a natural way. The important point is that nondeterminism in the…

Logic in Computer Science · Computer Science 2009-09-29 Satoshi Matsuoka

E-RES is a system that implements the Language E, a logic for reasoning about narratives of action occurrences and observations. E's semantics is model-theoretic, but this implementation is based on a sound and complete reformulation of E…

Artificial Intelligence · Computer Science 2007-05-23 Antonis Kakas , Rob Miller , Francesca Toni