Higher-order computational logic
This paper presents a case for the use of higher-order logic as a foundation for computational logic. A suitable polymorphically-typed, higher-order logic is introduced and its syntax and proof theory briefly described. In addition, a metric space of closed terms suitable for knowledge representation purposes is presented. The approach to representing individuals is illustrated with some examples, as is the technique of programming with abstractions. The paper concludes by placing the results...[Show more]
|Collections||ANU Research Publications|
|Book Title:||Computational Logic: Logic Programming and Beyond|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.