A transformation system for deductive database modules with perfect model semantics

DOI10.1016/0304-3975(93)90013-JzbMath0780.68022MaRDI QIDQ1208734

Michael J. Maher

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

moduledeductive databaseslogic languagedependency propertiesequivalence of logic programstransformation system

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (11)

Rules + strategies for transforming lazy functional logic programs ⋮ Determinization of conditional term rewriting systems ⋮ Constraint-based correctness proofs for logic program transformations ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Unnamed Item ⋮ Transformations of CLP modules ⋮ BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS ⋮ A semantics for modular general logic programs ⋮ Transforming constraint logic programs ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs

Cites Work

• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• A completeness theorem for SLDNF resolution
• Completed logic programs and their consistency
• On the power of magic
• Horn clause queries and generalizations
• Efficient bottom-up computation of queries on stratified databases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A transformation system for deductive database modules with perfect model semantics