On Cores and Prime Implicants of Truth Functions

Cited in

(40)

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

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)