2911 search results - page 98 / 583 » A Logic of Graph Constraints |
90
Voted
JCT
2007
15 years 14 days ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
99
Voted
WCET
2008
15 years 2 months ago
2008
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
133
Voted
CONCUR
2011
Springer
14 years 12 days ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
127
Voted
JCT
2006
15 years 17 days ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
108
Voted
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...