Quantifier-free equational logic and prime implicate generation
From MaRDI portal
Recommendations
Cites work
- A rewriting strategy to generate prime implicates in equational logic
- An incremental method for generating prime implicants/implicates
- Equality and abductive residua for Horn clauses
- First order abduction via tableau and sequent calculi
- scientific article; zbMATH DE number 1809862 (Why is no real title available?)
- scientific article; zbMATH DE number 1348482 (Why is no real title available?)
- scientific article; zbMATH DE number 1390353 (Why is no real title available?)
- Implication of clauses is undecidable
- New results on rewrite-based satisfiability procedures
- Paramodulation-based theorem proving
- Prime implicate tries
- RST Flip-Flop Input Equations
- SOLAR: An automated deduction system for consequence finding
- System description: E 1.8
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Theory decision by decomposition
Cited in
(5)
This page was built for publication: Quantifier-free equational logic and prime implicate generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454103)