Results 11 to 20 of about 47,472 (286)

Propositional Dynamic Logic for Message-Passing Systems [PDF]

open access: yesLogical 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

MODEL-THEORETIC CHARACTERIZATION OF INTUITIONISTIC PROPOSITIONAL FORMULAS [PDF]

open access: yesThe 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
Olkhovikov, Grigory K.
openaire   +7 more sources

Integrating Conflict Driven Clause Learning to Local Search [PDF]

open access: yesElectronic 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]

open access: yesLogical 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

Isomorphic formulae in classical propositional logic [PDF]

open access: yesMathematical Logic Quarterly, 2011
AbstractIsomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions.
Došen, Kosta, Petrić, Zoran
openaire   +3 more sources

Logical derivation search with assumption traceability

open access: yesLietuvos Matematikos Rinkinys, 2021
In this paper authors research the problem of traceability of assumptions in logical derivation. The essence of this task is to trace which assumptions from the available knowledge base of assumptions are necessary to derive a certain conclusion.
Adomas Birštunas, Elena Reivytytė
doaj   +1 more source

Polynomial Algorithm of Verication for Subset of PLTL Logic

open access: yesМоделирование и анализ информационных систем, 2015
In this article a polynomial algorithm is described of verification of dynamic properties of Markov chains described by formulas of a subset of temporal logic PLTL (propositional temporal logic of linear time). The algorithm allows to find probability of
P. V. Lebedev
doaj   +3 more sources

Symmetries in Modal Logics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example, hybrid logics ...
Carlos Areces   +2 more
doaj   +1 more source

Deduction in Non-Fregean Propositional Logic SCI

open access: yesAxioms, 2019
We study deduction systems for the weakest, extensional and two-valued non-Fregean propositional logic SCI . The language of SCI is obtained by expanding the language of classical propositional logic with a new binary connective ≡ that ...
Joanna Golińska-Pilarek   +1 more
doaj   +1 more source

Density of truth in modal logics [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy