4573 search results - page 635 / 915 » Automated Reasoning |
150
click to vote
CSL
2003
Springer
15 years 9 months ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
130
click to vote
ECSQARU
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a set of transformations on the set of all probability distributions over a finite state space, and show that these transformations are the only ones that preserve c...
126
click to vote
ECSQARU
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The Hugin and Shenoy–Shafer architectures are two variations on the jointree algorithm, which exhibit different tradeoffs with respect to efficiency and query answeri...
132
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
130
click to vote
FLOPS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...