English
Related papers

Related papers: A Study on Actions for Atomic Logics

200 papers

The aim of these notes is to provide a succinct, accessible introduction to some of the basic ideas of category theory and categorical logic. The notes are based on a lecture course given at Oxford over the past few years. They contain…

Category Theory · Mathematics 2015-05-27 Samson Abramsky , Nikos Tzevelekos

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

Logic in Computer Science · Computer Science 2019-05-15 Marcelo Finger

We present a procedure which allows us to recover classical and nonclassical logical structures as \emph{concrete logics} associated with physical theories expressed by means of classical languages. This procedure consists in choosing, for…

Quantum Physics · Physics 2014-11-13 Claudio Garola , Sandro Sozzo

We introduce propositional team-based logics expressively complete for (quasi) downward and (quasi) upward closed properties in a syntactically dual way, by using variants of the inclusion atom. In particular, the variants of the primitive…

Logic · Mathematics 2026-03-06 Matilda Häggblom

Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain's embedding of definite propositional causal theories into logic programming paved the…

Artificial Intelligence · Computer Science 2011-06-03 Paolo Ferraris , Joohyung Lee , Yuliya Lierler , Vladimir Lifschitz , Fangkai Yang

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e.,…

Artificial Intelligence · Computer Science 2014-07-16 Richard Booth , Dov Gabbay , Souhila Kaci , Tjitze Rienstra , Leendert van der Torre

Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential…

Logic in Computer Science · Computer Science 2023-06-22 Martin Lück , Miikka Vilander

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic…

Artificial Intelligence · Computer Science 2019-04-29 Honghua Dong , Jiayuan Mao , Tian Lin , Chong Wang , Lihong Li , Denny Zhou

Matching logic (ML) was developed by Grigore Ro\c{s}u and collaborators as a logic for defining the formal semantics of programming languages and for specifying and reasoning about the behavior of programs. These lecture notes present basic…

Logic in Computer Science · Computer Science 2025-06-19 Laurenţiu Leuştean

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2009-09-30 Alwen Tiu , Alberto Momigliano

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…

Logic in Computer Science · Computer Science 2024-12-03 Andrzej Indrzejczak , Yaroslav Petrukhin

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

The group structure on the rational points of elliptic curves plays several important roles, in mathematics and recently also in other areas such as cryptography. However, the famous proofs for the group property (in particular, for its…

Algebraic Geometry · Mathematics 2021-05-25 Koji Nuida

The logic of definitions is a family of logics for encoding and reasoning about judgments, which are atomic predicates specified by inference rules. A definition associates an atomic predicate with a logical formula, which may itself depend…

Logic in Computer Science · Computer Science 2026-02-04 Nathan Guermond

Logical reasoning is central to human cognition and intelligence. It includes deductive, inductive, and abductive reasoning. Past research of logical reasoning within AI uses formal language as knowledge representation and symbolic…

Computation and Language · Computer Science 2024-02-19 Zonglin Yang , Xinya Du , Rui Mao , Jinjie Ni , Erik Cambria

In this paper we propose a logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications. Computation in the framework is viewed as the task of generating a sequence of state…

Logic in Computer Science · Computer Science 2014-04-25 Robert Kowalski , Fariba Sadri

We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…

Logic · Mathematics 2016-09-06 Alessandra Carbone
‹ Prev 1 8 9 10 Next ›