Sciweavers

59 search results - page 2 / 12
» Prime Implicates and Prime Implicants in Modal Logic
Sort
View
ICTAI
1997
IEEE
13 years 9 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...
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
SIAMDM
2008
84views more  SIAMDM 2008»
13 years 5 months ago
On k-Term DNF with the Largest Number of Prime Implicants
Robert H. Sloan, Balázs Szörény...
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
13 years 10 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley
RSCTC
2000
Springer
146views Fuzzy Logic» more  RSCTC 2000»
13 years 9 months ago
Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts
Abstract. We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relation...
Maciej Borkowski, Dominik Slezak