Abstract

This paper surveys and compares different techniques investigated in order to integrate negation in rule-based query languages. In the context of deductive databases, a rule-based query is a logic program. The survey focuses on the problem of defining the declarative semantics of logic programs with negation. The declarative semantics of logic programs with negation based on fixpoint techniques, based on three valued logic and based on non-monotonic logics are presented for positive logic programs, (locally) stratifiable logic programs and unstratifiable logic programs. The expressive power of rule-based query languages is examined.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call