2236 search results - page 342 / 448 » Language Independence and Language Tolerance in Logic Progra... |
127
click to vote
SIGSOFT
2005
ACM
16 years 4 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
149
click to vote
ASPLOS
2006
ACM
15 years 10 months ago
2006
ACM
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
152
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
121
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
205
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...