Algebraic foundations of logic programming, I. The distributive lattice of logic programs

A. Hirani*, V. S. Subrahmanian

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Given a logic program P, the operator Tp associated with P is closely related to the intended meaning of P. Given a first order language L that is generated by finitely many non-logical symbols, our aim is to study the algebraic properties of the set {Tp|P is a general logic program in language L} with certain operators on it. For the operators defined in this paper the resulting algebraic structure is a bounded distributive lattice. Our study extends (to the case of general logic programs), the work of P. Mancarella and D. Pedreschi who initiated a study of the algebraic properties of the space of pure logic programs. We study the algebraic properties of this set and identify the ideals and zero divisors. In addition, we prove that our algebra satisfies various non-extensibility conditions.

Original languageEnglish (US)
Pages (from-to)317-332
Number of pages16
JournalFundamenta Mathematicae
Volume13
Issue number3
StatePublished - Sep 1990
Externally publishedYes

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint

Dive into the research topics of 'Algebraic foundations of logic programming, I. The distributive lattice of logic programs'. Together they form a unique fingerprint.

Cite this