Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Higher-order logic programming"”.

  1. Prοοf procedure for extensional higher-order logic programming

    We consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of …

    greece Repository record for Prοοf procedure for extensional higher-order logic programming (opens in a new tab)

  2. Semantics of negation in extensional higher-order logic programming

    … approaches to the semantics of positive higher-order logic programming, originally introduced by W. W. Wadge and M. Bezem respectively. The former approach uses classical domain-theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of …

    greece Repository record for Semantics of negation in extensional higher-order logic programming (opens in a new tab)

  3. Extensions of logic programming for preference representation

    … of preference representation using extensions of logic programming. The effective representation of preferences is crucial in many scientific disciplines and it can be proven useful in many real-world applications. Preference representation formalisms in the literature usually fall into two basic …

    greece Repository record for Extensions of logic programming for preference representation (opens in a new tab)