1613 search results - page 90 / 323 » Functional and Constraint Logic Programming |
102
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
136
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
131
Voted
PLDI
2010
ACM
15 years 8 months ago
2010
ACM
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
153
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
148
click to vote
SUM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...