Tri-Based Set Operations and Selective Computation of Prime Implicates-Reference-Cited by-同舟云学术

Tri-Based Set Operations and Selective Computation of Prime Implicates

Published:2011 Issue: Volume: Page:203-213
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Matusiewicz Andrew,Murray Neil V.,Rosenthal Erik

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21916-0_23

Reference22 articles.

1. Bittencourt, G.: Combining syntax and semantics through prime form representation. Journal of Logic and Computation 18, 13–33 (2008)

2. Castell, T.: Computation of prime implicates and prime implicants by a variant of the davis and putnam procedure. In: ICTAI, pp. 428–429 (1996)

3. Chandra, A., Markowsky, G.: On the number of prime implicants. Discrete Mathematics 24, 7–11 (1978)

4. Coudert, O., Madre, J.: Implicit and incremental computation of primes and essential implicant primes of boolean functions. In: 29th ACM/IEEE Design Automation Conference, pp. 36–39 (1992)

5. de Kleer, J.: An improved incremental algorithm for computing prime implicants. In: Proc. AAAI 1992, San Jose, CA, pp. 780–785 (1992)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inference of Robust Reachability Constraints;Proceedings of the ACM on Programming Languages;2024-01-05

2. A Generic Framework for Implicate Generation Modulo Theories;Automated Reasoning;2018

3. Prime Implicate Generation in Equational Logic;Journal of Artificial Intelligence Research;2017-12-18

4. Computing prime implicates by pruning the search space and accelerating subsumption;Journal of Logic and Computation;2015-10-16

5. A Superposition Calculus for Abductive Reasoning;Journal of Automated Reasoning;2015-09-16