Inclusion Constraints Over Non-Empty Sets of Trees

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0030609
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy