{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:51:05Z","timestamp":1778298665551,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1007\/bf00125368","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T17:43:56Z","timestamp":1099417436000},"page":"205-233","source":"Crossref","is-referenced-by-count":9,"title":["Intensional query answering by partial evaluation"],"prefix":"10.1007","volume":"7","author":[{"given":"Giuseppe","family":"de Giacomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF03038308","volume":"13","author":"C. Aravindan","year":"1994","unstructured":"C. Aravindan and P. M. Dung. Partial Deduction of Logic Programs wrt Well-Founded Semantics. New Generation Computing, 13(1):45?71, 1994.","journal-title":"New Generation Computing"},{"issue":"5","key":"CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1093\/logcom\/3.5.469","volume":"3","author":"K. Benkerimi","year":"1993","unstructured":"K. Benkerimi and P. Hill. Supporting transformation for partial evaluation of logic programs. J. of Logic and Computation, 3(5):469?486, 1993.","journal-title":"J. of Logic and Computation"},{"key":"CR3","unstructured":"K. Benkerimi and J. W. Lloyd. A partial evaluation procedure for logic programs. In Proc. of North American Conf. on Logic Programming, pages 343?358. MIT Press, 1990."},{"issue":"1?2","key":"CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0743-1066(93)90022-9","volume":"16","author":"R. Bol","year":"1993","unstructured":"R. Bol. Loop checking in partial deduction. J. of Logic Programming 16(1?2):25?45, 1993.","journal-title":"J. of Logic Programming"},{"key":"CR5","unstructured":"D. Chan. Constructive negation based on the completed database. In Proc. of 5th International Conference and Symposium on Logic Programming, pages 111?125. MIT Press, 1988."},{"key":"CR6","unstructured":"D. Chan. An extension of constructive negation and its application in coroutining. In Proc. of North American Conf. on Logic Programming, pages 477?493. MIT Press, 1989."},{"key":"CR7","unstructured":"D. Chan and M. Wallace. A treatment of negation during partial evaluation. In Meta-Programming in Logic Programming (Proc. META'88), pages 299?317. MIT Press, 1989."},{"key":"CR8","unstructured":"L. Cholvy and R. Demolombe. Querying a rule base. In Proc. 1st Int. Conf. on Expert Database Systems, pages 365?371, 1986."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"W. W. Chu, Q. Chen, and R.-C. Lee. A pattern-based approach for deriving approximate and intensional answers. In Proc. of the 1st Int. Work. on Interoperability in Multidatabase Systems, pages 262?265. IEEE Comput. Soc. Press, 1991.","DOI":"10.1109\/IMS.1991.153719"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"W. W. Chu, R.-C. Lee, and Q. Chen. Using type inference and induced rules to provide intensional answers. In Proc. of IEEE Int. Conf. on Data Engineering, 1991.","DOI":"10.1109\/ICDE.1991.131488"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"K. L. Clark. Negation as failure. In Logic and Data Bases, pages 293?322. Plenum Press, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"CR12","unstructured":"F. Corella. Semantic retrieval and levels of abstraction. In Proc. 1st Int. Workshop on Expert Database Systems, pages 397?420, 1984."},{"key":"CR13","unstructured":"F. Cuppens and R. Demolombe. Cooperative answering: a methodology to provide intelligent access to databases. In Proc. 2nd Int. Conf. on Expert Database Systems, pages 333?353, 1988."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"G. De Giacomo. Intensional query answering: an application of partial evaluation. In Logic Program Synthesis and Transformation (Proc. of LOPSTR'92), pages 132?150. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3560-9_10"},{"key":"CR15","unstructured":"R. Demolombe. A strategy for the computation of conditional answers. In Proc. of the 10th Europ. Conf. on Artificial Intelligence, 1992."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"R. Demolombe and T. Imielinski, editors. Nonstandard Queries and Nonstandard Answers. Studies in Logic and Computation, Oxford Science Publications, 1994.","DOI":"10.1093\/oso\/9780198538523.001.0001"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"D. A. De Waal. The power of partial evaluation. In Logic Program Synthesis and Transformation (Proc. of LOPSTR'93), pages 159?161. Springer-Verlag, 1994.","DOI":"10.1007\/978-1-4471-3234-9_11"},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01185404","volume":"5","author":"W. Drabent","year":"1995","unstructured":"W. Drabent. What's failure? An approach to constructive negation. Acta Informatica, 5(1):27?60, 1995.","journal-title":"Acta Informatica"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"M. M. Fonkam. Employing integrity constraints for query modification and intensional answer generation in multi-database systems. In Advances in Database Systems (Proc. of the 10th British Nat. Conf. on Databases), pages 244?260. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55693-1_42"},{"issue":"3","key":"CR20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(87)90003-3","volume":"4","author":"T. Imielinski","year":"1987","unstructured":"T. Imielinski. Intelligent query answering in rule based systems. J. of Logic Programming, 4(3):229?257, 1987.","journal-title":"J. of Logic Programming"},{"issue":"1","key":"CR21","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/156883.156888","volume":"22","author":"T. Imielinski","year":"1993","unstructured":"T. Imielinski and B. R. Badrinath. Data management for mobile computing. SIGMOD RECORD, 22(1):34?39, 1993.","journal-title":"SIGMOD RECORD"},{"key":"CR22","unstructured":"K. Inoue. Extending logic programs with fefault assumptions. In Proc. of the 8th Int. Conf. on Logic Programming, pages 492?504, 1991."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","volume":"56","author":"K. Inoue","year":"1992","unstructured":"K. Inoue. Linear resolution for consequence finding. Artificial Intelligence, 56:301?353, 1992.","journal-title":"Artificial Intelligence"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Y. H. Kim and H.-Y. Kim. Applying intensional query processing techniques to object-oriented database systems. In Proc. of the 3rd Int. Sym. on Database Systems for Advanced Applications, pages 405?412. World Scientific, 1993.","DOI":"10.1142\/9789814503730_0046"},{"key":"CR25","unstructured":"H. J. Komorowski. A specification of an abstract prolog machine and its application to partial evaluation. Technical Report LSST 69, Link\u00f6ping University, 1981."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"H. J. Komorowski. An introduction to partial deduction. In Proc. of the 3rd Int. Work. of Meta-Programming in Logic (META'92), pages 49?69. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56282-6_4"},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming (2nd edition). Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"3&4","key":"CR28","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. J. of Logic Programming, 11(3&4): 217?242, 1991.","journal-title":"J. of Logic Programming"},{"issue":"3","key":"CR29","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J. W. Lloyd","year":"1984","unstructured":"J. W. Lloyd and R. W. Topor. Making prolog more expressive. J. of Logic Programming, 1(3):225?240, 1984.","journal-title":"J. of Logic Programming"},{"key":"CR30","unstructured":"B. Martens, D. De Schreye, and M. Bruynooghe. Sound and complete partial deduction with unfolding based on well-founded measures. In Proc. of the International Conference on Fifth Generation Computer Systems, pages 473?480, 1992."},{"issue":"1?2","key":"CR31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(94)90203-8","volume":"122","author":"B. Martens","year":"1994","unstructured":"B. Martens, D. De Schreye, and T. Horv\u00e1th. Sound and complete partial deduction with unfolding based on well-founded measures. Theoretical Computer Science, 122(1?2):97?117, 1994.","journal-title":"Theoretical Computer Science"},{"key":"CR32","unstructured":"A. Motro. Using integrity constraints to provide intensional answers to relational queries. In Proc. 15th Int. Conf. on Very Large Data Bases, pages 237?246, 1989."},{"key":"CR33","series-title":"Technical report","volume-title":"Intensional answers to database queries","author":"A. Motro","year":"1991","unstructured":"A. Motro. Intensional answers to database queries. Technical report, Department of Information and Software Systems Engineering, George Mason University, Fairfax, Virginia, 1991."},{"key":"CR34","unstructured":"A. Motro. Responding with knowledge. In Advances in Databases and Artificial Intelligence, Vol. 1: The Landscape of Intelligence in Database and Information Systems. JAI Press, 1993."},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"A. Motro and Q. Yuan. Querying database knowledge. In Proc. of ACM SIGMOD-90, pages 173?183, 1990.","DOI":"10.1145\/93597.98727"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"A. Pirotte and D. Roelantes. Constrainst for improving the generation of intesional answers in a deductive database. In Proc. 5th Int. Conf. on Data Engineering, pages 652?659, 1989.","DOI":"10.1109\/ICDE.1989.47273"},{"issue":"2","key":"CR37","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/69.88002","volume":"3","author":"A. Pirotte","year":"1991","unstructured":"A. Pirotte, D. Roelantes, and E. Zimanyi. Controlled generation of intensional answers. IEEE Trans. on Knowledge and Data Engineering, 3(2): 221?236, 1991.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"CR38","unstructured":"G. D. Plotkin. A note on inductive generalization. In Machine Intelligence, Vol. 5. University Press, 1969."},{"key":"CR39","unstructured":"T. C. Przymusinski. On constructive negation in logic programming. In Proc. of North American Conf. on Logic Programming, pages 1?19 (addendum). MIT Press, 1989."},{"key":"CR40","unstructured":"J. C. Reynolds. Transformational systems and algebraic structure of atomic formulas. In Machine Intelligence, Vol. 5. Edinburgh University Press, 1969."},{"issue":"1","key":"CR41","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","volume":"1","author":"J. C. Shepherdson","year":"1984","unstructured":"J. C. Shepherdson. Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption. J. of Logic Programming, 1(1):51?81, 1984.","journal-title":"J. of Logic Programming"},{"key":"CR42","unstructured":"C. Shum and R. Muntz. Implicit representation for extensional answers. In Proc. 2nd Int. Conf. on Expert Database Systems, pages 257?273, 1988."},{"key":"CR43","doi-asserted-by":"crossref","unstructured":"I.-Y. Song, H.-Y. Kim, and P. Geutner. Intensional query processing: a three-step approach. In Proc. of the Int. Conf. on Database and Expert Systems Applications, pages 542?549. Springer-Verlag, 1990.","DOI":"10.1007\/978-3-7091-7553-8_88"},{"key":"CR44","doi-asserted-by":"crossref","unstructured":"F. Van Harmelen. The limitations of partial evaluation. In Logic-Based Knowledge Representation, pages 87?111. MIT Press, 1989.","DOI":"10.1007\/BFb0015938"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00125368.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00125368\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00125368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T15:56:51Z","timestamp":1734623811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00125368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["BF00125368"],"URL":"https:\/\/doi.org\/10.1007\/bf00125368","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}