English
Related papers

Related papers: Proof Search on Bilateralist Judgments over Non-de…

200 papers

We consider multi-agent argumentation, where each agent's view of the arguments is encoded as an argumentation framework (AF). Then we study deliberative processes than can occur on this basis. We think of a deliberative process as taking…

Logic in Computer Science · Computer Science 2014-08-08 Truls Pedersen , Sjur Dyrkolbotn

This article is an exploratory account of the the non-monotonic behaviour of conceptual associations in the light of context. Computational approximations of conceptual space are furnished by semantic space models which are emerging from…

Quantum Physics · Physics 2007-05-23 P. D. Bruza , R. J. Cole

I generalize acyclic deterministic structural causal models to the nondeterministic case and argue that this offers an improved semantics for counterfactuals. The standard, deterministic, semantics developed by Halpern (and based on the…

Artificial Intelligence · Computer Science 2025-03-12 Sander Beckers

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…

Logic in Computer Science · Computer Science 2021-05-18 Pedro Amorim , Dexter Kozen , Radu Mardare , Prakash Panangaden , Michael Roberts

We present a probabilistic model that simultaneously learns alignments and distributed representations for bilingual data. By marginalizing over word alignments the model captures a larger semantic context than prior work relying on hard…

Computation and Language · Computer Science 2014-05-06 Tomáš Kočiský , Karl Moritz Hermann , Phil Blunsom

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…

Logic in Computer Science · Computer Science 2011-03-08 Zoran Majkic

The roles played by decision factors in making complex subject are decisions are characterized by how these factors affect the overall decision. Evidence that partially matches a factor is evaluated, and then effective computational rules…

Artificial Intelligence · Computer Science 2013-04-15 Gerald Shao-Hung Liu

In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…

Logic in Computer Science · Computer Science 2011-11-09 Frederic Dambreville

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 propose to study proof search from a coinductive point of view. In this paper, we consider intuitionistic logic and a focused system based on Herbelin's LJT for the implicational fragment. We introduce a variant of lambda calculus with…

Logic in Computer Science · Computer Science 2013-09-05 José Espírito Santo , Ralph Matthes , Luís Pinto

We develop a proof-theoretic semantics (P-tS) for second-order logic (S-oL), providing an inferentialist alternative to both full and Henkin model-theoretic interpretations. Our approach is grounded in base-extension semantics (B-eS), a…

Logic · Mathematics 2025-08-12 Alexander V. Gheorghiu , David J. Pym

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a…

Logic in Computer Science · Computer Science 2023-06-22 Alexander Bentkamp , Jasmin Blanchette , Simon Cruanes , Uwe Waldmann

We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules,…

Logic in Computer Science · Computer Science 2014-07-15 Mnacho Echenim , Nicolas Peltier

Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

Reasoning about the causes behind observations is crucial to the formalization of rationality. While extensive research has been conducted on root cause analysis, most studies have predominantly focused on deterministic settings. In this…

Artificial Intelligence · Computer Science 2024-12-24 Shakil M. Khan , Yves Lespérance , Maryam Rostamigiv

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

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

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Artificial Intelligence · Computer Science 2013-04-11 Norman C. Dalkey