2911 search results - page 83 / 583 » A Logic of Graph Constraints |
115
Voted
DIMACS
1996
15 years 1 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
104
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
EWSA
2004
Springer
15 years 6 months ago
2004
Springer
We present an approach to component inheritance and reuse which closes the gap between architectural design and process-oriented approaches. To apply inheritance checks in design a...
111
Voted
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
110
click to vote
DALT
2004
Springer
15 years 6 months ago
2004
Springer
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...