Sciweavers

7868 search results - page 165 / 1574
» Learning by Answer Sets
Sort
View
FOCS
2004
IEEE
15 years 8 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
AIED
2005
Springer
15 years 10 months ago
Automatic Textual Feedback for Guided Inquiry Learning
We briefly introduce the online learning environment INFACT, and then we describe its textual feedback system. The system automatically provides written comments to students as the...
Steven L. Tanimoto, Susan Hubbard, William Winn
GIS
2008
ACM
16 years 6 months ago
An inconsistency tolerant approach to querying spatial databases
In order to deal with inconsistent databases, a repair semantics defines a set of admissible database instances that restore consistency, while staying close to the original insta...
Leopoldo E. Bertossi, Mónica Caniupá...
WWW
2004
ACM
16 years 5 months ago
Providing ranked relevant results for web database queries
Often Web database users experience difficulty in articulating their needs using a precise query. Providing ranked set of possible answers would benefit such users. We propose to ...
Ullas Nambiar, Subbarao Kambhampati
AMW
2010
15 years 6 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris