Results 1  10
of
31,728
On brambles, gridlike minors, and parameterized intractability of monadic secondorder logic
"... Brambles were introduced as the dual notion to treewidth, one of the most central concepts of the graph minor theory of Robertson and Seymour. Recently, Grohe and Marx showed that there are graphs G, in which every bramble of order larger than the square root of the treewidth is of exponential size ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
to construct gridlike minors, a replacement structure for gridminors recently introduced by Reed and Wood, in polynomial time. Using the gridlike
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Lower Bounds for the Complexity of Monadic SecondOrder Logic
"... Abstract—Courcelle’s famous theorem from 1990 states that any property of graphs definable in monadic secondorder logic (MSO2) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO2 is fixedparameter tractable in linear time on any such class of graphs. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract—Courcelle’s famous theorem from 1990 states that any property of graphs definable in monadic secondorder logic (MSO2) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO2 is fixedparameter tractable in linear time on any such class of graphs
MONA: Monadic SecondOrder Logic in Practice
 IN PRACTICE, IN TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, FIRST INTERNATIONAL WORKSHOP, TACAS '95, LNCS 1019
, 1995
"... The purpose of this article is to introduce Monadic Secondorder Logic as a practical means of specifying regularity. The logic is a 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 finitestate au ..."
Abstract

Cited by 148 (20 self)
 Add to MetaCart
The purpose of this article is to introduce Monadic Secondorder Logic as a practical means of specifying regularity. The logic is a 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
Hardware Verification using Monadic SecondOrder Logic
 IN COMPUTER AIDED VERIFICATION : 7TH INTERNATIONAL CONFERENCE, CAV '95, LNCS 939
, 1995
"... We show how the secondorder monadic theory of strings can be used to specify hardware components and their behavior. This logic admits a decision procedure and countermodel generator based on canonical automata for formulas. We have used a system implementing these concepts to verify, or find e ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
We show how the secondorder monadic theory of strings can be used to specify hardware components and their behavior. This logic admits a decision procedure and countermodel generator based on canonical automata for formulas. We have used a system implementing these concepts to verify, or find
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 553 (24 self)
 Add to MetaCart
curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization. Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh. We compare our method to previous operators
Monadic Secondorder Logic for Parameterized Verification
 Basic Research in Computer Science
, 1994
"... Much work in automatic verification considers families of similar finitestate systems. But an often overlooked property is that sometimes a single finitestate system can be used to describe a parameterized, infinite family of systems. Thus verification of unbounded state spaces can take place ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Much work in automatic verification considers families of similar finitestate systems. But an often overlooked property is that sometimes a single finitestate system can be used to describe a parameterized, infinite family of systems. Thus verification of unbounded state spaces can take place
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
, indeterministic choice, interleaving, and hiding, and provides a mutual recursion operator. cc(.L,t) is (intentionally!) very similar to Milner’s CCS, but for the radically different underlying concept of communication, which, in fact, pro’ The class is founded on the notion of “constraint logic pro
The complexity of firstorder and monadic secondorder logic revisited
 ANNALS OF PURE AND APPLIED LOGIC
, 2004
"... ..."
Results 1  10
of
31,728