Monadic logic programs and functional complexity
From MaRDI portal
Recommendations
Cites work
- 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?)
- A characterization of time complexity by simple loop programs
- Algorithms for determining relative star height and star height
- Loop-programs and polynomially computable functions
- Satisfiability of the smallest binary program
- Simple Programs Realize Exactly Presburger Formulas
Cited in
(15)- Compositions of programs that induce special monotonic functions
- On functional symbol-free logic programs
- On optimization of monadic logic programs
- Counting on CTL^*: On the expressive power of monadic path logic
- On the complexity of index sets for finite predicate logic programs which allow function symbols
- The accepting power of unary string logic programs
- scientific article; zbMATH DE number 1841812 (Why is no real title available?)
- A fast consequence recognition algorithm for monadic logical programs
- Decidability of the Clark's completion semantics for monadic programs and queries
- Computational Semantics for Monadic Quantifiers
- scientific article; zbMATH DE number 203970 (Why is no real title available?)
- scientific article; zbMATH DE number 6387492 (Why is no real title available?)
- scientific article; zbMATH DE number 4097355 (Why is no real title available?)
- Monadic partition logics and finite automata
- scientific article; zbMATH DE number 1956493 (Why is no real title available?)
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)
