4513 search results - page 573 / 903 » Logic programming with satisfiability |
133
click to vote
DAM
2008
15 years 4 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
126
click to vote
FIW
2009
15 years 2 months ago
2009
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
137
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
135
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
198
click to vote
FROCOS
2009
Springer
15 years 11 months ago
2009
Springer
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...