TY - CONF
T1 - Flexible Bootstrapping-Based Ontology Alignment
Y1 - 2010
A1 - Prateek Jain
A1 - Pascal Hitzler
A1 - Amit Sheth
KW - Ontology Matching and Wikipedia and BLOOMS and Plug-n-Play Ontology Matching System
AB - BLOOMS (Jain et al, ISWC2010) is an ontology alignment system which, in its core, utilizes the Wikipedia category hierarchy for establishing alignments. In this paper, we present a Plug-and-Play extension to BLOOMS, which allows to flexibly replace or complement the use of Wikipedia by other online or offline resources, including domain-specific ontologies or taxonomies. By making use of automated translation services and of Wikipedia in languages other than English, it makes it possible to apply BLOOMS to alignment tasks where the input ontologies are written in different languages.
PB - The Fifth International Workshop on Ontology Matching collocated with the 9th International Semantic Web Conference ISWC-2010, November 7, 2010
ER -
TY - BOOK
T1 - Foundations of Semantic Web Technologies
Y1 - 2010
A1 - Pascal Hitzler
A1 - Markus Krotzsch
A1 - Sebastian Rudolph
KW - foundations of semantic web
KW - foundations of semantic web technologies
ER -
TY - JOUR
T1 - Facets of Artificial General Intelligence
JF - Kunstliche Intelligenz
Y1 - 2009
A1 - Kai-Uwe Kuhnberger
A1 - Pascal Hitzler
AB - We argue that time has come for a serious endeavor to work towards artificial general intelligence (AGI). This positive assessment of the very possibility of AGI has partially its roots in the development of new methodological achievements in the AI area, like new learning paradigms and new integration techniques for different methodologies. The article sketches some of these methods as prototypical examples for approaches towards AGI.
ER -
TY - BOOK
T1 - Foundations of Semantic Web Technologies
Y1 - 2009
A1 - Sebastian Rudolph
A1 - Markus Krotzsch
A1 - Pascal Hitzler
ER -
TY - CONF
T1 - A Forgetting-based Approach for Handling Inconsistency in Distributed Ontologies
Y1 - 2008
A1 - Guilin Qi
A1 - Yimin Wang
A1 - Peter Haase
A1 - Pascal Hitzler
AB - In the context of multiple distributed ontologies, we are often confronted with the problem of dealing with inconsistency. In this paper, we propose an approach for reasoning with inconsistent distributed ontologies based on *concept forgetting*.We firstly define *concept forgetting* in description logics.We then adapt the notions of recoveries and preferred recoveries in propositional logic to description logics. Two consequence relations are then defined based on the preferred recoveries.
PB - 5th European Semantic Web Conference, ESWC08
ER -
TY - CONF
T1 - Foundations of Refinement Operators for Description Logics
T2 - 17th International Conference, ILP 2007
Y1 - 2007
A1 - Jens Lehmann
A1 - Pascal Hitzler
AB - In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should have. In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. We also show which combinations of desirable properties are theoretically possible, thus providing an important step towards the definition of practically applicable operators.
JA - 17th International Conference, ILP 2007
CY - Corvallis, OR, USA
ER -
TY - CONF
T1 - A Fully Connectionist Model Generator for Covered First-Order Logic Programs
T2 - Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07
Y1 - 2007
A1 - Sebastian Bader
A1 - Steffen Holldobler
A1 - Andreas Witzel
A1 - Pascal Hitzler
AB - We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples, we embed the associated semantic operator into a feed-forward network and train the network using the examples. This results in the learning of first-order knowledge while damaged or noisy data is handled gracefully.
JA - Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07
CY - Hyderabad, India
ER -
TY - CONF
T1 - Faster OWL Using Split Programs
Y1 - 2005
A1 - Denny Vrandecic
A1 - Pascal Hitzler
AB - Knowledge representation and reasoning on the Semantic Web is done by means of ontologies. While the quest for suitable ontology languages is still ongoing, OWL [5] has been established as a core standard. It comes in three flavours, as OWL Full, OWL DL and OWL Lite, where OWL Full contains OWL DL, which in turn contains OWL Lite. The latter two coincide semantically with certain description logics and can thus be considered fragments of first-order predicate logic.
ER -
TY - CONF
T1 - Formal Concept Analysis and Resolution in Algebraic Domains
T2 - ICCS 2003
Y1 - 2003
A1 - Matthias Wendt
A1 - Pascal Hitzler
AB - We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.
JA - ICCS 2003
CY - Shaker Verlag, Aachen
ER -
TY - ABST
T1 - Formal Concept Analysis and Resolution on Algebraic Domains - Preliminary Report
Y1 - 2003
A1 - Matthias Wendt
A1 - Pascal Hitzler
AB - We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.
ER -
TY - CHAP
T1 - The Fixed-Point Theorems of Priess-Crampe and Ribenboim in Logic Programming
Y1 - 2002
A1 - Anthony K. Seda
A1 - Pascal Hitzler
ER -
TY - CHAP
T1 - Fixpunktsemantik
Y1 - 1997
A1 - M. Grimm
A1 - G. Kalmbach
A1 - Pascal Hitzler
ER -