Skip to main content
SpringerLink
Log in
Book cover

Logic Program Synthesis and Transformation pp 132–150Cite as

Intensional Query Answering: An Application of Partial Evaluation

  • Chapter

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

We consider intensional answers to be logical formulas expressing sufficient conditions for objects to belong to the usual answer to a query addressed to a knowledge base. We show that in the SLDNF-resolution framework, complete and procedurally complete sets of intensional answers can be generated by using partial evaluation. Specific treatments of recursion and negation are also presented.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Benkerimi and J. W. Lloyd. A Partial Evaluation Procedure for Logic Programs. In Proc. of North American Conf. on Logic Programming, S. K. Derbray and M. Hermenegildo eds., pp.343-358, Austin, MIT Press, 1990.

    Google Scholar 

  2. K. L. Clark. Negation as Failure. In Logic and Data Bases, H. Gallaire and J. Minker eds., pp.293–322, Plenum Press, 1978.

    Google Scholar 

  3. L. Cholvy. and R. Demolombe. Querying a Rule Base. In Proc. Ist Int Conf. on Expert Database Systems, pp. 365–371, Charlesoton, South Carolina, April 1986.

    Google Scholar 

  4. F. Cuppens and R. Demolombe. Cooperative Answering: A Methodology to Provide Intelligent Access to Databases. In Proc. 2nd Int. Conf. on Expert Database Systems, pp. 333–353, Tysons Corner, Virginia, April 1988.

    Google Scholar 

  5. D. Chan. Constructive Negation Based on the Completed Database. In Proc.of 5th International Conference and Symposium on Logic Programming, R. A. Kowalski and K. A. Bowen eds., pp.111–125, MIT Press, 1988.

    Google Scholar 

  6. D. Chan. An Extension of Constructive Negation and its Application in Coroutining. In Proc. of North American Conf. on Logic Programming, E. Lusk and R. Overback eds., pp.477–493, MIT Press, 1989.

    Google Scholar 

  7. F. Corella. Semantic Retrieval and Levels of Abstraction. In Proc. 1st Int. Workshop on Expert Database Systems, pp. 397–420, Kiawah Island, South Carolina, October 1984.

    Google Scholar 

  8. D. Chan and M. Wallance. A Treatment of Negation During Partial Evaluation. In Meta-Programming in Logic Programming,H. D. Abramson and M. H. Rogers eds., pp.299–317, MIT Press, 1989. (Proc. Meta88).

    Google Scholar 

  9. R. Demolombe. A Strategy for the Computation of Conditional Answers. In Proc. ECAI’92,to appear.

    Google Scholar 

  10. R. Demolombe, L. Farinas del Cerro, T. Imielinski (eds.). Proc. Workshop on Nonstandard Queries and Answers, Toulouse, France, July, 1991.

    Google Scholar 

  11. G. De Giacomo. Intensional Query Answering by Partial Evaluation. Technical Report,Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza. In preparation.

    Google Scholar 

  12. T. Imielinski. Intelligent Query Answering in Rule Based Systems. In The Journal of Logic Programming, 4(3):229–257, September 1987.

    Google Scholar 

  13. J. W. Lloyd. Foundations of Logic Programming (2nd edition). Springer-Verlag, 1987.

    Google Scholar 

  14. J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming In The Journal of Logic Programming,11(3and4):217242, October/November 1991.

    Google Scholar 

  15. J. W. Lloyd and R. W. Topor. Making Prolog More Expressive. The Journal of Logic Programming, 1 (3): 225–240, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  16. A. Motro. Using Integrity Constraints to Provide Intensional Answers to Relational Queries. In Proc. 15th Int. Conf on Very Large Data Bases, pp. 237–246, Amsterdam, August 1989.

    Google Scholar 

  17. A. Motro. Intensional Answers to Database Queries. Technical Report, Department of Information and Software Systems Engineering, George Mason University, Fairfax, Virginia, 1991.

    Google Scholar 

  18. A. Motro and Q. Yuan. Querying Database Knowledge. In Proc. Of ACM SIGMOD-90, pp. 173–183, 1990.

    Google Scholar 

  19. A. Pirotte and D. Roelantes. Constraints for Improving the Generation of Intensional Answers in a Deductive Database. In Proc. 5th Int. Conf. on Data Engineering, pp. 652–659, Los Angeles, Califor nia, February 1989.

    Google Scholar 

  20. A. Pirotte, D. Roelantes, E Zimanyi. Controlled Generation of Intensional Answers. In IEEE Trans. on Knowledge and Data Engineering Vol 3No.2, pp.221–236, June 1991.

    Google Scholar 

  21. T. C. Przymusinski. On Constructive Negation in Logic Programming In Proc. of North American Conf. on Logic ProgrammingE. Lusk and R. Overback eds., pp.1–19 (addendum), MIT Press, 1989.

    Google Scholar 

  22. C. Shum and R. Muntz. Implicit Representation for Extensional Answers. In Proc. 2nd Int. Conf. on Expert Database Systems, pp.257-273, Tysons Corner, Virginia, April 1988.

    Google Scholar 

  23. F. van Harmelen. The Limitations of Partial Evaluation. In Logic-Based Knowledge Representation, P. Jackson, H. Reichgelt, F. van Harmelen eds., pp.87–111, MIT Press, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, 00198, Roma, Italia

    Giuseppe De Giacomo

Authors
  1. Giuseppe De Giacomo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University, M13 9PL, Manchester, UK

    Kung-Kiu Lau Bsc, PhD  & Timothy Paul Clement Ma, DPhil  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag London

About this chapter

Cite this chapter

De Giacomo, G. (1993). Intensional Query Answering: An Application of Partial Evaluation. In: Lau, KK., Clement, T.P. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3560-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3560-9_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19806-2

  • Online ISBN: 978-1-4471-3560-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation