Sciweavers

1613 search results - page 209 / 323
» Functional and Constraint Logic Programming
Sort
View
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
15 years 4 months ago
Optimized integration of test compression and sharing for SOC testing
1 The increasing test data volume needed to test core-based System-on-Chip contributes to long test application times (TAT) and huge automatic test equipment (ATE) memory requireme...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
IFIP
2004
Springer
15 years 3 months ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré
CASCON
2004
108views Education» more  CASCON 2004»
14 years 11 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
86
Voted
AAAI
1994
14 years 11 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin