An algebraic construction of the well-founded model

DOI10.1007/3-540-60043-4_75zbMath1496.68125OpenAlexW1480351826MaRDI QIDQ5096404

Rajshekhar Sunderraman, Rajiv Bagai

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60043-4_75

zbMATH Keywords

relational algebralogic programsdeductive databaseswell-founded modelnegative inferences

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Safe computation of the well-founded semantics of datalog queries
• A kripke-kleene semantics for logic programs*
• A goal-oriented approach to computing the well-founded semantics
• The well-founded semantics for general logic programs
• Modular stratification and magic sets for Datalog programs with negation
• A paraconsistent relational data model

This page was built for publication: An algebraic construction of the well-founded model