Protected completions of first-order general logic programs

DOI10.1007/BF00245816zbMATH Open0697.68087MaRDI QIDQ911800FDOQ911800

Authors: James J. Lu, V. S. Subrahmanian 

Publication date: 1990

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

Recommendations

• The well-founded semantics for general logic programs
• Complete extension of general logic programs
• scientific article; zbMATH DE number 956484
• Complete logic programs with domain-closure axiom
• Negation-as-failure rule for general logic programs with equality

zbMATH Keywords

negationlogic programmingcircumscriptionoperational semanticsdeclarative semantics

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Artificial intelligence (68T99) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Notes on the mathematical aspects of Kripke's theory of truth
• A kripke-kleene semantics for logic programs*
• Title not available (Why is that?)
• A computable semantics for general logic programs
• Optimal fixedpoints of logic programs
• A completeness theorem for SLDNF resolution
• Title not available (Why is that?)
• A basis for deductive database systems II
• Computing protected circumscription
• Canonical logic programs

This page was built for publication: Protected completions of first-order general logic programs

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