Database Paper Browser

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
2331
Venue
SIGMOD
Year
1987
Pagerank
4.6064553e-05
Overall Rank
8,012 | 44.27%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,693 Modelling Non Deterministic Queries and Updates In Deductive Databases 1988 VLDB 4.9598818e-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