On Cores and Prime Implicants of Truth Functions

Cited in

(38)

Relevant minimal change in belief update
A semantic analysis of addition and subtraction word problems in arithmetic
Computing prime implicants
Investigations into quantified modal logic. I
Prioritized and non-prioritized multiple change on belief bases
On the failings of Shapley values for explainability
Boolean algebra admits no convergent term rewriting system
ABox abduction in the description logic \(\mathcal{ALC}\)
Abductive network action inference for targeted therapy discovery
Polynomial-time inference of all valid implications for Horn and related formulae
Counterfactuals
Prominent classes of the most general subsumptive solutions of Boolean equations
Polynomial-time algorithms for generation of prime implicants
Embedding complex decision procedures inside an interactive theorem prover.
Length of prime implicants and number of solutions of random CNF formulae
Merging operators on stratified belief bases equipped with argumentative inference
What makes propositional abduction tractable
On the relation between resolution based and completion based theorem proving
Building a consensus: a rectangle covering problem
Optimizing the clausal normal form transformation
scientific article; zbMATH DE number 7561543 (Why is no real title available?)
On converting CNF to DNF
A simpler method for minimization of switching functions
A regularity theoretic approach to actual causation
Enumerating prime implicants of propositional formulae in conjunctive normal form
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
Uncovering deterministic causal structures: a Boolean approach
Quinean Minimization: Some Suggested Modifications
The joy of implications, aka pure Horn formulas: mainly a survey
Boolean function minimization in the class of disjunctive normal forms
On the algebraic structure of conditional events
A many-valued semantics for category mistakes
A generalization of Nelson's algorithm for obtaining prime implicants
On finding optimal covers
On the (complete) reasons behind decisions
Redundancy in logic. II: 2CNF and Horn propositional formulae
An algorithm to generate prime implicants and its application to the selection problem
Algorithmically efficient syntactic characterization of possibility domains

This page was built for publication: On Cores and Prime Implicants of Truth Functions

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