Disjunctive \(LP+\) integrity constraints = stable model semantics.

DOI10.1007/BF01530802zbMath1034.68507WikidataQ109585668 ScholiaQ109585668MaRDI QIDQ1353944

V. S. Subrahmanian, Jorge Lobo, José Alberto Fernández, Jack Minker

Publication date: 12 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

function-free logic programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Logic programming in tensor spaces, Ordered model trees: A normal form for disjunctive deductive databases, An alternative approach to the semantics of disjunctive logic programs and deductive databases, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Jack Minker --- A profile, Answer set programming made easy, Computing minimal models by partial instantiation

Cites Work

• Unnamed Item
• Circumscription - a form of non-monotonic reasoning
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Deduction in non-Horn databases
• What should a database know?
• The Semantics of Predicate Logic as a Programming Language