forest ecosystems that have spent a long time to mature, offer important goods and services to humanity. hence, utilization and exploitation of these resources should be based on careful assessment of their ecological value and potential. ecological land evaluation is an approach based on land quality, vulnerability and potential assessment for different acceptable uses drawing upon related mod...

The paper presents a new logic optimization method of multi-level combinational CMOS circuits, which minimizes area and power. Present methods to reduce power on logic circuits apply functional methods like logic factorization on the Boolean networks. The method described here uses Boolean transformations that exploit implications at the gate-level based on both controllability and observabil-i...

This paper presents the algebraic and Kripke model soundness and completeness of a logic over Boolean monoids. An additional axiom added to the logic will cause the resulting monoid models to be representable as monoids of relations. A star operator, interpreted as reflexive, transitive closure, is conservatively added to the logic. The star operator is a relative modal operator, i.e., one that...

In this paper we explore the application of some notable Boolean methods, namely the Disjunctive Normal Form representation of logic table expansions, and apply them to a real-valued logic model which utilizes quantities on the range [0,1] to produce a probabilistic programming of a game character’s logic in mathematical form.

In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone’s representation theorem. Some special classes of Boolean algebras are also concerned with and, in particular, the relations of Boolean algebras to propositional logic and to set theory are studied in more details. We mention here that all what we do for propositional logic can also be extende...

Boolean Expression Diagrams (BEDs) is a new data structure for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) that are capable of representing any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level ve...

In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone’s representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof of completeness theorem in propositional logic will be given using Stone’s theorem from Boolean algebra. We mention here that the method we used can also be e...

Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic’s take on assertions does not match well with the classical view of assertions as boolean, side effectfree, potentially heap-dependent expressions from the host programming language familiar to many developers. In this paper, we...

For the computational analysis of biological problems-analyzing data, inferring networks and complex models, and estimating model parameters-it is common to use a range of methods based on probabilistic logic constructions, sometimes collectively called machine learning methods. Probabilistic modeling methods such as Bayesian Networks (BN) fall into this class, as do Hierarchical Bayesian Netwo...