2911 search results - page 118 / 583 » A Logic of Graph Constraints |
103
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
137
Voted
AGP
2003
IEEE
15 years 6 months ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
101
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
DEXA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Database integrity constraints, understood as logical conditions that must hold for any database state, are not fully supported by current database technology. It is typi...
COMGEO
2010
ACM
15 years 23 days ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...