scientific article; zbMATH DE number 176722
From MaRDI portal
Publication:4036550
Recommendations
Cited in
(16)- Transformations of logic programs on infinite lists
- Primal grammars and unification modulo a binary clause
- Recursion equation sets computing logic programs
- Recurrence domains: Their unification and application to logic programming
- Reasoning with recursive loops under the PLP framework
- scientific article; zbMATH DE number 3978355 (Why is no real title available?)
- A logic of recursion
- Domains for logic programming
- Completion of rewrite systems with membership constraints
- Lower bounds for the lengths of refutations
- Unification of infinite sets of terms schematized by primal grammars
- On unification of terms with integer exponents
- The first order theory of primal grammars is decidable
- On finite representations of infinite sequences of terms
- scientific article; zbMATH DE number 4091489 (Why is no real title available?)
- scientific article; zbMATH DE number 3845031 (Why is no real title available?)
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 Q4036550)