Protected completions of first-order general logic programs

DOI10.1007/BF00245816MaRDI QIDQ911800zbMATH OpenFDO

Authors James J. Lu, V. S. Subrahmanian

Publication date 1990

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

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)

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

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3956409 (Why is no real title available?)
• scientific article; zbMATH DE number 3958704 (Why is no real title available?)
• A basis for deductive database systems II
• A completeness theorem for SLDNF resolution
• A computable semantics for general logic programs
• A kripke-kleene semantics for logic programs*
• Canonical logic programs
• Computing protected circumscription
• Notes on the mathematical aspects of Kripke's theory of truth
• Optimal fixedpoints of 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)