4513 search results - page 394 / 903 » Logic programming with satisfiability |
132
click to vote
ICFP
2006
ACM
16 years 5 months ago
2006
ACM
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
147
click to vote
DAC
2004
ACM
16 years 6 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
119
click to vote
DAC
2005
ACM
16 years 6 months ago
2005
ACM
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
254
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
PRISM is a probabilistic extension of Prolog. It is a high level language for probabilistic modeling capable of learning statistical parameters from observed data. After reviewing ...
153
click to vote
PLPV
2009
ACM
16 years 1 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...