13841 search results - page 81 / 2769 » Algorithms and Constraint Programming |
199
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
105
click to vote
AUTOMATICA
2008
15 years 20 days ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
102
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
107
Voted
JAIR
2006
15 years 15 days ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
DAC
2002
ACM
16 years 1 months ago
2002
ACM
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...