Monadic logic programs and functional complexity

DOI10.1016/S0304-3975(96)00093-XMaRDI QIDQ1392280zbMATH OpenFDO

Authors Armando B. Matos

Publication date 23 July 1998

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

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00093-X

zbMATH Keywords

monadic logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 6387492
• Decidability of the Clark's completion semantics for monadic programs and queries
• On functional symbol-free logic programs
• Complexity and undecidability results for logic programming

Cites work

• A characterization of time complexity by simple loop programs
• Algorithms for determining relative star height and star height
• scientific article; zbMATH DE number 194781 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3304881 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Loop-programs and polynomially computable functions
• Satisfiability of the smallest binary program
• Simple Programs Realize Exactly Presburger Formulas

Cited in

(16)

• Compositions of programs that induce special monotonic functions
• On the monotonicity of (LDL) logic programs with set.
• Counting on CTL^*: On the expressive power of monadic path logic
• A fast consequence recognition algorithm for monadic logical programs
• On optimization of monadic logic programs
• scientific article; zbMATH DE number 6387492 (Why is no real title available?)
• scientific article; zbMATH DE number 4097355 (Why is no real title available?)
• Computational Semantics for Monadic Quantifiers
• scientific article; zbMATH DE number 1956493 (Why is no real title available?)
• Decidability of the Clark's completion semantics for monadic programs and queries
• scientific article; zbMATH DE number 203970 (Why is no real title available?)
• scientific article; zbMATH DE number 1841812 (Why is no real title available?)
• On functional symbol-free logic programs
• On the complexity of index sets for finite predicate logic programs which allow function symbols
• The accepting power of unary string logic programs
• Monadic partition logics and finite automata

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

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