This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Abstract. Traditional retrieval models assume that query terms are independent and rank documents primarily based on various term weighting strategies including TF-IDF and document...
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...