874 search results - page 3 / 175 » Computing Weighted Solutions in Answer Set Programming |
LPAR
2004
Springer
14 years 3 months ago
2004
Springer
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...
HEURISTICS
1998
13 years 10 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
PADL
2005
Springer
14 years 3 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
ICLP
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...