Abstract
M. Van Emden (1986) has given an elegant fixpoint semantics for logic programs whose interpretations assign real numbers in the interval left bracket 0, 1 right bracket as truth values of ground atoms. However, negated atoms are not allowed to appear in the body of the rules of Van Emden's language. A language is proposed to overcome this lack and investigate the semantics of this language. Programs written in this language are called quantitative logic programs (QLPs). A decidable subset (called nice QLPs) of the class of QLPs is identified. It is shown that nice QLPs possess some interesting models called nice models, and that the least model of a nice QLP coincides with its least nice model. In addition, a resolution-like proof procedure is defined for a class of nice QLPs and soundness and weak completeness results are obtained.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 173-182 |
| Number of pages | 10 |
| ISBN (Print) | 0818607998 |
| State | Published - 1987 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Engineering