Results 51 to 60 of about 155,122 (304)
Tractable Reasoning in a Fragment of Separation Logic [PDF]
, 2011 In 2004, Berdine, Calcagno and O'Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed that entailment in this fragment is in coNP, but the precise complexity of this problem has been open since.
Cook, B +4 more
openaire +3 more sources
Computations in fragments of intuitionistic propositional logic [PDF]
Journal of Automated Reasoning, 1991 This article is a report on research in progress into the structure of finite diagrams of intuitionistic propositional logic with the aid of automated reasoning systems for larger calculations. A fragment of a propositional logic is the set of formulae built up from a finite number of propositional variables by means of a number of connectives of the ...
Jongh, D. de +2 more
openaire +4 more sources
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj +1 more source
From truth to computability I [PDF]
, 2005 The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.edu/~giorgi/cl.html .
Abramsky +13 more
core +2 more sources
Interpolation in fragments of intuitionistic propositional logic [PDF]
The Journal of Symbolic Logic, 1989 AbstractWe show in this paper that all fragments of intuitionistic propositional logic based on a subset of the connectives ∧, ∨, →, ¬ satisfy interpolation. Fragments containing ↔ or ¬¬ are briefly considered.
openaire +5 more sources
Proof Normalisation in a Logic Identifying Isomorphic Propositions [PDF]
, 2019 We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified.
Dowek, Gilles, Díaz-Caro, Alejandro
core +4 more sources
Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceIn previous work it was shown that the logic ALCME, which extends the description logic (DL) ALC with probabilistic conditionals, has domain-lifted inference.
Franz Baader, Anton Claußnitzer
doaj +1 more source
MK-fuzzy Automata and MSO Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network ...
Manfred Droste +3 more
doaj +1 more source
Incompleteness of a first-order Gödel logic and some temporal logics of programs [PDF]
, 1996 It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant ...
Baaz, Matthias +2 more
core +2 more sources
Quantum Uncertainties and Holism Seem to Render Irrelevant Qudit-Semantics
Entropy, 2021 We consider a semantics based on the peculiar holistic features of the quantum formalism. Any formula of the language gives rise to a quantum circuit that transforms the density operator associated to the formula into the density operator associated to ...
Roberto Leporini
doaj +1 more source