Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) - researchr publication

researchr

You are not signed in
Sign in
Sign up

Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi. Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, 25-27 April 1983, Boston, Massachusetts, USA. pages 264-277, ACM, 1983.

Abstract is missing.

runs on WebDSL