Recurrence domains: Their unification and application to logic programming

DOI10.1006/INCO.1995.1140MaRDI QIDQ1900314zbMATH OpenOpenAlexFDO

Authors Hong Chen, Jieh Hsiang

Publication date 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1140

zbMATH Keywords

\(\rho\)-PrologHorn logic programs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 176722
• scientific article; zbMATH DE number 36613
• On finite representations of infinite sequences of terms
• Logic programming with infinite sets
• Semantics of infinite tree logic programming

Cited in

(6)

• NuMDG: a new tool for multiway decision graphs construction
• The accepting power of unary string logic programs
• Weighted systems of equations
• scientific article; zbMATH DE number 176722 (Why is no real title available?)
• Unification of infinite sets of terms schematized by primal grammars
• On the non-termination of MDG-based abstract state enumeration

This page was built for publication: Recurrence domains: Their unification and application to logic programming

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