Efficient answer extraction of deductive databases modeled by HLPN

  • Kamel Barkaoui
  • Yasmina Maïzi
Deductive Database and Knowledge Based Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1308)


This paper proposes a model, called Deductive High-Level Petri Net (DHLPN), for which syntax and semantics are derived from High-Level Petri Nets (HLPN). This model serves as a means for capturing the behavior of deductive databases and for implementing an efficient recursive query evaluation. The efficiency of the proposed query evaluation technique lies in the fact that the order of generated tokens (ground predicates) is never greater than the initial set of tokens. We will compare this interpretation technique to the well known interpretation techniques that are magic-sets and envelopes. We will also show that it is possible to give a necessary and sufficient structural condition for the existence of query answers, not taking account of the extensional database.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Bancilhon, D. Maier, Y. Sagiv, J. D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. Proc. ACM SIGACT-SIGMOD Syrup. on Principles of Database Systems. (1986) 1–15.Google Scholar
  2. 2.
    K. Barkaoui, N. Boudriga, A. Touzi: A Transition Net Formalism for Deductive Databases Efficiently Handling Queries and Integrity Constraints Aspects. In Proc of the Int. Conf. on Database and Expert System Applications. Springer-Verlag. DEXA. Valencia. (1992).Google Scholar
  3. 3.
    C. Beeri, R. Ramakrishnan: On the Power of Magic. Journal of Logic Programming. (1991) 255–300.Google Scholar
  4. 4.
    S. Christensen: Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs. Proc. 14th Int. Conf. on Application and Theory of Petri Nets. Chicago. (1992) 186–205.Google Scholar
  5. 5.
    H. J. Genrich, K. Lautenbach: Facts in Place: Transition nets. Lecture Notes in Computer Science, 64. Springer-Verlag.Google Scholar
  6. 6.
    H. J. Genrich: Predicate/ Transition Nets. In Advances in Petri Nets'86. Springer-Verlag (1987).Google Scholar
  7. 7.
    S. Haddad; J. M. Couvreur: Towards a General and Powerful Computation of Flows for Parametrized Coloured Nets. Proc 9th Int. Conf. on Application and Theory of Petri nets. (1988).Google Scholar
  8. 8.
    K. Jensen, G. Rozenberg (Eds): High Level Petri Nets Theory and application. Spring-Verlag. (1991).Google Scholar
  9. 9.
    Y. Maïzi, K. Barkaoui, J. M. Ilié: High-Level Petri Net Formalism for an Efficient Interpretation of Deductive Databases. Proc. fourth Maghrebian Conference on Software Engineering and Artificial Intelligence. Algiers. (1996).Google Scholar
  10. 10.
    G. Peterka, T. Murata: Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs. IEEE Transactions on Software Engineering. Vol. 15, No.2. February (1989) 209–217.Google Scholar
  11. 11.
    R. Ramakrishnan: Magic Templates: A Spellbinding Approach to Logic Programs. Proc. Int. Conf. and Symp. on Logic Programming. (1988) 144–159.Google Scholar
  12. 12.
    J. Rohmer, R. Lescoeur, J. M. Kerisit: The Alexander Method: A Technique for the Processing of Recursive Axioms in Deductive Databases. New Generation Computing (1986) 273–285.Google Scholar
  13. 13.
    R. Ramakrishnan, D. Ullman: A Survey of Deductive Database Systems The Journal of Logic Programming. (1994).Google Scholar
  14. 14.
    Y. Sagiv: Is There Anything Better than Magic?. Proc. of the North American Conference on Logic Programming. Austin, Texas. (1990) 235–254.Google Scholar
  15. 15.
    J. D. Ullman: Principles of Database and Knowledge-Base Systems. volume 1, 2, Computer Science Press. (1988).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Kamel Barkaoui
    • 1
  • Yasmina Maïzi
    • 1
  1. 1.Laboratoire CEDRIC-CNAMParis Cedex 03France

Personalised recommendations