scientific article; zbMATH DE number 1390353
From MaRDI portal
Publication:4934645
zbMATH Open0944.68173MaRDI QIDQ4934645FDOQ4934645
Authors: Johan de Kleer 
Publication date: 17 January 2000
Title of this publication is not available (Why is that?)
Recommendations
- Computing prime implicates by pruning the search space and accelerating subsumption
- scientific article; zbMATH DE number 517005
- An efficient algorithm to generate prime implicants
- An incremental algorithm for computing prime implicates in modal logic
- Computing prime implicants via transversal clauses
Cited In (13)
- Algorithms for selective enumeration of prime implicants
- Prime implicate tries
- An SE-tree-based prime implicant generation algorithm
- Title not available (Why is that?)
- A rewriting strategy to generate prime implicates in equational logic
- Automated reasoning and exhaustive search: Quasigroup existence problems
- Computing prime implicates by pruning the search space and accelerating subsumption
- An incremental algorithm for computing prime implicates in modal logic
- Prime implicate generation in equational logic
- An incremental method for generating prime implicants/implicates
- A generic framework for implicate generation modulo theories
- Title not available (Why is that?)
- Quantifier-free equational logic and prime implicate generation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934645)
