Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
Abstract. The need for effective testing techniques for architectural level descriptions is widely recognised. However, due to the variety of domain-specific architectural descript...
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...
Natural language understanding systems require a knowledge base provided with conceptual representations reflecting the structure of human beings' cognitive system. Although ...
There is a growing demand for automated reasoning with world knowledge. SPASS-XDB is an automated reasoning system that incorporates world knowledge from multiple external sources...
Geoff Sutcliffe, Martin Suda, Alexandra Teyssandie...