367 search results - page 13 / 74 » Prolog |
AGP
1993
IEEE
15 years 1 months ago
1993
IEEE
Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Development of distributed systems is a difficult task. Declarative programming techniques hold a promising potential for effectively supporting programmer in this challenge. Whil...
74
Voted
ENTCS
2008
14 years 9 months ago
2008
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
72
Voted
ILP
1998
Springer
15 years 1 months ago
1998
Springer
Cohen's [1] refinement rules provide a flexible mechanism for introducing intentional background knowledge in an ILP system. Whereas Cohen used a limited second order theorem ...