Results 31 to 40 of about 1,681 (204)
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
Guarded Second-Order Logic, Spanning Trees, and Network Flows [PDF]
Logical Methods in Computer Science, 2010 According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the first part of the
Achim Blumensath
doaj +1 more source
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
Logical Methods in Computer Science, 2023 A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +1 more source
Decidability Results for the Boundedness Problem [PDF]
Logical Methods in Computer Science, 2014 We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees.
Achim Blumensath +2 more
doaj +1 more source
Connection Matrices and the Definability of Graph Parameters [PDF]
Logical Methods in Computer Science, 2014 In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009).
Tomer Kotek, Johann A. Makowsky
doaj +1 more source
Asymptotic Monadic Second-Order Logic [PDF]
, 2014 In this paper we introduce so-called asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic Second-Order Logic over infinite words. This is a logic talking about ω-words labelled by integers.
Achim Blumensath +2 more
openaire +1 more source
A model-theoretic characterization of monadic second-order logic on infinite words [PDF]
, 2017 Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary predicate symbols.
S. Ghilardi +3 more
core +1 more source
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.
R van der Meyden, M K Patra
doaj +1 more source
Bisimulation in Inquisitive Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are ...
Ivano Ciardelli, Martin Otto
doaj +1 more source
On regular languages over power sets
Journal of Language Modelling, 2016 The power set of a finite set is used as the alphabet of a string interpreting a sentence of Monadic Second-Order Logic so that the string can be reduced (in a straightforward way) to the symbols occurring in the sentence.
Tim Fernando
doaj +1 more source