Sciweavers

2911 search results - page 71 / 583
» A Logic of Graph Constraints
Sort
View
PVLDB
2011
13 years 25 days ago
Distance-Constraint Reachability Computation in Uncertain Graphs
Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang
4OR
2005
71views more  4OR 2005»
13 years 10 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler
FOSSACS
2008
Springer
13 years 11 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
CP
2006
Springer
14 years 1 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
ESANN
1997
13 years 11 months ago
Extraction of crisp logical rules using constrained backpropagation networks
Two recently developed methods for extraction of crisp logical rules from neural networks trained with backpropagation algorithm are compared. Both methods impose constraints on th...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...