COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES

DOI10.1142/S021848859600010XMaRDI QIDQ3114457zbMATH OpenOpenAlexFDO

Authors Rajiv Bagai, Rajshekhar Sunderraman

Publication date 17 February 2012

Published in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021848859600010x

zbMATH Keywords

deductive databasesincomplete and inconsistent informationrelational algebrawell-founded model

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4112085
• Foundations of modal deductive databases
• scientific article; zbMATH DE number 4199653
• scientific article; zbMATH DE number 4147465
• scientific article; zbMATH DE number 2085287
• A basis for deductive database systems
• Publication:4943320
• On well-founded models for logic programs
• scientific article; zbMATH DE number 4199656

Cited in

(4)

• Quasi-classical reasoning in paraconsistent databases
• An abstract machine for efficiently computing queries to well-founded models
• scientific article; zbMATH DE number 2085287 (Why is no real title available?)
• An algebraic construction of the well-founded model

This page was built for publication: COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES

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