Sciweavers

56 search results - page 10 / 12
» Testing the Reasoning for Question Answering Validation
Sort
View
ASP
2003
Springer
13 years 11 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
CIKM
1997
Springer
13 years 10 months ago
Analysis and Design of Server Informative WWW-Sites
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza ...
CIA
2006
Springer
13 years 9 months ago
Semantic Web Research Anno 2006: Main Streams, Popular Fallacies, Current Status and Future Challenges
In this topical1 paper we try to give an analysis and overview of the current state of Semantic Web research. We point to different interpretations of the Semantic Web as the reaso...
Frank van Harmelen
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III