Sciweavers

58 search results - page 3 / 12
» Constrainedness and Redundancy by Constraint Ordering
Sort
View
AI
2006
Springer
13 years 7 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
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
14 years 1 days 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
CPAIOR
2010
Springer
13 years 6 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
13 years 8 months ago
Leveraging spatio-temporal redundancy for RFID data cleansing
Radio Frequency Identification (RFID) technologies are used in many applications for data collection. However, raw RFID readings are usually of low quality and may contain many an...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang, Min-Te Su...