Sciweavers

778 search results - page 20 / 156
» Expressiveness and complexity of graph logic
Sort
View
121
Voted
CIE
2006
Springer
15 years 4 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
ICDAR
2003
IEEE
15 years 5 months ago
Graph Grammar Based Analysis System of Complex Table Form Document
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
Akira Amano, Naoki Asada
CAV
2010
Springer
181views Hardware» more  CAV 2010»
15 years 4 months ago
Policy Monitoring in First-Order Temporal Logic
We present an approach to monitoring system policies. As a specification language, we use an expressive fragment of a temporal logic, which can be effectively monitored. We repor...
David A. Basin, Felix Klaedtke, Samuel Müller
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
16 years 1 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
IFIPTCS
2010
14 years 10 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König