413 search results - page 12 / 83 » On the Relation Between ID-Logic and Answer Set Programming |
SCALESPACE
2005
Springer
14 years 2 months ago
2005
Springer
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
ICLP
1994
Springer
14 years 26 days ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
VMCAI
2010
Springer
14 years 6 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
SUM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...