Sciweavers

105 search results - page 1 / 21
» A New Algorithm for Incremental Prime Implicate Generation
Sort
View
IJCAI
1993
13 years 6 months ago
A New Algorithm for Incremental Prime Implicate Generation
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...
Teow-Hin Ngair
CDES
2006
106views Hardware» more  CDES 2006»
13 years 6 months ago
A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
Sirzat Kahramanli, Suleyman Tosun
AAAI
2007
13 years 7 months ago
Prime Implicates and Prime Implicants in Modal Logic
The purpose of this paper is to extend the notions of prime implicates and prime implicants to the basic modal logic K. We consider a number of different potential definitions of...
Meghyn Bienvenu
INFORMS
2010
110views more  INFORMS 2010»
13 years 2 months ago
Incremental Satisfiability and Implication for UTVPI Constraints
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
Andreas Schutt, Peter J. Stuckey
ICTAI
1997
IEEE
13 years 8 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...