2911 search results - page 58 / 583 » A Logic of Graph Constraints |
CORR
2008
Springer
13 years 10 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 ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
AGTIVE
2007
Springer
14 years 2 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
VL
2003
IEEE
14 years 3 months ago
2003
IEEE
We built a prototype tool for browsing constraint systems for the layout of graphical objects. It has two views: In one view, the tool visualizes a constraint system as a threedim...
SEFM
2005
IEEE
14 years 3 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...