On the existence of nonterminating queries for a restricted class of PROLOG-clauses

DOI10.1016/0004-3702(89)90012-XzbMath0689.68114MaRDI QIDQ582150

Kristof Verschaetse, Maurice Bruynooghe, Danny De Schreye

Publication date: 1989

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

rational treesnonterminating queriesrecursive predicates

Mathematics Subject Classification ID

Artificial intelligence (68T99) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

A non-termination criterion for binary constraint logic programs, Primal grammars and unification modulo a binary clause, Weighted systems of equations, A second-order formulation of non-termination

Cites Work

• Unnamed Item
• Fundamental properties of infinite trees
• On recursive axioms in deductive databases
• Controlling recursive inference
• Automating control for logic programs
• Efficient loop detection in prolog using the tortoise-and-hare technique