Skip to main content
SpringerLink
Log in

Abstract Objects to Represent Large Answers to Queries in a Concise Form

  • Conference paper
Flexible Query Answering Systems

Part of the book series: Advances in Soft Computing ((AINSC,volume 7))

  • 145 Accesses

Abstract

Abstract objects can be used to represent in a concise form answers that are communicated by telephone. We present a formal framework in first order logic in which are defined abtract answers, their lower bounds and their upper bounds. Algebraic formulas are given to efficiently compute the abstract answers from the abstraction of the predicates that occur in a given query. We also present a method to reduce the error caused by the abstraction process that has to be computed when users want to get an exact answer.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Demolombe. Syntactical Characterization of a Subset of Domain Independent Formulas. Journal of ACM, 1982.

    Google Scholar 

  2. T. Ellman. Approximation and Abstraction Techniques for Generating Concise Answers to Database Queries. In Proc. of AAAI Spring Symposium, 1995.

    Google Scholar 

  3. T. Imielinski and W. Lipski. The Relational model of data and cylindric algebras. Technical Report 446, Institue of Computer Science, Polish Academy of Science, 1981.

    Google Scholar 

  4. T. Imielinski. Domain abstraction and limited reasoning. In Proc. of the 10th IJCAI, 1987.

    Google Scholar 

  5. J-M. Nicolas. Logic for improving integrity checking in relational data bases. Acta Informatica, Vol 18 (Num 3), 1982.

    Google Scholar 

  6. R. A. Di Paola. The recursive unsolvability of the decision problem for the class of Definite Formulas. Journal of ACM, 16 (2), 1969.

    Google Scholar 

  7. J. D. Ullman. Principles of Database Systems. Computer Science Press, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ONERA Toulouse, 2 Avenue E. Belin, BP 4025, 31055, Toulouse, France

    Robert Demolombe

Authors
  1. Robert Demolombe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Roskilde University, P.O. Box 260, 4000, Roskilde, Denmark

    Henrik L. Larsen , Troels Andreasen  & Henning Christiansen ,  & 

  2. Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, 01-447, Warsaw, Poland

    Janusz Kacprzyk  & Sławomir Zadrożny  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demolombe, R. (2001). Abstract Objects to Represent Large Answers to Queries in a Concise Form. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadrożny, S. (eds) Flexible Query Answering Systems. Advances in Soft Computing, vol 7. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1834-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1834-5_16

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1347-0

  • Online ISBN: 978-3-7908-1834-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation