
Published in 1988.




...the thesis is developed that logic programming can be understood as a natural and general logic of inductive definitions. in particular, logic pro grams with negation represent nonmonotone inductive...unique intended model of the logic program. in addition, it equips logic programs with an easy to comprehend meaning that corresponds very well with the intuitions of programmers....

...previous results show that nested logic programs can be transformed into standard (unnested) disjunctive logic programs in an elementary way, applying...provide a polynomial translation of logic programs with nested expressions into disjunctive logic programs. moreover, we show that this...

...higherorder logic programming (holp) languages are particularly useful for various kinds of meta programming and theorem proving tasks because of the logical support for variable binding via...reasonably be viewed as constraint logic program ming (clp) languages, and show...

...we investigate properties of logic programs that permit refinements in their...that we propose, become competitive with stan dard (topdown) implementations of logic programs. this increased efficiency is achieved...

...results on representability of all computable predicates by horn clause logic programs are not related to the real universe on which logic programs operate. sldresolution, which is...main result we prove that computability by horn clause logic programs is equivalent to standard computability over the herbrand universe with variables. the semantics we use...

...is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. next to classical...different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming....