{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:40Z","timestamp":1725455680049},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634782"},{"type":"electronic","value":"9783540695806"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0022042","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T08:23:13Z","timestamp":1131870193000},"page":"324-336","source":"Crossref","is-referenced-by-count":3,"title":["Efficient answer extraction of deductive databases modeled by HLPN"],"prefix":"10.1007","author":[{"given":"Kamel","family":"Barkaoui","sequence":"first","affiliation":[]},{"given":"Yasmina","family":"Ma\u00efzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"30_CR1","unstructured":"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\u201315."},{"key":"30_CR2","volume-title":"Proc of the Int. Conf. on Database and Expert System Applications","author":"K. Barkaoui","year":"1992","unstructured":"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)."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"C. Beeri, R. Ramakrishnan: On the Power of Magic. Journal of Logic Programming. (1991) 255\u2013300.","DOI":"10.1016\/0743-1066(91)90038-Q"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013205.","DOI":"10.7146\/dpb.v21i398.6632"},{"key":"30_CR5","unstructured":"H. J. Genrich, K. Lautenbach: Facts in Place: Transition nets. Lecture Notes in Computer Science, 64. Springer-Verlag."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"H. J. Genrich: Predicate\/ Transition Nets. In Advances in Petri Nets'86. Springer-Verlag (1987).","DOI":"10.1007\/978-3-540-47919-2_9"},{"key":"30_CR7","unstructured":"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)."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"K. Jensen, G. Rozenberg (Eds): High Level Petri Nets Theory and application. Spring-Verlag. (1991).","DOI":"10.1007\/978-3-642-84524-6"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Y. Ma\u00efzi, K. Barkaoui, J. M. Ili\u00e9: High-Level Petri Net Formalism for an Efficient Interpretation of Deductive Databases. Proc. fourth Maghrebian Conference on Software Engineering and Artificial Intelligence. Algiers. (1996).","DOI":"10.1007\/BFb0022042"},{"issue":"2","key":"30_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/32.21746","volume":"15","author":"G. Peterka","year":"1989","unstructured":"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\u2013217.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"30_CR11","unstructured":"R. Ramakrishnan: Magic Templates: A Spellbinding Approach to Logic Programs. Proc. Int. Conf. and Symp. on Logic Programming. (1988) 144\u2013159."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013285.","DOI":"10.1007\/BF03037407"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"R. Ramakrishnan, D. Ullman: A Survey of Deductive Database Systems The Journal of Logic Programming. (1994).","DOI":"10.1016\/0743-1066(94)00039-9"},{"key":"30_CR14","unstructured":"Y. Sagiv: Is There Anything Better than Magic?. Proc. of the North American Conference on Logic Programming. Austin, Texas. (1990) 235\u2013254."},{"key":"30_CR15","unstructured":"J. D. Ullman: Principles of Database and Knowledge-Base Systems. volume 1, 2, Computer Science Press. (1988)."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T11:01:35Z","timestamp":1683284495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634782","9783540695806"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0022042","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}