Pseudo-Boolean valued prolog |
| |
| Authors: | Melvin Fitting |
| |
| Affiliation: | (1) Department of Mathematics and Computer Science, Herbert H. Lehman College (CUNY), 10468 Bronx, New York |
| |
| 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.Research supported by PSC-CUNY Grants 666396, 667295 and NSF Grant CCR-8702307. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
