IDNAF Prolog

DOI10.1016/0893-9659(94)90104-XMaRDI QIDQ1328781zbMATH OpenOpenAlexFDO

Authors M. Mahroos, Scott D. Goodwin, Eric Neufeld

Publication date 7 August 1994

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0893-9659(94)90104-x

zbMATH Keywords

graph searchProlog programstheorem proving

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
• scientific article; zbMATH DE number 4076677
• scientific article; zbMATH DE number 52709
• scientific article; zbMATH DE number 1531964
• scientific article; zbMATH DE number 4078852

Cites work

• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• Compiling a default reasoning system into Prolog
• Composing recursive logic programs with clausal join
• Depth-first iterative-deepening: An optimal admissible tree search
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 67516 (Why is no real title available?)

This page was built for publication: IDNAF Prolog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328781)