Results 11 to 20 of about 1,681 (204)
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, 2005 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Martin Grohe, Nicole Schweikardt
doaj +2 more sources
Quantifying Over Trees in Monadic Second-Order Logic [PDF]
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2023 Monadic Second-Order Logic (MSO) extends First-Order Logic (FO) with variables ranging over sets and quantifications over those variables. We introduce and study Monadic Tree Logic (MTL), a fragment of MSO interpreted on infinite-tree models, where the sets over which the variables range are arbitrary subtrees of the original model.
Benerecetti, Massimo +3 more
openaire +5 more sources
Monadic Second-Order Logic with Arbitrary Monadic Predicates [PDF]
ACM Transactions on Computational Logic, 2014 We study Monadic Second-Order Logic ( MSO ) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic, and machine-independent characterizations.
Fijalkow, Nathanaël, Paperman, Charles
openaire +4 more sources
Probabilistic Inference and Monadic Second Order Logic [PDF]
, 2012 This paper combines two classic results from two different fields: the result by Lauritzen and Spiegelhalter [21] that the probabilistic inference problem on probabilistic networks can be solved in linear time on networks with a moralization of bounded treewidth, and the result by Courcelle [10] that problems that can be formulated in counting monadic ...
Bodlaender, Hans, +4 more
core +5 more sources
Hardware verification using monadic second-order logic [PDF]
BRICS Report Series, 1995 <p>We show how the second-order monadic theory of strings can be used to specify hardware components and their behavior. This logic admits a decision procedure and counter-model generator based<br />on canonical automata for formulas. We have used a system implementing these concepts to verify, or find errors in, a number of circuits ...
Basin, D., Klarlund, N.
openaire +4 more sources
MONA: Monadic Second-Order Logic in Practice [PDF]
BRICS Report Series, 1995 The purpose of this article is to introduce Monadic Second-order<br />Logic as a practical means of specifying regularity. The logic is a<br />highly succinct alternative to the use of regular expressions. We have built a tool MONA, which acts as a decision procedure and as a translator to finite-state automata.
Jesper G. Henriksen +6 more
openaire +3 more sources
Abstract Argumentation via Monadic Second Order Logic [PDF]
, 2012 We propose the formalism of Monadic Second Order Logic (MSO) as a unifying framework for representing and reasoning with various semantics of abstract argumentation. We express a wide range of semantics within the proposed framework, including the standard semantics due to Dung, semi-stable, stage, cf2, and resolution-based semantics.
Wolfgang Dvorák +2 more
openaire +2 more sources
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruno Courcelle
exaly +3 more sources
Monadic second-order logic on tree-like structures
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walukiewicz, Igor
openaire +3 more sources
Incremental reasoning on monadic second-order logics with logic programming
Journal of Logical and Algebraic Methods in Programming, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ünel, Gülay
openaire +2 more sources