5506 search results - page 115 / 1102 » Minimal Logic Programs |
130
click to vote
AAAI
1990
15 years 4 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
116
Voted
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a separation logic framework which can express properties of memory separation between different points in a program. We describe an algorithm based on this fr...
137
click to vote
ICCAD
2004
IEEE
16 years 4 days ago
2004
IEEE
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
124
click to vote
FM
2008
Springer
15 years 4 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
133
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...