977 search results - page 108 / 196 » Logic programming with infinite sets |
ENTCS
2007
15 years 17 days ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
127
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
86
Voted
IJCAI
1993
15 years 1 months ago
1993
We study multiple predicate learning in an empirical setting. Problems with existing inductive logic programming approaches in this setting are sketched and an empirical ILP syste...
103
Voted
MICAI
2000
Springer
15 years 4 months ago
2000
Springer
We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit ne...
CL
2000
Springer
15 years 5 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...