uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
On computability by logic programs
Uppsala University.
1995 (English)In: ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, ISSN 1012-2443, Vol. 15, no 3-4, 437-456 p.Article in journal (Other scientific) Published
Abstract [en]

The problem of computational completeness of Horn clause logic programs is revisited. The standard results on representability of all computable predicates by Horn clause logic programs are not related to the real universe on which logic programs operate.

Place, publisher, year, edition, pages
BALTZER SCI PUBL BV , 1995. Vol. 15, no 3-4, 437-456 p.
URN: urn:nbn:se:uu:diva-27256OAI: oai:DiVA.org:uu-27256DiVA: diva2:55150
Addresses: Voronkov A, UNIV UPPSALA, DEPT COMP SCI, S-75105 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-16

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 135 hits
ReferencesLink to record
Permanent link

Direct link