Naslov
Avoiding Infinite Loops in Rule-Based Systems with Backward Chaining

Autori
Bogunović, Nikola

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of MIPRO 95, Microcomputers in Intelligent Information Systems / Ribarić, Slobodan - Rijeka : Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 1995, 36-42

ISBN
953-6042-17-7

Skup
MIPRO 95, Microcomputers in Intelligent Information Systems

Mjesto i datum
Opatija, Hrvatska, 22.05.1995. - 26.05.1995

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
logic programming; expert systems; automated reasoning

Sažetak
A subset of rule-based expert systems may be viewed as a logic program, consisting of a finite set of normalized logic clauses. Query evaluation, or backward chaining strategy of such programs, is a procedure that searches for a path from a given node to some arbitrary node in the corresponding graph. Hence, there may be some paths that are infinite in length. The paper compares two methods that avoid infinite loops in logic programs. Based on the notion of tabling in deterministic languages, the paper examines a similar method in a non- deterministic computational environment of logic programming. The tabling algorithm is then compared to the Magic transformation method, based on source program transformation. Two methods are analysed with respect to time and space complexity.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo

POVEZANOST RADA