Transforming Probabilities With Combinational Logic

Synthesizing Combinational Logic to Generate Probabilities: Theories and Algorithms

Printed Copies: Combinational Logic Veriication with Fbdds Combinational Logic Veriication with Fbdds

Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..

Power Optimized Combinational Logic Design

In this paper we address the problem of minimization of power consumption in combinational circuits by minimizing the number of switching transitions at the output nodes of each gate. A powerful combinational logic optimization method using k-map is presented here that is based on disjoint implicants (implicates) of a function. More than 10% reduction in switching activity has been obtained wit...

Toward Markov Logic with Conditional Probabilities

Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some subset of first-order logic are probabilistic relational models (PRMs), Bayesian logic programs (BLPs) and Markov logic networks (MLNs). Of these three formalisms, MLN is the currently most actively researched. While the ...

Toward Markov Logic with Conditional Probabilities

Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some subset of first-order logic are probabilistic relational models (PRMs), Bayesian logic programs (BLPs) and Markov logic networks (MLNs). Of these three formalisms, MLN is the currently most actively researched. While the ...