Sciweavers

16404 search results - page 157 / 3281
» A set coverage problem
Sort
View
132
Voted
RWEB
2009
Springer
15 years 10 months ago
Answer Set Programming: A Primer
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
121
Voted
NMR
2004
Springer
15 years 8 months ago
Answer set programming with default logic
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
Victor W. Marek, Jeffrey B. Remmel
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
15 years 3 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
COLOGNETWENTE
2010
15 years 2 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik
110
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 3 months ago
Approximation Algorithms for Dominating Set in Disk Graphs
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
Matt Gibson, Imran A. Pirwani