Results 31 to 40 of about 1,320,893 (348)
Symmetries in Modal Logics [PDF]
Electronic 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
Axioms, 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]
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
Axioms, 2023 Residuated basic logic (RBL) is the logic of residuated basic algebras, which constitutes a conservative extension of basic propositional logic (BPL). The basic implication is a residual of a non-associative binary operator in RBL.
Zhe Lin, Minghui Ma
doaj +1 more source
On the Expressiveness of TPTL and MTL over ω-Data Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages.
Claudia Carapelle +3 more
doaj +1 more source
A Formal Model for Configurable Business Process with Optimal Cloud Resource Allocation [PDF]
Journal of Universal Computer Science, 2021 In today’s competitive business environments, organizations increasingly need to model and deploy flexible and cost effective business processes. In this context, configurable process models are used to offer flexibility by representing process
Abderrahim Ait Wakrime +4 more
doaj +3 more sources
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
Resolution Lower Bounds for Refutation Statements [PDF]
, 2019 For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolution refutations of a propositional statement that the formula has a resolution refutation. We describe three applications.
Garlík, Michal
core +2 more sources
Interval-based Synthesis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce the synthesis problem for Halpern and Shoham's modal logic of intervals extended with an equivalence relation over time points, abbreviated HSeq.
Angelo Montanari, Pietro Sala
doaj +1 more source
Characterizing Propositional Proofs as Non-Commutative Formulas
Electron. Colloquium Comput. Complex., 2014 Li Fu, Iddo Tzameret, Zhengyu Wang
openalex +3 more sources