Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions

DOI10.1007/BF02432149zbMath0642.68158MaRDI QIDQ1101250

C. Aquilano, P. Bocchetti, Roberto Barbuti, Maurizio Martelli

Publication date: 1986

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

zbMATH Keywords

completenesslogic programmingclosed world assumptionquery evaluationrecursive definitionsnegation as failure

Mathematics Subject Classification ID

Related Items (1)

Strict completion of logic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• A basis for deductive database systems

This page was built for publication: Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions