Ordered model trees: A normal form for disjunctive deductive databases

DOI10.1007/BF00881914zbMath0819.68050OpenAlexW2076513187MaRDI QIDQ1344891

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

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)

Related Items

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

Cites Work

• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Deduction in non-Horn databases
• Solving Satisfiability with Less Searching
• A Computing Procedure for Quantification Theory
• Unnamed Item
• Unnamed Item