Results 31 to 40 of about 155,122 (304)
Intuitionistic implication makes model checking hard [PDF]
Logical Methods in Computer Science, 2012 We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
On density of truth of the intuitionistic logic in one variable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj +1 more source
The Complexity of Reasoning for Fragments of Autoepistemic Logic [PDF]
ACM Transactions on Computational Logic, 2012 Autoepistemic logic extends propositional logic by the modal operator L . A formula φ that is preceded by an L is said to be “believed.” The logic was introduced by Moore in 1985 for modeling an ideally rational agent’s behavior and reasoning about his own beliefs.
Creignou, Nadia +3 more
openaire +5 more sources
Merging Fragments of Classical Logic [PDF]
, 2017 We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be ...
Carlos Caleiro +2 more
openaire +3 more sources
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source
Decidable fragments of many-sorted logic [PDF]
Journal of Symbolic Computation, 2007 AbstractMany natural specifications use types. We investigate the decidability of fragments of many-sorted first-order logic. We identified some decidable fragments and illustrated their usefulness by formalizing specifications considered in the literature. Often the intended interpretations of specifications are finite.
Mooly Sagiv +2 more
openaire +3 more sources
On two-variable guarded fragment logic with expressive local Presburger constraints [PDF]
Logical Methods in Computer ScienceWe consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at most ...
Chia-Hsuan Lu, Tony Tan
doaj +1 more source
Loop-free verification of termination of derivation for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2008 A fragment of a deterministic propositional dynamic logic (DPDL, in short) is considered The language of considered fragment contains propositional symbols, action constants, action operator (repetition) and logical symbols.
Regimantas Pliuškevičius
doaj +1 more source
A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita +2 more
doaj +1 more source
From formulas to cirquents in computability logic [PDF]
Logical Methods in Computer Science, 2011 Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic ...
Giorgi Japaridze
doaj +1 more source