971 search results - page 104 / 195 » Approximate Satisfiability and Equivalence |
109
Voted
TIME
2009
IEEE
15 years 7 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
95
Voted
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
ESA
2007
Springer
15 years 7 months ago
2007
Springer
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
106
Voted
SEFM
2006
IEEE
15 years 6 months ago
2006
IEEE
An optimization can be specified as sequential compositions of predefined transformation primitives. For each primitive, we can define soundness conditions which guarantee that th...
193
Voted
ASP
2005
Springer
15 years 6 months ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...