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

Direct link
Modular termination proofs for Prolog with tabling
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
1999 (English)In: Principles and Practice of Declarative Programming, 1999, 342-359 p.Conference paper (Refereed)
Place, publisher, year, edition, pages
1999. 342-359 p.
URN: urn:nbn:se:uu:diva-36572DOI: doi:10.1007/10704567_21OAI: oai:DiVA.org:uu-36572DiVA: diva2:64471
Available from: 2007-02-09 Created: 2007-02-09

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Sagonas, Konstantinos
By organisation
Department of Information TechnologyComputing Science

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: 165 hits
ReferencesLink to record
Permanent link

Direct link