Work

Preserving termination of tabled logic programs while unfolding

Year: 1997

Type: conference-paper

Abstract: . We provide a first investigation of the specialisation and transformation of tabled logic programs through unfolding. We show that — surprisingly — unfolding, even determinate, can worsen the termination behaviour in the context of tabling. We therefore establish two criteria which ensure that such mishaps are avoided. We also briefly discuss the influence of some other transformation techniques on the termination and efficiency of tabled logic programs. 1

Source: Lirias

Authors: Michaël Leuschel, Bern Martens, Konstantinos Sagonas

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2632860668

FWCI: 1.227

Cites: 19

Cited by: 12

Related to: 10