An algebraic construction of the well-founded model

DOI10.1007/3-540-60043-4_75MaRDI QIDQ5096404zbMATH OpenOpenAlexFDO

Authors Rajiv Bagai, Rajshekhar Sunderraman

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

deductive databaseslogic programsnegative inferencesrelational algebrawell-founded model

Mathematics Subject Classification ID

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

Recommendations

• COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
• A paraconsistent relational data model
• Quasi-classical reasoning in paraconsistent databases
• Paraconsistent disjunctive deductive databases
• The well-founded semantics for general logic programs

Cites work

• A goal-oriented approach to computing the well-founded semantics
• A kripke-kleene semantics for logic programs*
• A paraconsistent relational data model
• scientific article; zbMATH DE number 4147550 (Why is no real title available?)
• scientific article; zbMATH DE number 219215 (Why is no real title available?)
• Modular stratification and magic sets for Datalog programs with negation
• Safe computation of the well-founded semantics of datalog queries
• The well-founded semantics for general logic programs

Cited in

(4)

• A note on well-generated Boolean algebras in models satisfying Martin's axiom
• Efficient representation and algebraic manipulation of infinite relations in paraconsistent databases
• An algebraic evaluation method for deduction in incomplete data bases
• A paraconsistent relational data model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096404)