Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae

DOI10.1093/JIGPAL/11.1.97MaRDI QIDQ4795877zbMATHOpenAlexFDO

Authors Nicolas Peltier

Publication date 24 August 2003

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/11.1.97

zbMATH Keywords

model buildingresolutionautomated deduction

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Model building with ordered resolution: Extracting models from saturated clause sets
• scientific article; zbMATH DE number 515732
• Extracting models from clause sets saturated under semantic refinements of the resolution rule.
• scientific article; zbMATH DE number 549974
• Hyperresolution and automated model building

Cited in

(2)

• Extracting models from clause sets saturated under semantic refinements of the resolution rule.
• Constructing Bachmair-Ganzinger models

This page was built for publication: Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae

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