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

DOI10.1093/JIGPAL/11.1.97zbMATH Open1017.03004OpenAlexW2017540610MaRDI QIDQ4795877FDOQ4795877

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)

Cited In (2)

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

   Recommendations

• Model building with ordered resolution: Extracting models from saturated clause sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Extracting models from clause sets saturated under semantic refinements of the resolution rule. 👍 👎
• Title not available (Why is that?) 👍 👎
• Hyperresolution and automated model building 👍 👎

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)