On computability by logic programs

DOI10.1007/BF01536404zbMath0861.68014MaRDI QIDQ1924787

Andrei Voronkov

Publication date: 20 October 1996

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

zbMATH Keywords

logic programscomputational completeness of Horn clause

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Declarative modeling of the operational behavior of logic languages
• Unit Refutations and Horn Sets
• Horn clause computability

This page was built for publication: On computability by logic programs