Ordered model trees: A normal form for disjunctive deductive databases

DOI10.1007/BF00881914MaRDI QIDQ1344891zbMATH OpenOpenAlexFDO

Authors Adnan Yahya, José Alberto Fernández, Jack Minker

Publication date 22 February 1995

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00881914

zbMATH Keywords

disjunctive deductive databasesordered minimal model trees

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Publication:4943320
• A logical characterization of the preferred models of logic programs with ordered disjunction
• scientific article; zbMATH DE number 1114053
• Theory and algorithms for disjunctive deductive databases
• Expressive power and complexity of partial models for disjunctive deductive databases
• Logics for unordered trees with data constraints
• scientific article; zbMATH DE number 1407680
• scientific article; zbMATH DE number 4112085
• Disjunctive bases: normal forms and model theory for modal logics
• A generic disjunctive/conjunctive decomposition model for n-ary relations

Cites work

• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• Deduction in non-Horn databases
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Solving Satisfiability with Less Searching

Cited in

(4)

• A tableau calculus for minimal model reasoning
• Minimal model generation with positive unit hyper-resolution tableaux
• Jack Minker --- A profile
• Computing only minimal answers in disjunctive deductive databases

This page was built for publication: Ordered model trees: A normal form for disjunctive deductive databases

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