Date: October 1998
Pages: 40
The aim of this work is to define a new class of logic programs, strongly range restricted logic programs, and to design and implement an efficient algorithm for grounding them locally. A grounding transforms a function-free logic program into an equivalent ground logic program. A grounding is local if can be done one rule at a time. The implementation works with smodels, an implementation for stable model semantics for normal logic programs which is developed at Helsinki University of Technology. The implementation is compared with old grounder of smodels and dlv, a knowledge representation system developed at Vienna University of Technology.
Keywords: logic programming, stable models, smodels, grounding