Sciweavers

331 search results - page 1 / 67
» Using Redundant Constraints for Refinement
Sort
View
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
CADE
2004
Springer
14 years 8 months ago
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Yevgeny Kazakov, Hans de Nivelle
CADE
1998
Springer
13 years 12 months ago
A Resolution Decision Procedure for the Guarded Fragment
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Hans de Nivelle
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
13 years 7 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
CP
2003
Springer
14 years 25 days ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey