367 search results - page 45 / 74 » Prolog |
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
HICSS
2002
IEEE
14 years 26 days ago
2002
IEEE
Currently a number of these on-line support systems for electronic contracting are under development. In this paper we develop a logical formalism to represent the content of busi...
ESOP
2001
Springer
14 years 12 days ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...