Filters
Show more
Show more
Show more
Show more
Show more
Show more
Show more
Show more
More filters
Results
Bisimulation Invariant Monadic-Second Order Logic in the Finite
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coin...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Bisimulation invariant monadic-second order logic in the finite
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coin...
Computer and information sciences
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Causality in Bounded Petri Nets is MSO Definable
In this work we show that the causal behaviour of any bounded Petri net is definable in monadic second order (MSO) logic. Our proof relies in a definability vs recognizability result for DAGs whose edges and vertic...
BA - Obecná matematika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Approximating max-cut under graph-MSO constraints
We consider the max-cut and max-k-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a 0.5-a...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Monads in Logic Programming
This paper describes implementation of monads in logic programming. In a monadic library we had to solve problems concerning higher-order code, free variables, and non-directionality of data flow. A special syntax ...
JC - Počítačový hardware a software
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
On a Fragment of AMSO and Tiling Systems
We prove that satisfiability over infinite words is decidable for a fragment of asymptotic monadic second-order logic. In this fragment we only allow formulae of the form exists tforall sexists rphi(r,s,t), where p...
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Monads and Monadic Parsers in Higher Order Logic Programming
Not available...
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Model-Checking on Ordered Structures
We study the model-checking problem for first- and monadic second-order logic of research and study model-checking for first- and monadic second-order logic-invariant monadic...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
We introduce ``matroid parse trees'' which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounded branch-width over a finite field. We prove that if $mf M$ is a family of matroids desc...
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
dWiNA - An Implementation of Decision Procedure for WS1S
This tool is an implementation of novel approach based on anti-chains for deciding Weak Monadic Second-Order Logic of one successor (WS1S)....
IN - Informatika
- 2015 •
- R •
- Link
Rok uplatnění
R - Software
Výsledek na webu
- 1 - 10 out of 113 737