Pseudo-Boolean valued prolog

Studia Logica 47 (2):85 - 91 (1988)
A generalization of conventional Horn clause logic programming is proposed in which the space of truth values is a pseudo-Boolean or Heyting algebra, whose members may be thought of as evidences for propositions. A minimal model and an operational semantics is presented, and their equivalence is proved, thus generalizing the classic work of Van Emden and Kowalski.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370283
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,974
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

8 ( #267,637 of 1,725,860 )

Recent downloads (6 months)

4 ( #166,958 of 1,725,860 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.