223 search results - page 8 / 45 » Logic programs with monotone abstract constraint atoms |
SUM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
SLP
1990
13 years 8 months ago
1990
eric abstract interpretation framework. The results show significant benefits when using the proposed incremental analysis algorithms.
POPL
2009
ACM
14 years 8 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a ve...