FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2218442880> ?p ?o ?g. }

• W2218442880 abstract "This thesis describes work on how Logic Programming (LP) can be used in various knowledge intensive applications. The contributions described in the thesis include algorithms and tools for efficient Description Logics reasoning, semantic comparison of source programs and semi-automated creation of metainformation. The link between these results is that (1) they all introduce novel semantic technologies, (2) they apply logic programming techniques in general and the Prolog LP language in particular, and (3) they have been actually implemented in the form of various applications. Semantic technologies form the basis of building software systems that work with the meaning of various kinds of information rather than with their textual form. The main idea is to reason about some sort of knowledge represented in a machine processable way. The most important parts of this process are knowledge representation and knowledge management. The dissertation deals with two groups of knowledge representation and management technologies: Logic Programming and Description Logic systems. Combination of these approaches creates interesting challenges: the idea of the so-called Description Logic Programming has been introduced in 2003. Several results in the present dissertation contribute to this area of semantic technologies. In the context of Description Logics we have addressed two issues. The first issue is about how to efficiently reason on Description Logic knowledge bases when huge amounts of data are present. We have created the theoretical basis of a new Description Logic reasoning system, called DLog, that transforms description logic axioms into a Prolog program. This transformation is done independently from the individuals: they are accessed dynamically during the Prolog execution of the generated program. For this we have created several algorithms and proved their useful properties. As a result, with our implementation, we reached better scalability and more efficient execution compared to that of the earlier approaches. The second issue addresses the question of how to use conceptual models for information integration. We have created a transformation framework together with a modelling methodology that uses Prolog for querying conceptual models formulated in Description Logics. Here we apply the closed world assumption as we argue it fits the context of information integration better. We demonstrate this approach by applying it for the SINTAGMA information integration system. The thesis also discusses two use cases that present the viability of Logic Programming for knowledge intensive applications. First, we deal with the issue of how to detect plagiarism between source programs. We have designed and implemented Match, a generic plagiarism detection framework that aims at the semantic comparison of source programs. The idea is to transform the source code into mathematical objects, use appropriate reduction and comparison methods on these, and interpret the results appropriately. We have been using the Prolog implementation of the system at the Budapest University of Technology and Economics to successfully detect plagiarism in homework assignments for the past eight years. Finally, we investigate the question of how to deduce meta-information in systems working with various kinds of documents. We have developed the SREngine framework, which manages a pool of generic objects together with their properties and supports Prolog based reasoning on these. The idea is to infer new properties about the objects, using their existing properties and a set of user-defined rules. These rules are given in a special logic based language developed for SREngine." @default.
• W2218442880 created "2016-06-24" @default.
• W2218442880 creator A5075411705 @default.
• W2218442880 date "2008-01-01" @default.
• W2218442880 modified "2023-09-26" @default.
• W2218442880 title "Semantic technologies based on logic programming" @default.
• W2218442880 cites W110365008 @default.
• W2218442880 cites W121805954 @default.
• W2218442880 cites W128216664 @default.
• W2218442880 cites W136900661 @default.
• W2218442880 cites W1481314305 @default.
• W2218442880 cites W1485157689 @default.
• W2218442880 cites W1488560674 @default.
• W2218442880 cites W1492864441 @default.
• W2218442880 cites W1494700156 @default.
• W2218442880 cites W1496748331 @default.
• W2218442880 cites W1498342057 @default.
• W2218442880 cites W1500465756 @default.
• W2218442880 cites W1501303547 @default.
• W2218442880 cites W1502939043 @default.
• W2218442880 cites W1509428113 @default.
• W2218442880 cites W1517066375 @default.
• W2218442880 cites W1524698412 @default.
• W2218442880 cites W1535689809 @default.
• W2218442880 cites W1536525036 @default.
• W2218442880 cites W1542598926 @default.
• W2218442880 cites W1548946286 @default.
• W2218442880 cites W1555563750 @default.
• W2218442880 cites W1556019018 @default.
• W2218442880 cites W1562643504 @default.
• W2218442880 cites W1569431591 @default.
• W2218442880 cites W1577783107 @default.
• W2218442880 cites W1582149310 @default.
• W2218442880 cites W1586338668 @default.
• W2218442880 cites W1592362490 @default.
• W2218442880 cites W160945464 @default.
• W2218442880 cites W1609673577 @default.
• W2218442880 cites W1647671624 @default.
• W2218442880 cites W1662211127 @default.
• W2218442880 cites W1672891595 @default.
• W2218442880 cites W1683212044 @default.
• W2218442880 cites W168901028 @default.
• W2218442880 cites W170090413 @default.
• W2218442880 cites W1814970918 @default.
• W2218442880 cites W1911479129 @default.
• W2218442880 cites W1913178520 @default.
• W2218442880 cites W193925929 @default.
• W2218442880 cites W1964962870 @default.
• W2218442880 cites W1965105913 @default.
• W2218442880 cites W1965377774 @default.
• W2218442880 cites W1971922616 @default.
• W2218442880 cites W1978465163 @default.
• W2218442880 cites W1999997889 @default.
• W2218442880 cites W2006803276 @default.
• W2218442880 cites W2020273705 @default.
• W2218442880 cites W2021473914 @default.
• W2218442880 cites W2026024229 @default.
• W2218442880 cites W2054628190 @default.
• W2218442880 cites W2054879965 @default.
• W2218442880 cites W2057947069 @default.
• W2218442880 cites W2067145567 @default.
• W2218442880 cites W2068472240 @default.
• W2218442880 cites W2073265902 @default.
• W2218442880 cites W2082976889 @default.
• W2218442880 cites W2085609918 @default.
• W2218442880 cites W2096282892 @default.
• W2218442880 cites W2097089247 @default.
• W2218442880 cites W2097366413 @default.
• W2218442880 cites W2099677422 @default.
• W2218442880 cites W2106487114 @default.
• W2218442880 cites W2107068745 @default.
• W2218442880 cites W2108911687 @default.
• W2218442880 cites W2111295912 @default.
• W2218442880 cites W2111977969 @default.
• W2218442880 cites W2118699275 @default.
• W2218442880 cites W2120702558 @default.
• W2218442880 cites W2136465704 @default.
• W2218442880 cites W2141550942 @default.
• W2218442880 cites W2145009222 @default.
• W2218442880 cites W2146754843 @default.
• W2218442880 cites W2149684865 @default.
• W2218442880 cites W2152888402 @default.
• W2218442880 cites W2154829072 @default.
• W2218442880 cites W2162744351 @default.
• W2218442880 cites W2167257481 @default.
• W2218442880 cites W2169606199 @default.
• W2218442880 cites W2172549414 @default.
• W2218442880 cites W2295882966 @default.
• W2218442880 cites W2405319418 @default.
• W2218442880 cites W2473419855 @default.
• W2218442880 cites W2612884777 @default.
• W2218442880 cites W272607959 @default.
• W2218442880 cites W2780912412 @default.
• W2218442880 cites W2911326119 @default.
• W2218442880 cites W2949601 @default.
• W2218442880 cites W2952727465 @default.
• W2218442880 cites W3022516193 @default.
• W2218442880 cites W3132061357 @default.
• W2218442880 cites W613767338 @default.
• W2218442880 cites W79785652 @default.

• next