98 search results - page 16 / 20 » The ROOTS Constraint |
146
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
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...
141
click to vote
CF
2004
ACM
15 years 11 months ago
2004
ACM
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...
152
click to vote
IDEAS
1998
IEEE
15 years 10 months ago
1998
IEEE
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...
172
click to vote
IJCAI
2007
15 years 7 months ago
2007
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...
124
click to vote
KRDB
1998
15 years 7 months ago
1998
Buildinglarge Websites is similar in manywaysto building knowledgeand database systems. In particular, byprovidinga declarative,logical viewof a Website's data andstructure, ...