Proof theory and semantics of logic programs

Haim Gaifman*, Ehud Shapiro

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

The authors develop a resolution logic that is based on direct proofs rather than on proofs by refutations. The deductive system studied has clauses as its formulas and resolution as the sole inference rule. They analyze this deductive system using a novel representation of resolution proofs, called resolution graphs, and obtain a general completeness theorem: a clause is a logical consequence of a set of clauses if and only if it is either tautological or subsumed by a clause derivable from that set. In a previous paper the authors developed a model-theoretic compositional semantics for logic programs and investigated the fully abstract equivalences induced by various notions of composition. They continue that study here using the proof theory of resolution logic. This proof theory gives rise to various semantics for logic programs that reflect more operational details than does the model-theoretic semantics.

Original languageEnglish
Title of host publicationProc Fourth Ann Symp Logic Comput Sci
Editors Anon
PublisherPubl by IEEE
Pages50-62
Number of pages13
ISBN (Print)0818619546
StatePublished - 1989
EventProceedings of the Fourth Annual Symposium on Logic in Computer Science - Pacific Grove, CA, USA
Duration: 5 Jun 19898 Jun 1989

Publication series

NameProc Fourth Ann Symp Logic Comput Sci

Conference

ConferenceProceedings of the Fourth Annual Symposium on Logic in Computer Science
CityPacific Grove, CA, USA
Period5/06/898/06/89

Fingerprint

Dive into the research topics of 'Proof theory and semantics of logic programs'. Together they form a unique fingerprint.

Cite this