Most specific logic programs

DOI10.1007/BF01531082zbMath0878.68036OpenAlexW2031552811MaRDI QIDQ1356224

Jean-Louis Lassez, Kim Marriott, Lee Naish

Publication date: 4 June 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531082

zbMATH Keywords

definite logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Most specific logic programs, Unnamed Item, A note on the parallel complexity of anti-unification, Efficient parallel term matching and anti-unification, The applicability of logic program analysis and transformation to theorem proving, Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

Cites Work

• Controlling recursive inference
• Enumeration of success patterns in logic programs
• Most specific logic programs
• Partial evaluation of computation process -- an approach to a compiler-compiler
• Automating control for logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item