Wood, Peter and Mendelzon, A.O. and Atzeni, P. (1988) Idempotent single-predicate horn clauses. In: Gyssens, M. and Paredaens, J. and Van Gucht, D. (eds.) ICDT 88: 2nd International Conference on Database Theory. Lecture Notes in Computer Science 326. Springer, pp. 129-143. ISBN 9783540501718.
Abstract
Previous work has addressed the issues of idempotence and boundedness for various restricted classes of Horn-clause queries. In this paper, we consider queries consisting of a single clause containing a single predicate symbol. As such, these queries are a notational variant of the full, untagged tableau queries with recursive semantics. The study of the idempotence and boundedness for single-clause, single-predicate queries has previously been restricted to the typed case. We generalize these results to obtain syntactic, polynomial-time computable characterizations of idempotence for certain classes of untyped queries.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 25 Oct 2021 15:16 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46469 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
