Titlebook: Extensions of Logic Programming; 5th International Wo Roy Dyckhoff,Heinrich Herre,Peter Schroeder-Heiste Conference proceedings 1996 Spring

闡釋

Roy Dyckhoff,Heinrich Herre,Peter Schroeder-Heiste

caldron

Semantics of constraint logic programs with bounded quantifiers,ng in a natural way. We define several semantics for constraint logic programs with bounded quantifiers and prove their equivalence. Our results can be used to define semantics for some existing constraint logic programming languages, like cc(FD).

營養(yǎng)

Translating a modal language with embedded implication into Horn clause logic, in a multiagent situation and hypothetical reasoning) into Horn clauses, therefore suitable for SLD resolution. The translation takes two steps: the first one eliminates embedded implications by introducing new modalities; the second eliminates modalities by adding an argument which represents the

指派

Pruning the search space of logic programs, the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language G?del.

捏造

A significant extension of logic programming by adapting model building rules,ramming. A rather complete, though reasonably short, description of the ideas and technicalities of the former method is given in order to make the paper self-contained. Specialization of several key rules permits to obtain three main theoretical results concerning extensions of logic programming: n

壟斷

degradation