liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
On definite program answers and least Herbrand models
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. Institute of Computer Science, Polish Academy of Sciences.ORCID iD: 0000-0002-4700-7272
2016 (English)In: Theory and Practice of Logic Programming, ISSN 1471-0684, E-ISSN 1475-3081, Vol. 16, no 4, 498-508 p.Article in journal (Refereed) Published
Abstract [en]

A sufficient and necessary condition is given under which least Herbrand models exactlycharacterize the answers of definite clause programs.

Place, publisher, year, edition, pages
Cambridge University Press, 2016. Vol. 16, no 4, 498-508 p.
Keyword [en]
logic programming, least Herbrand model, declarative semantics, function symbols
National Category
Computer Systems
URN: urn:nbn:se:liu:diva-130238DOI: 10.1017/S1471068416000089OAI: diva2:949781
Available from: 2016-07-23 Created: 2016-07-23 Last updated: 2016-07-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Drabent, Wlodzimierz
By organisation
Software and SystemsFaculty of Science & Engineering
In the same journal
Theory and Practice of Logic Programming
Computer Systems

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

Altmetric score

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link