Results 11 to 20 of about 1,320,893 (348)
UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC [PDF]
The Review of Symbolic Logic, 2014 Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a ...
Fan Yang
semanticscholar +3 more sources
Propositional Dynamic Logic for Message-Passing Systems [PDF]
Logical Methods in Computer Science, 2010 We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event.
Benedikt Bollig +2 more
doaj +6 more sources
Fixed-point Elimination in the Intuitionistic Propositional Calculus [PDF]
Foundations of Software Science and Computation Structure, 2016 It follows from known results in the literature that least and greatest fixed-points of monotone polynomials on Heyting algebras—that is, the algebraic models of the Intuitionistic Propositional Calculus—always exist, even when these algebras are not ...
S. Ghilardi +2 more
semanticscholar +4 more sources
Integrating Conflict Driven Clause Learning to Local Search [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is
Gilles Audenard +3 more
doaj +5 more sources
Subsumption Algorithms for Three-Valued Geometric Resolution [PDF]
Logical Methods in Computer Science, 2018 In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation.
Hans de Nivelle
doaj +3 more sources
Characterizing Propositional Proofs as Noncommutative Formulas [PDF]
SIAM Journal on Computing, 2018 Extended abstract appeared in Proc.
Fu Li, Iddo Tzameret, Zhengyu Wang
openalex +5 more sources
A modal logic amalgam of classical and intuitionistic propositional logic [PDF]
Journal of Logic and Computation, 2013 A famous result, conjectured by Godel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its Godel-translation $\varphi'$ is a theorem of modal logic S4.
Steffen Lewitzka
semanticscholar +3 more sources
Approximation of Relations by Propositional Formulas: Complexity and Semantics [PDF]
, 2002 Selman and Kautz introduced the notion of approximation of a theory and showed its usefulness for knowledge compilation and on-line reasoning. We study here the complexity of the main computational problems related to the approximation of relations (sets of possible worlds) by propositional formulas, and the semantics of reasoning with these ...
Bruno Zanuttini
openalex +5 more sources
Formation sequences for propositional formulas. [PDF]
Notre Dame Journal of Formal Logic, 1973 Martin M. Zuckerman
openalex +4 more sources
On evaluations of propositional formulas in countable structures
Filomat, 2016 Let L be a countable first-order language such that its set of constant symbols Const(L) is countable. We provide a complete infinitary propositional logic (formulas remain finite sequences of symbols, but we use inference rules with countably many premises) for description of C-valued L-structures, where C is an infinite subset of Const(L).
Aleksandar Perović +3 more
openalex +4 more sources