Comparing computational representation of Herbrand models

MaRDI QIDQ4364515zbMATH OpenFDO

Authors Robert Matzinger

Publication date 15 April 1998

zbMATH Keywords

automated model buildingautomated theorem provingcomputational representation of Herbrand modelscontext-free languagesexpressive powersemantic resolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Computational representations of Herbrand models using grammars
• scientific article; zbMATH DE number 2090303
• Algorithms on atomic representations of Herbrand models
• scientific article; zbMATH DE number 1051240

Cited in

(7)

• Constructing infinite models represented by tree automata
• On the expressivity and applicability of model representation formalisms
• Model Representation over Finite and Infinite Signatures
• Computational representations of Herbrand models using grammars
• scientific article; zbMATH DE number 2090303 (Why is no real title available?)
• Model Representation over Finite and Infinite Signatures
• New Computational Paradigms

This page was built for publication: Comparing computational representation of Herbrand models

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