ACM Home Page
Please provide us with feedback. Feedback
The Semantics of Predicate Logic as a Programming Language
Full text PdfPdf (654 KB)
Source Journal of the ACM (JACM) archive
Volume 23 ,  Issue 4  (October 1976) table of contents
Pages: 733 - 742  
Year of Publication: 1976
ISSN:0004-5411
Authors
M. H. Van Emden  Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
R. A. Kowalski  Department of Computation & Control, Imperial College, 180 Queens Gate, London SW7, United Kingdom
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 92,   Citation Count: 190
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321978.321991
What is a DOI?

ABSTRACT

Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BEKIt~, H Definable operations m general algebra, and the theory of automata and flow charts IBM Res Rep , Vienna, 1971
 
2
BLEDSOE, W W Splitting and reduction heuristics in automatic theorem proving Arttf Intel 2 (1971), 55-77
 
3
BURSTALL, R M Formal description of program structure and semantics in first order toglc. In Machme Intelhgence 5, B Meltzer and D Mtchie, Eds , Edinburgh U Press, Edinburgh, 1969, pp 79-98
 
4
CrluRCri, A lntroducuon to Mathemaucal Logic, Vol 1 Princeton U Press, Princeton, N J , 1956
 
5
COLMEP, AUWR, A, KANOUI, H , PASERO, R., AND ROUSSEL, P. Un syst~me de communlcatton hommemachine en franqais. Groupe d'Intelhgence Artlficlelle, U E R de Lummy, Umverslt6 d'Aix-Marsedle, Lummy, 1972
 
6
DE BAKKER, J W Recursive procedures Tract No 24, Mathematical Centre, Amsterdam, 1971
 
7
DE BAKKER, J W, AND DE ROEVER, W P A calculus of recursive program schemes. In Automata, Languages and Programmmg, M Nlvat, Ed , North*Holland Pub Co , Amsterdam, 1973, pp 167- 196
 
8
ERNST, G W The utility of independent subgoals tn theorem proving Inform Contr 18, 3 (April 1971), 237-252
 
9
KANOUI, H Application de la d6monstration automatlque aux manipulations algebnques et ~ l'mt6gration formelle sur ordmateur Groupe d'Intelhgence Artlficmlle, U E R de Lummy, Umverslt6 d'Aix- Marsellle, Lummy, 1973.
 
10
KOWALSKI, R Predicate logic as programming language Proc IFIP Cong 1974, North-Holland Pub Co , Amsterdam, 1974, pp 569-574
 
11
KOWALSKI, R Logic for problem-solvmg DCL Memo 75, Dep Artificial Intelligence, U. of Edinburgh, Edmburgh, 1974
 
12
KOWALSKI, R , AND KUEHNER, D Lmear resolution with selection function Amf lntel 2 (1971), 227- 260
13
14
15
 
16
 
17
PARK, D F,xpomt mductton and proofs of program properties In Machme lntelhgence 5, B Meltzer and D Mlchie, Eds, Edmburgh U Press, Edmburgh, 1969, pp 59-78
 
18
PAS~RO, R. Repr6sentat~on du fran~a~s en loglque du premier ordre en vue de dlaloguer avec un ordmateur Group d'Intelhgence Artlflclelle, U.E R de Lummy, Umvers~t6 d'A,x-Marsedle, Lummy, 1973.
19
20
 
21
ROBINSON,J A Automatic deduction with hyper-resolut,on lnt J Comptr Math 1 (1965), 227-234
 
22
SCOTT, D Outhne of a mathematical theory of computation Tech Monog PRG-2, Comptg Lab, Oxford U , Oxford, England
 
23
SLA~tE, J R , Argo KONtVER, P Finding resolution graphs and using duphcate goals m AND/OR trees Inform Sct 3 (1971),315-342
 
24
WARnEN, D H D WARPLAN A system for generattng plans DCL Memo 76, Dep. of Art,fic,al Intelhgence, U of Edinburgh, Edinburgh, 1974

CITED BY  190

Collaborative Colleagues:
M. H. Van Emden: colleagues
R. A. Kowalski: colleagues