Generalization of ZYT-linearizability for bilinear datalog programs

Author： Kang J.-H. Hong K.-H. Whang K.-Y. Cho J.-W.

Publisher： Elsevier

ISSN： 0890-5401

Source： Information and Computation, Vol.188, Iss.1, 2004-01, pp. : 77-98

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Inference of monotonicity constraints in Datalog programs

By Brodsky A.

Annals of Mathematics and Artificial Intelligence, Vol. 26, Iss. 1-4, 1999-01 ,pp. : 29-57

Springer Publishing Company

Access to resources Recommend Favorite

4-Webs in the Plane and Their Linearizability

By Goldberg Vladislav V.

Acta Applicandae Mathematicae, Vol. 80, Iss. 1, 2004-01 ,pp. : 35-55

Springer Publishing Company

Access to resources Recommend Favorite

Zero Duality Gap for Convex Programs: A Generalization of the Clark–Duffin Theorem

By Ernst Emil Volle Michel

Journal of Optimization Theory and Applications, Vol. 158, Iss. 3, 2013-09 ,pp. : 668-686

Springer Publishing Company

Access to resources Recommend Favorite

Complexity and Expressive Power of Deterministic Semantics for DATALOG^¬

By Greco S. Saccà D.

Information and Computation, Vol. 153, Iss. 1, 1999-08 ,pp. : 81-98

Academic Press

Access to resources Recommend Favorite

Control of spectrum in bilinear systems

By Zaitsev V.

Differential Equations, Vol. 46, Iss. 7, 2010-07 ,pp. : 1071-1075

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite