Results 21 to 30 of about 59,882 (275)
Density of truth in modal logics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is counting the probability that a random modal formula is a tautology. We examine $\{ \to,\Box \}$ fragment of two modal logics $\mathbf{S5}$ and $\mathbf{S4}$ over the language with one propositional variable.
Zofia Kostrzycka
doaj +1 more source
Bulletin of the Section of Logic, 2021 We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to
Damian E. Szmuc
doaj +1 more source
A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form
Entropy, 2021 The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot.
Zaijun Zhang, Daoyun Xu, Jincheng Zhou
doaj +1 more source
IEEE Access, 2021 The Partial Max-SAT (PMSAT) problem is an optimization variant of the well-known Propositional Boolean Satisfiability (SAT) problem. It holds an important place in theory and practice, because a huge number of real-world problems, such as timetabling ...
Haifa Hamad Alkasem +1 more
doaj +1 more source
Entropy, 2022 The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability with a wide range of real-world applications. In this paper, we propose an initialization and a
Zaijun Zhang +4 more
doaj +1 more source
Becoming Aware of Propositional Variables [PDF]
, 2011 We examine a logic that combines knowledge, awareness, and change of awareness. Change of awareness involves that an agent becomes aware of propositional variables. We show that the logic is decidable, and we present a complete axiomatization.
Hans van Ditmarsch, Tim French
openaire +1 more source
, 2013 Let \Omega be a set of unsatisfiable clauses, an implicit resolution refutation of \Omega is a circuit \beta with a resolution proof {\alpha} of the statement "\beta describes a correct tree-like resolution refutation of \Omega". We show that such system
Wang, Zi Chao
core +2 more sources
Proposition-valued random variables as information [PDF]
Synthese, 2010 The notion of a proposition as a set of possible worlds or states occupies central stage in probability theory, semantics and epistemology, where it serves as the fundamental unit both of information and meaning. But this fact should not blind us to the existence of prospects with a different structure.
openaire +1 more source
Model-theoretic characterization of intuitionistic propositional formulas [PDF]
, 2012 Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional ...
Olkhovikov, Grigory K.
core +3 more sources
The deduction theorem for strong propositional proof systems [PDF]
, 2007 This paper focuses on the deduction theorem for propositional logic. We define and investigate different deduction properties and show that the presence of these deduction properties for strong proof systems is powerful enough to characterize the ...
C. Glaßer +15 more
core +6 more sources