874 search results - page 56 / 175 » Computing Weighted Solutions in Answer Set Programming |
ASP
2001
Springer
14 years 9 months ago
2001
Springer
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
NETWORKS
2010
14 years 3 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
ISCAS
1999
IEEE
14 years 9 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
ICLP
2003
Springer
14 years 9 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
ICS
1997
Tsinghua U.
14 years 8 months ago
1997
Tsinghua U.
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...