Sciweavers

75 search results - page 8 / 15
» Reducing Query Answering to Satisfiability in Nonmonotonic L...
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
Abstract. The deployment of KR formalisms to the Web has created the need for formalisms that combine heterogeneous knowledge bases. Nonmonotonic dl-programs provide a loose integr...
Stijn Heymans, Thomas Eiter, Guohui Xiao
CCIA
2009
Springer
13 years 8 months ago
Anytime Reasoning Mechanism for Conversational Agents
When an agent receives a query from another agent, it tries to satisfy it by building an answer based on its current knowledge. Depending on the available time or the urgency of t...
M. Mariela Morveli-Espinoza, Josep Puyol-Gruart
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 7 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
DBPL
2001
Springer
113views Database» more  DBPL 2001»
13 years 12 months ago
Model-Checking Based Data Retrieval
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
Agostino Dovier, Elisa Quintarelli
SSD
2009
Springer
233views Database» more  SSD 2009»
14 years 1 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...