An algebraic approach to the unification problem of logic programming

By: Call Number: AIT RSPR no. CA-85-09 Contributor(s): Material type: SeriesSeries: Asian Institute of Technology. Research studies project report ; no. CA-85-09Publication details: Bangkok : Asian Institute of Technology, 1985Description: 42 pSubject(s): Online resources: Dissertation note: Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1985 Summary: This study formulates the unification problem of logic programming as an algebraic problem in which the minimal solution has to be found to satisfy a system of equations with variables ranging over a power set . Conditions for the solution to exist are examined and a procedure to obtain it is developed.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
20-AIT Publication Asian Institute of Technology Library AIT Publications AIT RSPR no. CA-85-09 (Browse shelf(Opens below)) 1 Available 30050003120432
20-AIT Publication Asian Institute of Technology Library AIT Publications AIT RSPR no. CA-85-09 (Browse shelf(Opens below)) 2 Available 30050003120424
40-Archives Asian Institute of Technology Library Archives AIT RSPR no. CA-85-09 (Browse shelf(Opens below)) Available 30050160005186
21 Asian Institute of Technology Library Archives AIT RSPR no. CA-85-09 (Browse shelf(Opens below)) 3 Available 30050120931026
21 Asian Institute of Technology Library Archives AIT RSPR no. CA-85-09 (Browse shelf(Opens below)) 4 Available 30050120930945

A Research Study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology

Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1985

This study formulates the unification problem of logic programming as an algebraic problem in which the minimal solution has to be found to satisfy a system of equations with variables ranging over a power set . Conditions for the solution to exist are examined and a procedure to obtain it is developed.

There are no comments on this title.

to post a comment.
คัดลอกแล้ว!