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)
 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: 9,351
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA
    Citations of this work BETA

    No citations found.

    Similar books and articles

    Monthly downloads

    Added to index


    Total downloads

    2 ( #257,981 of 1,088,370 )

    Recent downloads (6 months)

    1 ( #69,449 of 1,088,370 )

    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.