1937 search results - page 181 / 388 » Rule Based Updates on Simple Knowledge Bases |
121
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
148
click to vote
SAC
2000
ACM
15 years 9 months ago
2000
ACM
: The World Wide Web’s anticipated scope as an environment for knowledge exchange has changed dramatically. Without major modifications to its primary mechanisms the Web has turn...
117
click to vote
VLDB
1992
ACM
15 years 8 months ago
1992
ACM
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
118
click to vote
ECIR
2007
Springer
15 years 6 months ago
2007
Springer
Information retrieval systems (IRSs) usually suffer from a low ability to recognize a same idea that is expressed in different forms. A way of improving these systems is to take ...
110
click to vote
ICISC
2003
15 years 6 months ago
2003
Abstract. It had been thought that it is difficult to provide receiptfreeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct...