dc.contributor.advisor |
Labuschagne, Willem
|
|
dc.contributor.author |
Halland, Kenneth John
|
|
dc.date.accessioned |
2015-01-23T04:24:46Z |
|
dc.date.available |
2015-01-23T04:24:46Z |
|
dc.date.issued |
1994-08 |
en |
dc.identifier.citation |
Halland, Kenneth John (1994) Circumscriptive reasoning, University of South Africa, Pretoria, <http://hdl.handle.net/10500/16899> |
en |
dc.identifier.uri |
http://hdl.handle.net/10500/16899 |
|
dc.description.abstract |
We show how the non-monotonic nature of common-sense reasoning can be formalised by
circumscription. Various forms of circumscription are discussed. A new form of circumscription,
namely naive circumscription, is introduced in order to facilitate the comparison of the various
forms. Finally, some issues connected with the automation of circumscriptive reasoning are
examined. |
en |
dc.format.extent |
1 online resource (v, 87 leaves) |
en |
dc.language.iso |
en |
|
dc.subject |
Circumscription |
en |
dc.subject |
Common-sense reasoning |
en |
dc.subject |
Non-monotonic logic |
en |
dc.subject |
Models |
en |
dc.subject |
Satisfiability |
en |
dc.subject |
Soundness |
en |
dc.subject |
Completeness |
en |
dc.subject |
Minimal models |
en |
dc.subject |
Scope |
en |
dc.subject |
Theorem-proving algorithms |
en |
dc.subject.ddc |
004.015113 |
|
dc.subject.lcsh |
Logic, Symbolic and mathematical |
en |
dc.title |
Circumscriptive reasoning |
en |
dc.type |
Dissertation |
|
dc.description.department |
Computing |
|
dc.description.degree |
M. Sc. (Computer Science) |
|