Definite clause programs are canonical (over a suitable domain)

Howard A. Blair, Allen L. Brown

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

For each first-order language L with a nonempty Herbrand universe, we construct an algebra C interpreting the function symbols of L that is a model of the Clark equality theory with language L and is canonical in the sense that for every definite clause program P in the language L, TPC ↓ ω is the greatest fixed point of TPC. The universe of individuals in C is a quotient of the set of terms of L and is, a fortiori, countable if L is countable. If ℒ contains at least one function symbol of arity at least 2, then the graphs of partial recursive functions on C, suitably defined, are representable in a natural way as individuals in C.

Original languageEnglish (US)
Pages (from-to)1-19
Number of pages19
JournalAnnals of Mathematics and Artificial Intelligence
Volume1
Issue number1-4
DOIs
StatePublished - Sep 1 1990

Keywords

  • Clause programs
  • partial recursive functions
  • semantics

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Definite clause programs are canonical (over a suitable domain)'. Together they form a unique fingerprint.

  • Cite this