Results 41 to 50 of about 1,320,893 (348)
Decidability and Undecidability Results for Propositional Schemata [PDF]
Journal of Artificial Intelligence Research, 2014 We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧i-1n pi, where n is a ...
Vincent Aravantinos +2 more
semanticscholar +1 more source
Does Advice Help to Prove Propositional Tautologies? [PDF]
, 2009 One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as their range. Motivated
J. Balcázar +6 more
core +1 more source
The curse genre of ’Kargys’ in the Kazakh language: Is the belief in the magical power of the word still preserved? [PDF]
Жанры речи, 2023 The speech genre of curse analyzed in the article belongs to the most ancient genres of oral communication in Kazakh culture. It is based on belief in the magical function of the word, in the ability to bring harm and evil to the cursed with the help of ...
Temirgazina, Zifa Kakbaevna +2 more
doaj +1 more source
Algorithms for testing the satisfiability of propositional formulae
The Journal of Logic Programming, 1989 It is experimentally shown that the satisfiability for Horn clauses algorithm (Dowling, Gallier) is efficient. The authors propose two relaxation schemes which map instances of a satisfiability problem for propositional formulae into problem instances for Horn clauses.
Giampaolo Urbani, Giorgio Gallo
openaire +2 more sources
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
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
Evaluating state-of-the-art # SAT solvers on industrial configuration spaces
Empirical Software Engineering, 2023 Product lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration) of features is valid.
Chico Sundermann +6 more
semanticscholar +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
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