A constraint-based language for querying taxonomic systems

  • Margarida Mamede
  • Luís Monteiro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 541)


This paper presents a language for querying taxonomic systems which is essentially a variant of first-order logic with terms denoting types instead of individuals. A query expressed in the language is either a declarative or an interrogative sentence. Declarative sentences correspond to the usual first-order formulae and require a “yes” or “no” answer. Interrogative sentences are basically declarative sentences with some variables stipulated as “query” variables, for which the required answers are type assignments to the query variables making the sentences true. From the semantic point of view, queries will be interpreted as type constraints on the query variables, and answers as constraints in a specified normal form called “solved” form. To that effect, the paper proposes a general scheme for constraint programming based on the notions of constraint satisfaction and constraint reduction, and shows how the query language can be viewed as an instance of the scheme. This constraint system is the basis of a constraint logic programming system dealing with type information as described by taxonomies.


Logic Program Query Language Constraint Programming Atomic Type Reduction System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A-KN86]
    H. Aït-Kaci, R. Nasr. Login: A Logic Programming Language with Built-in Inheritance. Journal of Logic Programming, 3:185–215. 1986.Google Scholar
  2. [Car88]
    L. Cardelli. A Semantics of Multiple Inheritance. Information and Control, 76:138–164. 1988.Google Scholar
  3. [JL87]
    Joxan Jaffar, Jean-Louis Lassez. Constraint Logic Programming. In Proc. 14th ACM POPL Conference, Munich, 1987.Google Scholar
  4. [MM91]
    Margarida Mamede, Luís Monteiro. Answers as Type Constraints. Presented at the International Workshop on Non-standard Queries and Non-standard Answers, Toulouse, France. July 1–3, 1991.Google Scholar
  5. [MP90]
    Luís Monteiro, António Porto. A Transformational View of Inheritance in Logic Programming. In Logic Programming: Proceedings of the Seventh International Conference, D.H.D. Warren and P. Szeredi (eds.), MIT Press, Cambridge MA, 1990.Google Scholar
  6. [Por88]
    António Porto. A Framework for Deducing Useful Answers to Queries. In M. Tokoro (ed.), Proc. IFIP WG 10.1 Workshop on Concepts and Characteristics of Knowledge-Based Systems, North-Holland, 1988.Google Scholar
  7. [PF84]
    António Porto, Miguel Filgueiras. A Logic Programming Approach to Natural Language Semantics. In Proc. International Symposium on Logic Programming, IEEE Press, 1984.Google Scholar
  8. [Tou86]
    D.S. Touretzki. The Mathematics of Inheritance Systems. Pitman, London, 1986.Google Scholar
  9. [Weg86]
    P. Wegner. Classification in object-oriented systems. In Proc. Object-Oriented Programming Workshop, ACM Sigplan Notices 21 (10), 173–182. 1986.Google Scholar
  10. [Sco82]
    D. Scott. Domains for Denotational Semantics. In Proc. ICALP 82, Springer Verlag, New York, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Margarida Mamede
    • 1
  • Luís Monteiro
    • 1
  1. 1.Departamento de InformáticaUniversidade Nova de LisboaMonte da CaparicaPortugal

Personalised recommendations