Sciweavers

2526 search results - page 15 / 506
» A New Algorithm for Answer Set Computation
Sort
View
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 6 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin
ICSE
2008
IEEE-ACM
16 years 21 days ago
Debugging reinvented: asking and answering why and why not questions about program behavior
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
Andrew Jensen Ko, Brad A. Myers
JAPLL
2010
179views more  JAPLL 2010»
14 years 10 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
SOFSEM
2007
Springer
15 years 6 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
ECAI
2008
Springer
15 years 1 months ago
New Results for Horn Cores and Envelopes of Horn Disjunctions
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...
Thomas Eiter, Kazuhisa Makino