Smallest horn clause programs

DOI10.1016/0743-1066(95)00122-0MaRDI QIDQ3129505zbMATH OpenOpenAlexWikidataFDO

Authors Philippe Devienne, Patrick Lebègue, Anne Parrain, Jean-Christophe Routier, Jörg Würtz

Publication date 10 November 1997

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

Full work available at URL https://doi.org/10.1016/0743-1066(95)00122-0

zbMATH Keywords

Horn clause programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Recommendations

• Minimal Logic Programs
• Horn clause solvers for program verification
• Satisfiability of the smallest binary program
• scientific article; zbMATH DE number 2090546
• scientific article; zbMATH DE number 3992920
• A combinatorial algorithm for Horn programs
• A combinatorial algorithm for Horn programs
• scientific article; zbMATH DE number 4160108
• scientific article; zbMATH DE number 193539
• The problem of asking the minimum number of questions in Horn clause systems

Cited in

(5)

• Thue trees
• On computability by logic programs
• Satisfiability of the smallest binary program
• scientific article; zbMATH DE number 512814 (Why is no real title available?)
• The accepting power of unary string logic programs

This page was built for publication: Smallest horn clause programs

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