Sciweavers

156 search results - page 28 / 32
» Propositional Logic for Circuit Classes
Sort
View
IJSI
2010
84views more  IJSI 2010»
13 years 6 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
UAI
1997
13 years 9 months ago
Object-Oriented Bayesian Networks
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
Daphne Koller, Avi Pfeffer
KR
2004
Springer
14 years 1 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
14 years 2 months ago
Automatic synthesis of compressor trees: reevaluating large counters
Despite the progress of the last decades in electronic design automation, arithmetic circuits have always received way less attention than other classes of digital circuits. Logic...
Ajay K. Verma, Paolo Ienne
DAC
2001
ACM
14 years 8 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi