Negation and minimality in disjunctive databases

DOI10.1016/0743-1066(94)00026-3MaRDI QIDQ3125092zbMATH OpenOpenAlexFDO

Authors Marco Schaerf

Publication date 17 March 1997

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(94)00026-3

zbMATH Keywords

non-Horn databasessemantics

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Computing only minimal answers in disjunctive deductive databases
• scientific article; zbMATH DE number 25190
• Minimalism, justification and non-monotonicity in deductive databases
• Theory and algorithms for disjunctive deductive databases
• Querying disjunctive databases through nonmonotonic logics
• Minimal negation in the ternary relational semantics
• On the partial semantics for disjunctive deductive databases
• On the completed database semantics for negation
• Minimal founded semantics for disjunctive logic programs and deductive databases

Cited in

(12)

• Inferring negative information from disjunctive databases
• Minimalism, justification and non-monotonicity in deductive databases
• Reasoning with minimal models: efficient algorithms and applications
• Interpreting disjunctive logic programs based on a strong sense of disjunction
• Deduction in non-Horn databases
• Disjunction as alternative choices
• Rules for inferring negative information from disjunctive databases and deductive databases
• Introducing negative information in relational databases
• scientific article; zbMATH DE number 4064539 (Why is no real title available?)
• Closed world assumption for disjunctive reasoning
• Parsing as non-Horn deduction
• Negation in rule-based database languages: A survey

This page was built for publication: Negation and minimality in disjunctive databases

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