BIROn - Birkbeck Institutional Research Online

    Syntactic characterizations of 1-bounded datalog

    Wood, Peter (1991) Syntactic characterizations of 1-bounded datalog. In: Delobel, C. and Kifer, M. and Masunaga, Y. (eds.) DOOD 91: Deductive and Object-Oriented Databases. Lecture Notes in Computer Science 566. Springer, pp. 208-225. ISBN 9783540550150.

    Full text not available from this repository.

    Abstract

    We identify a number of simple, syntactic properties of recursive subgoals in linear single-rule and two-rule Datalog programs. These properties can be recognized in linear time and provide a sufficient condition for uniform 1-boundedness of single-rule programs. They can also be used to characterize both uniform 1-boundedness for single-rule programs and 1-boundedness for two-rule programs, when the programs belong to certain classes studied previously for the problem of boundedness. In addition, we provide an exact characterization for 1-boundedness of two-rule programs in which no EDB predicate is repeated in the recursive rule.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 25 Oct 2021 14:32
    Last Modified: 25 Oct 2021 14:32
    URI: https://eprints.bbk.ac.uk/id/eprint/46463

    Statistics

    Downloads
    Activity Overview
    0Downloads
    36Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item