Simplified handling of iterated term schemata

DOI10.1007/S10472-010-9200-3MaRDI QIDQ616760zbMATH OpenOpenAlexFDO

Authors Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier

Publication date 12 January 2011

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-010-9200-3

zbMATH Keywords

automated deductionP-grammarsprimal grammarsterm schematisation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Unification of infinite sets of terms schematized by primal grammars
• The first order theory of primal grammars is decidable
• scientific article; zbMATH DE number 1919508
• scientific article; zbMATH DE number 1300970
• Implementation and Application of Automata

Cites work

• A Schemata Calculus for Propositional Logic
• scientific article; zbMATH DE number 1324446 (Why is no real title available?)
• On unification of terms with integer exponents
• Perfect discrimination graphs: indexing terms with integer exponents
• The first order theory of primal grammars is decidable
• Unification of infinite sets of terms schematized by primal grammars

Cited in

(4)

• Unification of infinite sets of terms schematized by primal grammars
• The first order theory of primal grammars is decidable
• scientific article; zbMATH DE number 1300970 (Why is no real title available?)
• scientific article; zbMATH DE number 1919508 (Why is no real title available?)

This page was built for publication: Simplified handling of iterated term schemata

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