Sciweavers

705 search results - page 33 / 141
» Approximating Extended Answer Sets
Sort
View
99
Voted
DLOG
2008
15 years 21 hour ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
VLDB
1994
ACM
149views Database» more  VLDB 1994»
15 years 1 months ago
Qualified Answers That Reflect User Needs and Preferences
This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and ver...
Terry Gaasterland, Jorge Lobo
FLOPS
2008
Springer
14 years 11 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...
NDQA
2003
129views Education» more  NDQA 2003»
14 years 11 months ago
Knowledge Tracking: Answering Implicit Questions
Research on Question Answering has produced an arsenal of useful techniques for detecting answers that are explicitly present in the text of a collection of documents. To move bey...
Reinhard Stolle, Daniel G. Bobrow, Cleo Condoravdi...
93
Voted
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti