5506 search results - page 335 / 1102 » Minimal Logic Programs |
154
click to vote
POPL
2012
ACM
14 years 13 days ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
135
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
121
Voted
FMCAD
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
115
click to vote
MST
2006
15 years 4 months ago
2006
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
145
click to vote
RWEB
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...