Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
KLM-Style Defeasible Reasoning for Datalog
In many problem domains, particularly those related to mathematics and philosophy, classical logic has enjoyed great success as a model of valid reasoning and discourse. For real-world reasoning tasks, however, an agent typically only has partial knowledge of its domain, and at most a statistical un...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Computer Science
2023
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613168099917824 |
|---|---|
| access_status_str | Open Access |
| author | Paterson-Jones, Guy |
| author2 | Meyer, Thomas |
| author_browse | Meyer, Thomas Paterson-Jones, Guy |
| author_facet | Meyer, Thomas Paterson-Jones, Guy |
| author_sort | Paterson-Jones, Guy |
| collection | Thesis |
| description | In many problem domains, particularly those related to mathematics and philosophy, classical logic has enjoyed great success as a model of valid reasoning and discourse. For real-world reasoning tasks, however, an agent typically only has partial knowledge of its domain, and at most a statistical understanding of relationships between properties. In this context, classical inference is considered overly restrictive, and many systems for non-monotonic reasoning have been proposed in the literature to deal with these tasks. A notable example is the Klm framework, which describes an agent's defeasible knowledge qualitatively in terms of conditionals of the form “if A, then typically B”. The goal of this research project is to investigate Klm-style semantics for defeasible reasoning over Datalog knowledge bases. Datalog is a declarative logic programming language, designed for querying large deductive databases. Syntactically, it can be viewed as a computationally feasible fragment of firstorder logic, so this continues a recent line of work in which the Klm framework is lifted to more expressive languages. |
| format | Thesis |
| id | oai:open.uct.ac.za:11427/37738 |
| institution | University of Cape Town (South Africa) |
| language | eng |
| last_indexed | 2026-06-10T12:31:50.330Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository |
| publishDate | 2023 |
| publishDateRange | 2023 |
| publishDateSort | 2023 |
| publisher | Department of Computer Science |
| publisherStr | Department of Computer Science |
| record_format | dspace |
| source_str | UCTD — University of Cape Town Open Access Repository |
| spelling | oai:open.uct.ac.za:11427/37738 KLM-Style Defeasible Reasoning for Datalog Paterson-Jones, Guy Meyer, Thomas Casini, Giovanni Computer Science In many problem domains, particularly those related to mathematics and philosophy, classical logic has enjoyed great success as a model of valid reasoning and discourse. For real-world reasoning tasks, however, an agent typically only has partial knowledge of its domain, and at most a statistical understanding of relationships between properties. In this context, classical inference is considered overly restrictive, and many systems for non-monotonic reasoning have been proposed in the literature to deal with these tasks. A notable example is the Klm framework, which describes an agent's defeasible knowledge qualitatively in terms of conditionals of the form “if A, then typically B”. The goal of this research project is to investigate Klm-style semantics for defeasible reasoning over Datalog knowledge bases. Datalog is a declarative logic programming language, designed for querying large deductive databases. Syntactically, it can be viewed as a computationally feasible fragment of firstorder logic, so this continues a recent line of work in which the Klm framework is lifted to more expressive languages. 2023-04-14T08:57:09Z 2023-04-14T08:57:09Z 2022 2023-04-14T07:45:39Z Master Thesis Masters MSc http://hdl.handle.net/11427/37738 eng application/pdf Department of Computer Science Faculty of Science |
| spellingShingle | Computer Science Paterson-Jones, Guy KLM-Style Defeasible Reasoning for Datalog |
| thesis_degree_str | Master's |
| title | KLM-Style Defeasible Reasoning for Datalog |
| title_full | KLM-Style Defeasible Reasoning for Datalog |
| title_fullStr | KLM-Style Defeasible Reasoning for Datalog |
| title_full_unstemmed | KLM-Style Defeasible Reasoning for Datalog |
| title_short | KLM-Style Defeasible Reasoning for Datalog |
| title_sort | klm style defeasible reasoning for datalog |
| topic | Computer Science |
| url | http://hdl.handle.net/11427/37738 |
| work_keys_str_mv | AT patersonjonesguy klmstyledefeasiblereasoningfordatalog |