Results 11 to 20 of about 64,991 (246)
A Logic for True Concurrency [PDF]
, 2014 We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which
Baldan, Paolo, Crafa, Silvia
core +1 more source
A Potpourri of Reason Maintenance Methods [PDF]
, 2011 We present novel methods to compute changes to materialized views in logic databases like those used by rule-based reasoners. Such reasoners have to address the problem of changing axioms in the presence of materializations of derived atoms.
Bry, François +2 more
core +1 more source
The Epsilon Calculus and Herbrand Complexity [PDF]
, 2005 Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which ...
A. Blass +20 more
core +2 more sources
Logical Reasoning for Higher-Order Functions with Local State [PDF]
Logical Methods in Computer Science, 2008 We introduce an extension of Hoare logic for call-by-value higher-order functions with ML-like local reference generation. Local references may be generated dynamically and exported outside their scope, may store higher-order functions and may be used to
Nobuko Yoshida +2 more
doaj +1 more source
Cycle Detection in Computation Tree Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these kind of problems,
Gaëlle Fontaine +4 more
doaj +1 more source
A Type-Directed Negation Elimination [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In the modal mu-calculus, a formula is well-formed if each recursive variable occurs underneath an even number of negations. By means of De Morgan's laws, it is easy to transform any well-formed formula into an equivalent formula without negations ...
Etienne Lozes
doaj +1 more source
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
, 2017 The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely-held ideas: that knowledge is factive, that we can know that knowledge is
Jerzak, Ethan
core +1 more source
Order-Invariant MSO is Stronger than Counting MSO in the Finite [PDF]
, 2008 We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers, allowing the ...
Ganzow, Tobias, Rubin, Sasha
core +4 more sources
Automated verification of shape, size and bag properties. [PDF]
, 2007 In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates.
Alaoui-Ismaïli O. +7 more
core +3 more sources