4401 search results - page 633 / 881 » Computing with Default Logic |
156
click to vote
IDEAS
2002
IEEE
15 years 9 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
117
click to vote
FPL
2009
Springer
15 years 9 months ago
2009
Springer
Custom operators, working at custom precisions, are a key ingredient to fully exploit the FPGA flexibility advantage for high-performance computing. Unfortunately, such operators...
101
Voted
PADL
2001
Springer
15 years 9 months ago
2001
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
134
Voted
VLDB
2001
ACM
15 years 9 months ago
2001
ACM
: We present a change-centric method to manage versions in a Web WareHouse of XML data. The starting points is a sequence of snapshots of XML documents we obtain from the web. By r...
131
Voted
PODS
1999
ACM
15 years 9 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...