An incremental method for generating prime implicants/implicates

DOI10.1016/S0747-7171(08)80029-6zbMath0704.68100OpenAlexW2144078201MaRDI QIDQ917336

Alex Kean, George K. Tsiknis

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80029-6

zbMATH Keywords

prime implicantsclause management systemstruth maintenance systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (19)

Quantifier-Free Equational Logic and Prime Implicate Generation ⋮ Efficient query processing with reduced implicate tries ⋮ Revision in ACMS ⋮ An SE-tree-based prime implicant generation algorithm ⋮ Support set selection for abductive and default reasoning ⋮ Prime forms and minimal change in propositional belief bases ⋮ A generic approach to planning in the presence of incomplete information: theory and implementation ⋮ An incremental method for generating prime implicants/implicates ⋮ First order LUB approximations: characterization and algorithms ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Polynomial-time algorithms for generation of prime implicants ⋮ Characterizing diagnoses and systems ⋮ Linear resolution for consequence finding ⋮ A superposition calculus for abductive reasoning ⋮ Temporal Logic Modeling of Biological Systems ⋮ Abductive Reasoning on Molecular Interaction Maps ⋮ Unnamed Item ⋮ The approximation of implicates and explanations ⋮ Computing prime implicants via transversal clauses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An incremental method for generating prime implicants/implicates
• Diagnosing multiple faults
• On the number of prime implicants
• A New Technique for the Fast Minimization of Switching Functions
• A Method for Generating Prime Implicants of a Boolean Expression
• A Machine-Oriented Logic Based on the Resolution Principle
• RST Flip-Flop Input Equations
• A New Algorithm for Generating Prime Implicants
• A Computing Procedure for Quantification Theory

This page was built for publication: An incremental method for generating prime implicants/implicates