Sciweavers

705 search results - page 2 / 141
» Approximating Extended Answer Sets
Sort
View
FLAIRS
2008
14 years 3 days ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Mathias Niepert, Cameron Buckner, Colin Allen
ASP
2005
Springer
14 years 3 months ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
13 years 1 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
LPNMR
2005
Springer
14 years 3 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
VLDB
1999
ACM
105views Database» more  VLDB 1999»
14 years 2 months ago
Histogram-Based Approximation of Set-Valued Query-Answers
Yannis E. Ioannidis, Viswanath Poosala