The following pages link to Neil V. Murray (Q211660):
Displaying 38 items.
- Fast subsumption checks using anti-links (Q679247) (← links)
- Linearity and regularity with negation normal form (Q703486) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- Completely non-clausal theorem proving (Q1157923) (← links)
- A framework for automated reasoning in multiple-valued logics (Q1272603) (← links)
- On the relative merits of path dissolution and the method of analytic tableaux (Q1331929) (← links)
- CNF and DNF considered harmful for computing prime implicants/implicates (Q1367074) (← links)
- (Q2766946) (← links)
- (Q3046854) (← links)
- Computing prime implicates by pruning the search space and accelerating subsumption (Q3133151) (← links)
- Dissolution (Q3140015) (← links)
- Reduced Implicate Tries with Updates (Q3406691) (← links)
- Identifying Prime Implicate Branches in Reduced Implicate Tries (Q3568273) (← links)
- Prime Implicate Tries (Q3648735) (← links)
- (Q3751043) (← links)
- Inference with path resolution and semantic graphs (Q3773844) (← links)
- (Q3783624) (← links)
- (Q3804233) (← links)
- (Q3838812) (← links)
- An application of \(P_ 4\)-free graphs in theorem-proving (Q3972130) (← links)
- (Q4246967) (← links)
- (Q4282528) (← links)
- (Q4314600) (← links)
- On the Computational Intractability of Analytic Tableau Methods (Q4318171) (← links)
- (Q4360109) (← links)
- (Q4366602) (← links)
- (Q4501669) (← links)
- (Q4540005) (← links)
- (Q4728268) (← links)
- (Q4956020) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5187866) (← links)
- Updating Reduced Implicate Tries (Q5434489) (← links)
- Duality in Knowledge Compilation Techniques (Q5450865) (← links)
- Normal Forms for Knowledge Compilation (Q5450872) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479280) (← links)
- (Q5692880) (← links)
- (Q5750421) (← links)
- \(\mho\)-resolution and hybrid knowledge bases (Q5947353) (← links)
