Open Access. Powered by Scholars. Published by Universities.®
Science and Technology Studies Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Science and Technology Studies
Local Closed-World Reasoning With Description Logics Under The Well-Founded Semantics, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler
Local Closed-World Reasoning With Description Logics Under The Well-Founded Semantics, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler
Computer Science and Engineering Faculty Publications
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases (Motik and Rosati, 2010 [52]), and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based …
Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda
Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda
Computer Science and Engineering Faculty Publications
The introduction of negation into logic programming brings the benefit of enhanced syntax and expressibility, but creates some semantical problems. Specifically, certain operators which are monotonic in the absence of negation become non-monotonic when it is introduced, with the result that standard approaches to denotational semantics then become inapplicable. In this paper, we show how generalized metric spaces can be used to obtain fixed-point semantics for several classes of programs relative to the supported model semantics, and investigate relationships between the underlying spaces we employ. Our methods allow the analysis of classes of programs which include the acyclic, locally hierarchical, …
Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler
Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler
Computer Science and Engineering Faculty Publications
We consider rather general operators mapping valuations to (sets of) valuations in the context of the semantics of logic programming languages. This notion generalizes several of the standard operators encountered in this subject and is inspired by earlier work of M.C. Fitting. The fixed points of such operators play a fundamental role in logic programming semantics by providing standard models of logic programs and also in determining the computability properties of these standard models. We discuss some of our recent work employing topological ideas, in conjunction with order theory, to establish methods by which one can find the fixed points …
Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda
Unique Supported-Model Classes Of Logic Programs, Pascal Hitzler, Anthony K. Seda
Computer Science and Engineering Faculty Publications
We study classes of programs, herein called unique supported-model classes, with the property that each program in the class has a unique supported model. Elsewhere, the authors examined these classes from the point of view of operators defined relative to certain three-valued logics. In this paper, we complement our earlier results by considering how unique supported-model classes fit into the framework given by various classes of programs in several well-known approaches to semantics.
A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler
A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler
Computer Science and Engineering Faculty Publications
We present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators …
Abduction In Annotated Logic Programming, Krishnaprasad Thirunarayan
Abduction In Annotated Logic Programming, Krishnaprasad Thirunarayan
Kno.e.sis Publications
The author investigates techniques to make the logic programming paradigm more expressive for knowledge representation, while simultaneously retaining the computational advantages of efficiency and simplicity. He extends the annotated language of K. Thirunarayan and K. Kifer (1989) in various directions to obtain an enriched representation language. In particular, rule bodies are permitted to be a conjunction of literals, and the rules to be recursive. A class of annotated logic programs called the stratified programs is identified which can be given a unique supported minimal Herbrand model as their meaning. Abductive reasoning is integrated into this annotated logic framework. The notion …