Results 41 to 50 of about 1,803,872 (361)
A PSPACE-complete first-order fragment of computability logic [PDF]
ACM Transactions on Computational Logic, 2012 In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized.
Matthew S. Bauer
semanticscholar +1 more source
Decision procedure for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Aida Pliuškevičienė
doaj +3 more sources
The Logic of Propagation Strategies: Axiomatizing a Fragment of Organizational Ecology in First-Order Logic [PDF]
, 1997 Gábor Péli, Michael Masuch
openalex +2 more sources
Descriptive complexity of real computation and probabilistic independence logic [PDF]
Logic in Computer Science, 2020 We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in nondeterministic polynomial time by S-BSS machines. We show that NP on S-BSS
Miika Hannula +3 more
semanticscholar +1 more source
MALL proof equivalence is Logspace-complete, via binary decision diagrams [PDF]
, 2015 Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets:
Bagnol, Marc
core +3 more sources
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
The Complexity of Reasoning for Fragments of Default Logic [PDF]
Journal of Logic and Computation, 2009 Corrected ...
Michael Thomas +3 more
openaire +6 more sources
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
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
Using Program Synthesis for Program Analysis [PDF]
, 2015 In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g.
David, Cristina +2 more
core +3 more sources