Sciweavers

98 search results - page 16 / 20
» The ROOTS Constraint
Sort
View
103
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
103
Voted
CF
2004
ACM
15 years 9 months ago
BLOB computing
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
Frédéric Gruau, Yves Lhuillier, Phil...
IDEAS
1998
IEEE
112views Database» more  IDEAS 1998»
15 years 8 months ago
Transitive Dependencies in Transaction Closures
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. ter...
Kerstin Schwarz, Can Türker, Gunter Saake
134
Voted
IJCAI
2007
15 years 5 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
101
Voted
KRDB
1998
74views Database» more  KRDB 1998»
15 years 5 months ago
Reasoning About Web-Site Structure
Buildinglarge Websites is similar in manywaysto building knowledgeand database systems. In particular, byprovidinga declarative,logical viewof a Website's data andstructure, ...
Mary F. Fernandez, Daniela Florescu, Alon Y. Levy,...