Reasoning about termination of tabled logic programs

Conference Paper uoadl:1046903 234 Read counter

Original Title:
Reasoning about termination of tabled logic programs
Languages of Item:
English
Creator:
Sagonas, Konstantinos
Abstract:
Empty abstract
Main subject category:
Logic
Other subject categories:
Computer science
Keywords:
tabled logic programs, SLG-resolution, definite programs, quasi-termination, quasi-acceptability, LG-termination
Pages (from-to):
243-249
Notes:
Περιλαμβάνει περίληψη και βιβλιογραφικές αναφορές
The digital material of the item is not available.