165 search results - page 12 / 33 » Constraints: The Ties that Bind |
PPCP
1993
13 years 11 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
ESWA
2010
13 years 6 months ago
2010
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of availab...
COLING
2008
13 years 9 months ago
2008
Various types of structural information e.g., about the type of constructions in which binding constraints apply, or about the structure of names - play a central role in corefere...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a class of constraints, referred to as conditional functional dependencies (CFDs), and study their applications in data cleaning. In contrast to traditional functional ...