Sciweavers

15660 search results - page 43 / 3132
» The Unbalance of Set Systems
Sort
View
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
15 years 6 months ago
Language-Independent Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...
Richard C. Wang, William W. Cohen
AGP
2003
IEEE
15 years 5 months ago
Reasoning about the Semantic Web using Answer Set Programming
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
Giovambattista Ianni, Francesco Calimeri, Vincenzi...
AI
2004
Springer
14 years 11 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
ICLP
2010
Springer
15 years 3 months ago
Efficient Solving of Time-dependent Answer Set Programs
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chri...
JSYML
2008
51views more  JSYML 2008»
14 years 11 months ago
Scott's problem for Proper Scott sets
Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and
Victoria Gitman