DBScholar

Back to papers

Non-deterministic Modelling of Logical Queries in Deductive Databases

Summary: PNLP uses Petri Nets to model logic queries in deductive databases, with a simple formal description and graphical view. It exposes rule–predicate relations, unifies recursive-query algorithms, and reveals non-determinism and parallelism in Horn clauses. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2393
Venue
SIGMOD
Year
1987
Pagerank
5.4551195e-05
Overall Rank
8,316 | 42.95%
DOI
10.1145/38713.38726

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{aly_sigmod87,
        title = {{Non-deterministic Modelling of Logical Queries in Deductive Databases}},
        author = {Aly, Hussien and Ozsoyoglu, Z. Meral},
        series = {{SIGMOD} '87},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/38713.38726},
        url = {https://dl.acm.org/doi/10.1145/38713.38726},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,752 Modelling Non Deterministic Queries and Updates In Deductive Databases 1988 VLDB 5.7837368e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers