Advanced search

Comparative semantics of mu-log

Author
Organization
Abstract
The paper aims at a semantic study of the integration of blackboards in logic programming. To that end, a new logic programming framework involving Linda-like primitives is proposed first. It is dedicated to no particular logic language but rather focuses on the key concepts and control operators. As natural consequences, it subsumes existing concrete proposals ([2, 4, 5]) and provides a general framework well-suited for their semantic analysis. Five semantics are described and compared. They range in the operational, declarative and denotational types and are issued both from the logic programming and the imperative traditions. They are composed of two operational semantics, describing respectively the success/failure sets, and various failures, of two declarative semantics, extending the classical Herbrand interpretation and immediate consequence operator, and of one denotational semantics, defined compositionally and on the basis of process-like histories. The mathematical tools mainly used are complete lattices and complete metric spaces.
Keywords
CONCURRENCY

Citation

Please use this url to cite or link to this publication:

Chicago
De Bosschere, Koen, and JM JACQUET. 1992. “Comparative Semantics of Mu-log.” Lecture Notes in Computer Science 605: 911–926.
APA
De Bosschere, K., & JACQUET, J. (1992). Comparative semantics of mu-log. LECTURE NOTES IN COMPUTER SCIENCE, 605, 911–926.
Vancouver
1.
De Bosschere K, JACQUET J. Comparative semantics of mu-log. LECTURE NOTES IN COMPUTER SCIENCE. New York, NY, USA: Springer; 1992;605:911–26.
MLA
De Bosschere, Koen, and JM JACQUET. “Comparative Semantics of Mu-log.” LECTURE NOTES IN COMPUTER SCIENCE 605 (1992): 911–926. Print.
@article{202132,
  abstract     = {The paper aims at a semantic study of the integration of blackboards in logic programming. To that end, a new logic programming framework involving Linda-like primitives is proposed first. It is dedicated to no particular logic language but rather focuses on the key concepts and control operators. As natural consequences, it subsumes existing concrete proposals ([2, 4, 5]) and provides a general framework well-suited for their semantic analysis.
Five semantics are described and compared. They range in the operational, declarative and denotational types and are issued both from the logic programming and the imperative traditions. They are composed of two operational semantics, describing respectively the success/failure sets, and various failures, of two declarative semantics, extending the classical Herbrand interpretation and immediate consequence operator, and of one denotational semantics, defined compositionally and on the basis of process-like histories. The mathematical tools mainly used are complete lattices and complete metric spaces.},
  author       = {De Bosschere, Koen and JACQUET, JM},
  issn         = {0302-9743},
  journal      = {LECTURE NOTES IN COMPUTER SCIENCE},
  keyword      = {CONCURRENCY},
  language     = {eng},
  pages        = {911--926},
  publisher    = {Springer},
  title        = {Comparative semantics of mu-log},
  volume       = {605},
  year         = {1992},
}