English
Related papers

Related papers: Prime Implicates and Prime Implicants: From Propos…

200 papers

We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…

Logic · Mathematics 2023-06-21 Grigory Olkhovikov

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of concept combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC TR, whose semantics is based on the…

Artificial Intelligence · Computer Science 2019-08-13 Antonio Lieto , Gian Luca Pozzato

We establish various complexity results for the entailment problem between formulas in Separation Logic with user-defined predicates denoting recursive data structures. The considered fragments are characterized by syntactic conditions on…

Logic in Computer Science · Computer Science 2025-07-23 Mnacho Echenim , Nicolas Peltier

Distributed representations (such as those based on embeddings) and discrete representations (such as those based on logic) have complementary strengths. We explore one possible approach to combining these two kinds of representations. We…

Artificial Intelligence · Computer Science 2015-02-06 Ramanathan Guha

Interpolation is an important property of classical and many non-classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the the non-monotonic system of…

Logic in Computer Science · Computer Science 2014-01-17 Dov Gabbay , David Pearce , Agustín Valverde

We consider team semantics for propositional logic, continuing our previous work (Yang & V\"a\"an\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an…

Logic · Mathematics 2018-12-19 Fan Yang , Jouko Väänänen

This paper argues for a modal view of probability. The syntax and semantics of one particularly strong probability logic are discussed and some examples of the use of the logic are provided. We show that it is both natural and useful to…

Artificial Intelligence · Computer Science 2013-04-10 Alan M. Frisch , Peter Haddawy

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

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We prove that all these logics are expressively complete, and we introduce sound and complete systems of…

Logic · Mathematics 2022-02-16 Fan Yang

In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…

Logic in Computer Science · Computer Science 2013-04-02 Matthew S. Bauer

Compositionality is believed to be fundamental to intelligence. In humans, it underlies the structure of thought, language, and higher-level reasoning. In AI, compositional representations can enable a powerful form of out-of-distribution…

Computation and Language · Computer Science 2025-06-04 Eric Elmoznino , Thomas Jiralerspong , Yoshua Bengio , Guillaume Lajoie

In this paper we intend to study implications in their most general form, generalizing different classes of implications including the Heyting implication, sub-structural implications and weak strict implications. Following the topological…

Logic · Mathematics 2020-04-23 Amirhossein Akbar Tabatabai

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Logic in Computer Science · Computer Science 2025-04-07 Silvio Ghilardi , Jérémie Marquès

The paper introduces a basic logic of knowledge and abduction by extending Levesque logic of only-knowing with an abduction modal operator defined via the combination of basic epistemic concepts. The upshot is an alternative approach to…

Artificial Intelligence · Computer Science 2026-01-09 Sanderson Molick , Vaishak Belle

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications.…

Logic in Computer Science · Computer Science 2024-04-15 Alexander Gheorghiu , Simon Docherty , David Pym

Some interpersonal verbs can implicitly attribute causality to either their subject or their object and are therefore said to carry an implicit causality (IC) bias. Through this bias, causal links can be inferred from a narrative, aiding…

Computation and Language · Computer Science 2021-06-03 Yova Kementchedjhieva , Mark Anderson , Anders Søgaard

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

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