182 search results - page 10 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
114
click to vote
PADL
2005
Springer
15 years 5 months ago
2005
Springer
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to us...
ICLP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
CCE
2004
14 years 11 months ago
2004
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
SIAMJO
2008
14 years 11 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
100
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...