Protected completions of first-order general logic programs

DOI10.1007/BF00245816zbMath0697.68087MaRDI QIDQ911800

V. S. Subrahmanian, James J. Lu

Publication date: 1990

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

zbMATH Keywords

operational semanticsnegationlogic programmingcircumscriptiondeclarative semantics

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal fixedpoints of logic programs
• Notes on the mathematical aspects of Kripke's theory of truth
• A completeness theorem for SLDNF resolution
• Computing protected circumscription
• A kripke-kleene semantics for logic programs*
• A basis for deductive database systems II
• Canonical logic programs
• A computable semantics for general logic programs

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