On computing minimal and perfect model membership

DOI10.1016/0169-023X(96)00037-7MaRDI QIDQ4332092zbMATH OpenOpenAlexFDO

Authors

Publication date 27 February 1997

Published in Data & Knowledge Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-023x(96)00037-7

zbMATH Keywords

ComplexityDeductive databasesMinimal ModelIndefinite dataCyclic treeGeneralised closed world assumptionPerfect model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• On computing minimal models
• Computing only minimal answers in disjunctive deductive databases
• Logic Programming
• Computing minimal models by partial instantiation
• Evaluation of queries under closed-world assumption

Cited in

(5)

• scientific article; zbMATH DE number 7724189 (Why is no real title available?)
• Computing only minimal answers in disjunctive deductive databases
• scientific article; zbMATH DE number 5215800 (Why is no real title available?)
• scientific article; zbMATH DE number 1389855 (Why is no real title available?)
• scientific article; zbMATH DE number 1931664 (Why is no real title available?)

This page was built for publication: On computing minimal and perfect model membership

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