CITI has stopped operations in 2014, to co-launch NOVA LINCS THIS SITE IS NOT BEING UPDATED SINCE 2013
citi banner
  Home  \  Publications  \  InProceedings Page Login  
banner bottom
File Top
A Constraint Logic Programming Scheme for Taxonomic Reasoning

This paper presents a novel scheme for constraint logic programming, based on an abstract model of constraints that takes as primitive the notions of atomic constraint and substitution. It is shown that the constraint model generalizes the constraint languages of Hohfeld and Smolka, and fits well in the general framework proposed by Saraswat. The semantics of the proposed logic programming scheme is an immediate generalization of the semantics of Horn clause logic, and we show that it possesses simple characterizations of the operational, declarative and fixed-point semantics. The main motivation for this work was to formalize the notion of useful and concise answers to queries to hierarchic type systems. The paper ends with a simple example illustrating this application.

@ Proceedings of the Joint International Conference and Symposium on Logic Programming

Editors: Krzysztof Apt

Series: Series in Logic Programming

Publisher: The MIT Press ( United States )

Pages: 255 to 269

Date: November, 1992


File Bottom