scientific article; zbMATH DE number 6387492
From MaRDI portal
Publication:2939010
Recommendations
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- scientific article; zbMATH DE number 3880651
- Decidability of equivalence in the set of program schema with monotonic and partially commutative operators
- Monadic logic programs and functional complexity
- Decidability of the Clark's completion semantics for monadic programs and queries
- scientific article; zbMATH DE number 2079027
- scientific article; zbMATH DE number 1441851
- On the completeness and the decidability of strictly monadic second‐order logic
- Decidability and implementation of parametrized logic programs
- scientific article; zbMATH DE number 515741
Cited in
(6)- Monadic logic programs and functional complexity
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- Decidability of the Clark's completion semantics for monadic programs and queries
- scientific article; zbMATH DE number 1441851 (Why is no real title available?)
- On functional symbol-free logic programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939010)