Sciweavers

57 search results - page 7 / 12
» The nomore Approach to Answer Set Solving
Sort
View
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 1 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
LOPSTR
2009
Springer
14 years 2 months ago
Coinductive Logic Programming with Negation
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
Richard Min, Gopal Gupta
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 8 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...
FATES
2005
Springer
14 years 1 months ago
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
Gaoyan Xie, Zhe Dang