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 “"Negation in logic programming"”.

  1. Generalized metrics and topology in logic programming semantics

    Many fixed-point theorems are essentially topological in nature. Among them are the Banach contraction mapping theorem on metric spaces and the fixed­-point theorem for Scott-continuous mappings on complete partial orders. The latter theorem is fundamental in denotational semantics since semantic …

    cork Repository record for Generalized metrics and topology in logic programming semantics (opens in a new tab)

  2. Εφαρμογή της θεωρίας του λογικού προγραμματισμου στη σημασιολογία των μη-μονοτονικών τυπικών γραμματικών

    Boolean grammars [A. Okhotin, Information and Computation 194(1) (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation in rule bodies. In this dissertation we give the first proper mathematical treatment of the semantics of Boolean grammars, i.e. a …

    greece Repository record for Εφαρμογή της θεωρίας του λογικού προγραμματισμου στη σημασιολογία των μη-μονοτονικών τυπικών γραμματικών (opens in a new tab)

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

    We consider the two existing extensional 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 …

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