Developing an inference engine for CR-Prolog with preferences
| dc.creator | Kolvekar, Loveleen | |
| dc.date.accessioned | 2016-11-14T23:08:36Z | |
| dc.date.available | 2011-02-18T23:04:52Z | |
| dc.date.available | 2016-11-14T23:08:36Z | |
| dc.date.issued | 2004-12 | |
| dc.description.abstract | In recent years, A-Prolog with answer set semantics was shown to be a useful tool for knowledge representation and reasoning. A-Prolog is a declarative language based on stable models of logic programs. It allows the encoding of defaults and various other types of knowledge contained in dynamic domains. It seems however that A-Prolog lacks the ability to gracefully perform the reasoning needed for certain types of conflict resolution, e.g. finding the best explanations of unexpected observations. To solve this problem CR-Prolog - an extension of A-Prolog by consistency restoring rules with preferences was introduced. The most intuitive solutions correspond to those models that best satisfy the preferences expressed, and minimize the application of cr-rules. The goal of this work is to develop an inference engine for computing the answer sets of CR-Prolog program automatically. The inference engine handles preferences efficiently. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/2346/19377 | en_US |
| dc.language.iso | eng | |
| dc.publisher | Texas Tech University | en_US |
| dc.rights.availability | Unrestricted. | |
| dc.subject | Computer algorithms | en_US |
| dc.subject | Declarative programming | en_US |
| dc.subject | Knowledge representation (Information theory) | en_US |
| dc.title | Developing an inference engine for CR-Prolog with preferences | |
| dc.type | Thesis |