3562 search results - page 252 / 713 » Introduction to Logic Programming |
233
Voted
ALP
1997
Springer
15 years 10 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-...
152
click to vote
AGP
2003
IEEE
15 years 12 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...
178
click to vote
PPDP
2007
Springer
16 years 23 days 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....
189
click to vote
TPLP
2002
15 years 6 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
159
click to vote
SEKE
2001
Springer
15 years 11 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...