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