3353 search results - page 104 / 671 » Laver and set theory |
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
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 ...
167
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 ...
TARK
2007
Springer
15 years 4 months ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...