A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
We suggest a general logical formalism for Logic Programming based on a four-valued inference. We show that it forms a proper setting for representing logic programs with negation as failure of a most general kind and for describing logics and semantics that characterize their behavior. In this way...
Saved in:
| Published in: | The journal of logic programming Vol. 35; no. 2; pp. 151 - 170 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.05.1998
|
| Subjects: | |
| ISSN: | 0743-1066, 1873-5789 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!