Results 21 to 30 of about 1,475 (68)
Random Boolean expressions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees.
Danièle Gardy
doaj +1 more source
Note on paraconsistency and reasoning about fractions [PDF]
, 2014 We apply a paraconsistent logic to reason about fractions.Comment: 6 ...
Bergstra, Jan A., Bethke, Inge
core +2 more sources
Normalisation Control in Deep Inference via Atomic Flows [PDF]
, 2008 We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to
Alessio Guglielmi +2 more
core +7 more sources
An independent axiomatisation for free short-circuit logic [PDF]
, 2017 Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression.
Ponse, Alban, Staudt, Daan J. C.
core +3 more sources
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
, 2017 We introduce a language, PSL, designed to capture high level proof strategies in Isabelle/HOL. Given a strategy and a proof obligation, PSL's runtime system generates and combines various tactics to explore a large search space with low memory usage ...
A Bundy +10 more
core +1 more source
Preservation and decomposition theorems for bounded degree structures [PDF]
, 2015 We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad ...
Harwath, Frederik +2 more
core +2 more sources
Complexity Results for Modal Dependence Logic [PDF]
, 2010 Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is determined by those of ...
F.M. Donini +8 more
core +3 more sources
Poly-infix operators and operator families [PDF]
, 2015 Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention.
Bergstra, Jan A., Ponse, Alban
core +1 more source
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant [PDF]
, 2018 Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression.
Bergstra, Jan A. +2 more
core +1 more source
On shuffle products, acyclic automata and piecewise-testable languages
, 2019 We show that the shuffle $L \unicode{x29E2} F$ of a piecewise-testable language $L$ and a finite language $F$ is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable languages.
Halfon, Simon, Schnoebelen, Philippe
core +1 more source