Pseudo-Boolean valued prolog
Studia Logica 47 (2):85 - 91 (1988)
| Abstract | 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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesHirokazu Nishimura (1991). Boolean Valued Lie Algebras. Journal of Symbolic Logic 56 (2):731-741.
Helena Rasiowa (1994). Axiomatization and Completeness of Uncountably Valued Approximation Logic. Studia Logica 53 (1):137 - 160.
Philip G. Calabrese (2005). Toward a More Natural Expression of Quantum Logic with Boolean Fractions. Journal of Philosophical Logic 34 (4):363 - 401.
Luiz Monteiro, Sonia Savini & Julio Sewald (1991). Construction of Monadic Three-Valued Łukasiewicz Algebras. Studia Logica 50 (3-4):473 - 483.
Lars Hansen (2005). On an Algebra of Lattice-Valued Logic. Journal of Symbolic Logic 70 (1):282 - 318.
Nicola Olivetti & Lea Terracini (1992). N-Prolog and Equivalence of Logic Programs. Journal of Logic, Language and Information 1 (4).
I. Janioka-Żuk (1980). Finite Axiomatization for Some Intermediate Logics. Studia Logica 39 (4):415 - 423.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,628 of 549,518 )Recent downloads (6 months)1 ( #63,397 of 549,518 )How can I increase my downloads? |
My notes
Discussion
