Guarded horn clauses

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Citations (Scopus)

Abstract

A set of Horn clauses, augmented with a ‘guard’ mechanism, is shown to be a simple and yet powerful parallel logic programming language.

Original languageEnglish
Title of host publicationLogic Programming '85 - Proceedings of the 4th Conference
PublisherSpringer-Verlag
Pages168-179
Number of pages12
ISBN (Print)9783540164791
DOIs
Publication statusPublished - 1986 Jan 1
Externally publishedYes
Event4th International Conference on Logic Programming, 1985 - Tokyo, Japan
Duration: 1985 Jul 11985 Jul 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume221 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Logic Programming, 1985
CountryJapan
CityTokyo
Period85/7/185/7/3

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Guarded horn clauses'. Together they form a unique fingerprint.

  • Cite this

    Ueda, K. (1986). Guarded horn clauses. In Logic Programming '85 - Proceedings of the 4th Conference (pp. 168-179). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 221 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-16479-0_17