5506 search results - page 303 / 1102 » Minimal Logic Programs |
192
click to vote
ALP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
122
click to vote
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
147
click to vote
PPDP
2007
Springer
15 years 10 months ago
2007
Springer
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
128
click to vote
SEKE
2001
Springer
15 years 9 months ago
2001
Springer
ct 7 Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle 8 defects in the logic design of these s...
172
click to vote
UAI
2008
15 years 6 months ago
2008
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...