2911 search results - page 81 / 583 » A Logic of Graph Constraints |
107
Voted
ALGORITHMICA
2002
15 years 12 days ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
141
Voted
ICLP
2011
Springer
14 years 4 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
102
Voted
ISSTA
2004
ACM
15 years 6 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
75
Voted
CADE
2006
Springer
16 years 26 days ago
2006
Springer
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
ISCAS
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...