Results 1 to 10 of about 1,320,893 (348)
Propositional Logics Complexity and the Sub-Formula Property [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete.
Edward Hermann Haeusler
doaj +9 more sources
MODEL-THEORETIC CHARACTERIZATION OF INTUITIONISTIC PROPOSITIONAL FORMULAS [PDF]
The Review of Symbolic Logic, 2013 AbstractNotions 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 formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order
Grigory K. Olkhovikov
semanticscholar +12 more sources
A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form [PDF]
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 +3 more sources
Propositional Independence - Formula-Variable Independence and Forgetting [PDF]
Journal of Artificial Intelligence Research, 2003 Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic one. We show features and drawbacks of them.
J. Lang +2 more
semanticscholar +9 more sources
Classical propositional logic and decidability of variables in intuitionistic propositional logic [PDF]
Logical Methods in Computer Science, 2014 We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.
Hajime Ishihara
doaj +6 more sources
Gelfond–Zhang aggregates as propositional formulas [PDF]
Artificial Intelligence, 2017 Answer Set Programming (ASP) has become a popular and widespread paradigm for practical Knowledge Representation thanks to its expressiveness and the available enhancements of its input language. One of such enhancements is the use of aggregates, for which different semantic proposals have been made.
Pedro Cabalar +3 more
openaire +8 more sources
Algorithms for computing backbones of propositional formulae [PDF]
AI Communications, 2015 The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula's satisfiability alone is insufficient. Often, some other properties of the formula need to be computed.
Inês Lynce +2 more
openaire +3 more sources
A hierarchy of propositional Horn formulas
Theoretical Computer Science, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bogdan S. Chlebus
openalex +3 more sources
Some consequence relations on propositional formulas
Serbian Journal of Electrical Engineering, 2011 Consequence relations on propositional formulas are binary relations on propositional formulas that represent certain types of entailment - formal or semi-formal derivation of conclusion from a certain set of premises. Some of well known examples are classical implication (standard logical entailment), preference relations (i.e.
Momčilo Borovčanin
+8 more sources
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT [PDF]
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 +2 more sources