๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple polynomial groundness analysis for logic programs

โœ Scribed by Andy Heaton; Muhamed Abo-Zaed; Michael Codish; Andy King

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
169 KB
Volume
45
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A semantic basis for the termination ana
A semantic basis for the termination analysis of logic programs
โœ Michael Codish; Cohavit Taboch ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ยฑ a possibly inยฎnite set of binary clauses. Termination of a program P and goal G is determined by the absenc

Meta-logic programming for a synonymy lo
Meta-logic programming for a synonymy logic
โœ Daniele Genito; Giangiacomo Gerla; Alessandro Vignes ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer ๐ŸŒ English โš– 402 KB
LUPSโ€”A language for updating logic progr
LUPSโ€”A language for updating logic programs
โœ Josรฉ Jรบlio Alferes; Luฤฑฬs Moniz Pereira; Halina Przymusinska; Teodor C. Przymusi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

Most of the work conducted so far in the field of logic programming has focused on representing static knowledge, i.e., knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the authors introduced dynamic logic programming. There, they studied and defined the decl