Extending Prolog with type inheritance and arithmetic

Simple item page
dc.contributor.authorChitale, Chandan S.en
dc.contributor.committeechairRoach, John W.en
dc.contributor.committeememberWatson, Layne T.en
dc.contributor.committeememberBixler, J. Patricken
dc.contributor.departmentComputer Science and Applicationsen
dc.date.accessioned2014-03-14T21:37:44Zen
dc.date.adate2012-06-10en
dc.date.available2014-03-14T21:37:44Zen
dc.date.issued1989-05-15en
dc.date.rdate2012-06-10en
dc.date.sdate2012-06-10en
dc.description.abstractProlog is a logic programming language based on first order logic. It uses resolution as a rule of inference, and unification is the heart of resolution. The unification algorithm is a syntactic process and hence attaches no meaning to function and predicate symbols. We incorporate arithmetic into unification by simultaneously solving linear equations that are created during the unification of partially instantiated numeric expressions. Prolog operates on the Herbrand universe, which is a single unstructured domain. In case of large structured domains, the number of resolution steps required for inference is large. We have incorporated type inheritance into Prolog to exploit large structured domains. Types are subuniverses corresponding to sets of objects. The subset of relation between types induces a hierarchy on the universe. Using the property of inheritance it is possible to obtain shorter proofs in inference. We used the constraint satisfaction model and the hierarchical constraint satisfaction concept to incorporate these extensions to Prolog. Thus, we succeeded in obtaining a logic programming language with arithmetic and type inheritance. This implementation extends standard Prolog and can be directly added to the WAM concept.en
dc.description.degreeMaster of Scienceen
dc.format.extentviii, 100 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-06102012-040442en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-06102012-040442/en
dc.identifier.urihttp://hdl.handle.net/10919/43082en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V855_1989.C536.pdfen
dc.relation.isformatofOCLC# 20347569en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V855 1989.C536en
dc.subject.lcshProlog (Computer program language)en
dc.titleExtending Prolog with type inheritance and arithmeticen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineComputer Science and Applicationsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V855_1989.C536.pdf
Size:
3.55 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Masters Theses