A MULTI-VALUED LOGIC FOR PROGRAMMING
| dc.contributor.author | Cleary, John G. | eng |
| dc.date.accessioned | 2008-02-27T16:56:44Z | |
| dc.date.available | 2008-02-27T16:56:44Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1987-02-01 | eng |
| dc.description.abstract | A logic using three truth values (true, false, undefined) is described together with its Horn clause subset and a procedural interpretation. The resulting logic programming language allows clauses to affirm both positive and negative information and can test whether a goal is definitely false or is just not provably true (standard negation by failure) as well as other possibilities including whether it is unknown (cannot be proven either true or false). The major theoretical results characterizing classical logic programs can be carried over to this context, including the equivalence of a programs answer set with the minimal Herbrand universe and least fixed point semantics as well as the correctness and completeness of SLD-resolution. The logic can be easily implemented within existing Prolog interpreters. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1987-261-09 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30529 | |
| dc.identifier.uri | http://hdl.handle.net/1880/45823 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | A MULTI-VALUED LOGIC FOR PROGRAMMING | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |