On computability by logic programs
type: Item
instance of: scholarly article
title: On computability by logic programs
zbMATH Open document ID: 0861.68014
DOI: 10.1007/BF01536404
author: Andrei Voronkov
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 937282
zbMATH Keywords: computational completeness of Horn clause
zbMATH Keywords: logic programs
MaRDI profile type: Publication
cites work: Declarative modeling of the operational behavior of logic languages
cites work: Unit Refutations and Horn Sets
cites work: Q5590814
cites work: Q5573961
cites work: Horn clause computability
description: scientific article; zbMATH DE number 937282