A comparison of three PROLOG extensions

DOI10.1016/0743-1066(92)90038-5zbMath0754.68034OpenAlexW2013481966MaRDI QIDQ3992235

David W. Reed, Donald W. Loveland

Publication date: 13 August 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(92)90038-5

zbMATH Keywords

case analysis\(N\)-PROLOGnear-Horn PROLOGnon-Horn reasoningsimplified problem reduction format

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17)

Related Items

TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic, Near-Horn Prolog and the ancestry family of procedures, Non-Horn clause logic programming, Model elimination without contrapositives, Renaming a set of non-Horn clauses