Monadic logic programs and functional complexity

DOI10.1016/S0304-3975(96)00093-XzbMath0903.68028MaRDI QIDQ1392280

Armando B. Matos

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

monadic logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Decidability of the Clark's completion semantics for monadic programs and queries ⋮ The accepting power of unary string logic programs

Cites Work

• Algorithms for determining relative star height and star height
• A characterization of time complexity by simple loop programs
• Satisfiability of the smallest binary program
• Loop-programs and polynomially computable functions
• Simple Programs Realize Exactly Presburger Formulas
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monadic logic programs and functional complexity