254 search results - page 25 / 51 » Answer Sets for Propositional Theories |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could ...
75
Voted
STOC
2007
ACM
15 years 10 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
67
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
164
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
PODS
2006
ACM
15 years 9 months ago
2006
ACM
The query equivalence problem has been studied extensively for set-semantics and, more recently, for bag-set semantics. However, SQL queries often combine set and bag-set semantic...