Generalized metrics and topology in logic programming semantics

Show simple item record

dc.contributor.advisor Seda, Tony en
dc.contributor.author Hitzler, Pascal
dc.date.accessioned 2019-05-30T14:24:58Z
dc.date.available 2019-05-30T14:24:58Z
dc.date.issued 2001
dc.date.submitted 2001
dc.identifier.citation Hitzler, P. 2001. Generalized metrics and topology in logic programming semantics. PhD Thesis, University College Cork. en
dc.identifier.endpage 159 en
dc.identifier.uri http://hdl.handle.net/10468/8001
dc.description.abstract 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 operators in most programming language paradigms satisfy its requirements. The use of negation in logic programming and non-monotonic reasoning, however, renders some semantic operators to be non-monotonic, hence discontinuous with respect to the Scott topology, and therefore invalidates the standard approach, so that alternative methods have to be sought. In this thesis, we investigate topological methods, including generalized metric fixed-point theorems, and their applicabil­ity to the analysis of semantic operators in logic programming and non-monotonic reasoning. In the first part of the thesis, we present weak versions of the Banach contrac­tion mapping theorem for single-valued and multivalued mappings, and investi­gate relationships between the underlying spaces. In the second part, we apply the obtained results to several semantic paradigms in logic programming and non-monotonic reasoning. These investigations will also lead to a clearer under­standing of some of the relationships between these semantic paradigms and of the general topological structures which underly the behaviour of the corresponding semantic operators. We will also obtain some results related to termination properties of normal logic programs, clarify some of the relationships between different semantic approaches in non-monotonic reasoning, and will establish some results concerning the conversion of logic programs into artificial neural networks. en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher University College Cork en
dc.rights © 2001, Pascal Hitzler. en
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/ en
dc.subject Metrics en
dc.subject Topology en
dc.subject Logic programming semantics en
dc.title Generalized metrics and topology in logic programming semantics en
dc.type Doctoral thesis en
dc.type.qualificationlevel Doctoral en
dc.type.qualificationname PhD en
dc.internal.availability Full text available en
dc.check.info Not applicable en
dc.description.version Accepted Version
dc.contributor.funder Enterprise Ireland en
dc.contributor.funder University College Cork en
dc.description.status Not peer reviewed en
dc.internal.school Mathematical Sciences en
dc.check.type No Embargo Required
dc.check.reason Not applicable en
dc.check.opt-out Not applicable en
dc.thesis.opt-out true
dc.check.embargoformat Embargo not applicable (If you have not submitted an e-thesis or do not want to request an embargo) en
dc.internal.conferring Spring 2001 en
dc.relation.project Enterprise Ireland (Grant SC/98/621) en
dc.relation.project University College Cork (Department of Mathematics) en


Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2001, Pascal Hitzler. Except where otherwise noted, this item's license is described as © 2001, Pascal Hitzler.
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement