Interpreting disjunctive logic programs based on a strong sense of disjunction

DOI10.1007/BF00881796zbMath0788.68024OpenAlexW2017562692MaRDI QIDQ1311401

James J. Lu, Monica D. Barback, Lawrence J. Henschen

Publication date: 13 January 1994

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

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

zbMATH Keywords

disjunctive logic programstrong disjunctive database

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Cites Work

• Reasoning about truth
• Inferring negative information from disjunctive databases
• A logic for default reasoning
• Stable and extension class theory for logic programs and default logics
• Paraconsistent logic programming
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Deduction in non-Horn databases
• The lattice of extensional connectives: A correction
• Weak generalized closed world assumption
• A fixpoint semantics for disjunctive logic programs
• The well-founded semantics for general logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item