Sharing Resource-Sensitive Knowledge Using Combinator Logics

  • Marcelo Finger
  • Wamberto Vasconcelos
Conference paper

DOI: 10.1007/3-540-44399-1_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1952)
Cite this paper as:
Finger M., Vasconcelos W. (2000) Sharing Resource-Sensitive Knowledge Using Combinator Logics. In: Monard M.C., Sichman J.S. (eds) Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 1952. Springer, Berlin, Heidelberg


Research on ontologies has been pursued as a solution to the difficult problem of knowledge sharing. Ontologies consist of a do- main description which suits the needs of all systems to be integrated. Any agreed ontology, however, is not the end of the problems involved in knowledge sharing since how we represent knowledge is intimately linked to the inferences we expect to perform with it. Knowledge sharing can- not ignore the similarities and differences between the inference engines participating in the information exchange. We illustrate this issue via a case study on resource-sensitive knowledge-based systems and we show how these can efficiently share their knowledge using combinator logics.


Knowledge sharing resource-sensitive logics. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Marcelo Finger
    • 1
  • Wamberto Vasconcelos
    • 2
  1. 1.Instituto de Matemática e EstatísticaUniversidade de São PauloSão PauloBrazil
  2. 2.Institut für InformatikUniversität ZürichZürichSwitzerland

Personalised recommendations