Results 31 to 40 of about 47,472 (286)
On Propositional Encoding of Distinction Property in Finite Sets
Известия Иркутского государственного университета: Серия "Математика", 2019 In the paper we describe a new propositional encoding procedure for the property that all objects comprising some finite set are distinct. For the considered class of combinatorial problems it is sufficient to represent the elements of such set by their ...
E. G. Beley, A. A. Semenov
doaj +1 more source
The validity degree vectors of formulae in two-valued predicate logic [PDF]
International Journal of Computational Intelligence Systems, 2015 By means of infinite product of uniformly distributed probability spaces of cardinal , the concept of -validity degrees and validity degree vectors of formulae in two-valued predicate logic are introduced. It is proved that the validity degree vectors of
Xiaoyan Qin, Yang Xu, Yi Liu
doaj +1 more source
Simplifying Inductive Schemes in Temporal Logic [PDF]
, 2019 In propositional temporal logic, the combination of the connectives "tomorrow" and "always in the future" require the use of induction tools. In this paper, we present a classification of inductive schemes for propositional linear temporal logic that ...
Cordero, Pablo, Fortes, Inmaculada
core +1 more source
Solving QBF by Abstraction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Many verification and synthesis approaches rely on solving techniques for quantified Boolean formulas (QBF). Consequently, solution witnesses, in the form of Boolean functions, become more and more important as they represent implementations or ...
Jesko Hecking-Harbusch, Leander Tentrup
doaj +1 more source
Boolean basis, formula size, and number of modal operators [PDF]
Logical Methods in Computer ScienceIs it possible to write significantly smaller formulae when using Boolean operators other than those of the De Morgan basis (and, or, not, and the constants)?
Christoph Berkholz +2 more
doaj +1 more source
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
Uniform Definability in Propositional Dependence Logic
, 2016 Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of ...
Yang, Fan
core +1 more source
On QBF Proofs and Preprocessing [PDF]
, 2013 QBFs (quantified boolean formulas), which are a superset of propositional formulas, provide a canonical representation for PSPACE problems. To overcome the inherent complexity of QBF, significant effort has been invested in developing QBF solvers as well
A. Biere +25 more
core +1 more source
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems [PDF]
Logical Methods in Computer Science, 2013 The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound $B$, a PDL formula $\varphi$ and a CFM $\mathcal{C}$, whether every ...
Roy Mennicke
doaj +1 more source
Stable Models of Fuzzy Propositional Formulas [PDF]
, 2014 We introduce the stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of Boolean propositional formulas. Combining the advantages of both formalisms, the introduced language allows highly configurable default reasoning involving fuzzy truth values.
Joohyung Lee, Yi Wang
openaire +1 more source