J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be expressed as a conjunctive query over the relations in the set S? Our algorithm is derived by first introducing the concept of a plain basis for a co-clone and then identifying natural plain bases for every co-clone in Post's lattice. In the process, we also give a quadratic algorithm for the problem of finding the smallest co-clone containing a Boolean relation. © 2008 Elsevier Inc. All rights reserved.
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Shu Tezuka
WSC 1991
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control