On computing minimal and perfect model membership

DOI10.1016/0169-023X(96)00037-7zbMATH Open0875.68340OpenAlexW2053091922MaRDI QIDQ4332092FDOQ4332092

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing only minimal answers in disjunctive deductive databases
• Title not available (Why is that?)
• Title not available (Why is that?)

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)