Sciweavers

1127 search results - page 62 / 226
» Theory Extension in ACL2(r)
Sort
View
CSCLP
2007
Springer
16 years 10 days ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
16 years 3 days ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon
GC
2004
Springer
15 years 11 months ago
The KGP Model of Agency for Global Computing: Computational Model and Prototype Implementation
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
Andrea Bracciali, Neophytos Demetriou, Ulrich Endr...
AIR
1998
118views more  AIR 1998»
15 years 5 months ago
Understanding Similarity: A Joint Project for Psychology, Case-Based Reasoning, and Law
Case-based Reasoning (CBR) began as a theory of human cognition, but has attracted relatively little direct experimental or theoretical investigation in psychology. However, psycho...
Ulrike Hahn, Nick Chater
SAT
2010
Springer
174views Hardware» more  SAT 2010»
15 years 4 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret