… evolution of logic programming to constraint logic programming and … logic on which logic
programming is based, which was later generalized to encompass constraint logic programming…

… Later, in [41], I formulated a more efficient version of the algorithm, using a tabular … This
tabular representation [41] is also the point of departure for [2]. Herbrand's original (1930) version …

… In previous researeh [Dershowitz-84]' we have investigated the use of unconditional rewrite
systems for logic programming. A rewrite system (see [HuetOpprn-80]) is a set of directed …

… simple syntax of logic programs are profound issues concerning semantics, proof theory and
knowledge representation. For example, what does it mean for a logic program P to solve a …

… Apart from these additional problems, we mainly follow the ideas of SLDNF [ 15, 41]
where refutations are derivations ending with the empty goal, derivations are constructed via …

… Miranda [53] and ME TOO [41]. More recently, increasing attention has been devoted to
embedding sets into logic programming languages. Indeed such languages seem to be good …

… In the argumentation-based approach to the semantics of LP, a logic program P is seen as
a theory in a background monotonic logic (the logic of Horn clauses) that can be extended by …

… of logic programming was proposed and then implemented in the language Prolog. Also, the
foundations of logic programming … Their major results concern definite logic programs and …

… We show that this classical formal framework can be applied in extenso to logic programs.
For … up with a short thematic guide to the literature on abstract interpretation of logic programs. …

… However, because we have the full power of logic programming available, we can do
considerably more. For example, filters are a powerful metaphor for the declarative construction of …