658 search results - page 22 / 132 » A Logic for Graphs with QoS |
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
SEFM
2005
IEEE
14 years 2 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
ENTCS
2007
13 years 8 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...