The limits of Horn logic programs

DOI10.1007/3-540-45619-8_32MaRDI QIDQ4812982zbMATH OpenFDO

Authors Shilong Ma, Yuefei Sui, Ke Xu

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2401/24010467.htm

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 4160108
• Semantics of Horn and disjunctive logic programs
• Complexities of Horn description logics
• The expressive power of Horn monadic linear logic
• scientific article; zbMATH DE number 1420827
• Near-Horn prolog and beyond
• Semantical and computational aspects of Horn approximations
• scientific article; zbMATH DE number 4125378
• Computing in Horn clause theories
• scientific article; zbMATH DE number 4009854

Cited in

(10)

• Extending Horn clause logic with implication goals
• Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
• Decidable subsets of open logic and an algorithm for R-calculus
• Truth in the limit
• Smallest horn clause programs
• scientific article; zbMATH DE number 4160108 (Why is no real title available?)
• On Bounded Database Schemes and Bounded Horn-Clause Programs
• Computing in Horn clause theories
• The expressive power of Horn monadic linear logic
• Case-free programs: An abstraction of definite horn programs

This page was built for publication: The limits of Horn logic programs

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