Type of Document Master's Thesis Author Chitale, Chandan S. URN etd-06102012-040442 Title Extending Prolog with type inheritance and arithmetic Degree Master of Science Department Computer Science and Applications Advisory Committee
Advisor Name Title Roach, John W. Committee Chair Bixler, J. Patrick Committee Member Watson, Layne T. Committee Member Keywords
- Prolog (Computer program language)
Date of Defense 1989-05-15 Availability restricted 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.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access LD5655.V855_1989.C536.pdf 3.71 Mb 00:17:11 00:08:50 00:07:44 00:03:52 00:00:19next to an author's name indicates that all files or directories associated with their ETD are accessible from the Virginia Tech campus network only.
If you have questions or technical problems, please Contact DLA.