Claudia Schon

Claudia Schon
Universität Koblenz-Landau · Department of Computer Science

Dr. rer. nat.

About

40
Publications
4,692
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
291
Citations
Introduction
Claudia Schon currently works at the Institute for Web Science and Technologies at the Universität of Koblenz.

Publications

Publications (40)
Preprint
Selection strategies are broadly used in first-order logic theorem proving to select those parts of a large knowledge base that are necessary to proof a theorem at hand. Usually, these selection strategies do not take the meaning of symbol names into account. In knowledge bases with commonsense knowledge, symbol names are usually chosen to have a m...
Preprint
Full-text available
The human capability to reason about one domain by using knowledge of other domains has been researched for more than 50 years, but models that are formally sound and predict cognitive process are sparse. We propose a formally sound method that models associative reasoning by adapting logical reasoning mechanisms. In particular it is shown that the...
Chapter
Negation is both an operation in formal logic and in natural language by which a proposition is replaced by one stating the opposite, as by the addition of “not” or another negation cue. Treating negation in an adequate way is required for cognitive reasoning, which aims at modeling the human ability to draw meaningful conclusions despite incomplet...
Preprint
Full-text available
Negation is both an operation in formal logic and in natural language by which a proposition is replaced by one stating the opposite, as by the addition of "not" or another negation cue. Treating negation in an adequate way is required for cognitive reasoning, which comprises commonsense reasoning and text comprehension. One task of cognitive reaso...
Conference Paper
In this paper we study the problem of concept contraction for the description logic EL. Concept contraction is concerned with the following question: Given two concepts C and D (with the interesting case being that D subsumes C) how can we find a generalisation of C that is not subsumed by D but is otherwise as similar as possible to C? We take an...
Preprint
This paper aims at demonstrating how a first-order logic reasoning system in combination with a large knowledge base can be understood as an artificial consciousness system. For this we review some aspects from the area of philosophy of mind and in particular Baars' Global Workspace Theory. This will be applied to the reasoning system Hyper with Co...
Preprint
Full-text available
The CoRg system is a system to solve commonsense reasoning problems. The core of the CoRg system is the automated theorem prover Hyper that is fed with large amounts of background knowledge. This background knowledge plays a crucial role in solving commonsense reasoning problems. In this paper we present different ways to use knowledge graphs as ba...
Article
Full-text available
The CoRg system is a system to solve commonsense reasoning problems. The core of the CoRg system is the automated theorem prover Hyper that is fed with large amounts of background knowledge. This background knowledge plays a crucial role in solving commonsense reasoning problems. In this paper we present different ways to use knowledge graphs as ba...
Chapter
It is a strength of graph-based data formats, like RDF, that they are very flexible with representing data. To avoid run-time errors, program code that processes highly-flexible data representations exhibits the difficulty that it must always include the most general case, in which attributes might be set-valued or possibly not available. The Shape...
Chapter
First-order theorem proving with large knowledge bases makes it necessary to select those parts of the knowledge base, that are necessary to prove the theorem at hand. We extend syntactic axiom selection procedures like SInE to use semantics of symbol names. For this, not only occurrences of symbol names but also semantically similar names are take...
Chapter
Commonsense reasoning is a difficult task for a computer to handle. Current algorithms score around 80% on benchmarks. Usually these approaches use machine learning which lacks explainability, however. Therefore, we propose a combination with automated theorem proving here. Automated theorem proving allows us to derive new knowledge in an explainab...
Article
The term cognitive computing refers to new hardware and/or software that mimics the functioning of the human brain. In the context of question answering and commonsense reasoning this means that the reasoning process of humans shall be modeled by adequate technical means. However, since humans do not follow the rules of classical logic, a system de...
Preprint
Full-text available
It is a strength of graph-based data formats, like RDF, that they are very flexible with representing data. To avoid run-time errors, program code that processes highly-flexible data representations exhibits the difficulty that it must always include the most general case, in which attributes might be set-valued or possibly not available. The Shape...
Article
Full-text available
Vast amounts of information and knowledge is produced and stored within product design projects. Especially for reuse and adaptation there exists no suitable method for product designers to handle this information overload. Due to this, the selection of relevant information in a specific development situation is time-consuming and inefficient. To t...
Article
The adjective cognitive especially in conjunction with the word computing seems to be a trendy buzzword in the artificial intelligence community and beyond nowadays. However, the term is often used without explicit definition. Therefore we start with a brief review of the notion and define what we mean by cognitive reasoning. It shall refer to mode...
Chapter
Full-text available
Current trends, like digital transformation and ubiquitous computing, yield in massive increase in available data and information. In artificial intelligence (AI) systems, capacity of knowledge bases is limited due to computational complexity of many inference algorithms. Consequently, continuously sampling information and unfiltered storing in kno...
Conference Paper
Full-text available
The area of commonsense reasoning aims at the creation of systems able to simulate the human way of rational thinking. This paper describes the use of automated reasoning methods for tackling commonsense reasoning benchmarks. For this we use a benchmark suite introduced in literature. Our goal is to use general purpose background knowledge without...
Conference Paper
This paper discusses the use of first order automated reasoning in question answering and cognitive computing. For this the natural language question answering project LogAnswer is briefly depicted and the challenges faced therein are addressed. This includes a treatment of query relaxation, web-services, large knowledge bases and co-operative answ...
Article
Full-text available
Higher-level cognition includes logical reasoning and the ability of question answering with common sense. Our RatioLog project addresses the problem of rational reasoning in deep question answering by methods from automated deduction and cognitive computing. In a first phase, we combine techniques from information retrieval and machine learning to...
Article
Full-text available
Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are considered for different application domains like argumentation theory, legal reasoning, and acts in multi-agent systems. In this paper, we show how standard deontic logic can be used to model ethical codes for multi-agent system...
Conference Paper
Full-text available
Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are discussed for different application domains like argumentation theory, legal reasoning, and acts in multi-agent systems. In this paper, we show how standard deontic logic can be stepwise transformed into description logic and DL-...
Article
Full-text available
This paper briefly characterizes the field of cognitive computing. As an exemplification, the field of natural language question answering is introduced together with its specific challenges. A possibility to master these challenges is illustrated by a detailed presentation of the LogAnswer system, which is a successful representative of the field...
Article
This paper presents a method for the evolution of SHI ABoxes which is based on a compilation technique of the knowledge base. For this the ABox is regarded as an interpretation of the TBox which is close to a model. It is shown, that the ABox can be used for a semantically guided transformation resulting in an equisatisfiable knowledge base. We use...
Article
Full-text available
Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppresion task are discussed in detail. Different versions of modelling norms with deontic logic are introduced and in the case of the Wason selection task it is demonstrated how differences in the preformance of humans in the abstract...
Conference Paper
This paper presents a method for the evolution of \(\mathcal{SHI}\) ABoxes which is based on a compilation technique of the knowledge base. For this the ABox is regarded as an interpretation of the TBox which is close to a model. It is shown, that the ABox can be used for a semantically guided transformation resulting in an equisatisfiable knowledg...
Conference Paper
Formal ontologies may go beyond first-order logic (FOL) in their expressivity, hindering the usage of common automated theorem provers (ATP) for ontology reasoning. The Unique Name Assumption (UNA) is an extension to FOL that is valuable for ontology specification, allowing the definition of distinct objects. Likewise, the Description Logic \(\math...
Article
Full-text available
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ((11),(6)), for which queries can be answered efficiently. This precompilation st ep is very expensive but it only has to be performed once. We propose to ap- ply this technique to knowledge...
Conference Paper
Towards an Evolved Lower Bound for the Most Circular Partition of a Square Claudia Obermaier and Markus Wagner We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon's aspect ratio is supposed to be near 1. The aspect ration of a convex polygon denotes the ratio o...
Conference Paper
Full-text available
Knowledge compilation is a common technique for propo- sitional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be an- swered efficiently. This precompilation step is expensive, but it only has to be performed once. We apply this technique to knowledge bases defined in the Description LogicALC....
Conference Paper
Full-text available
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to transform a given knowledge base into a special normal form ([MR03],[DH05]), for which queries can be answered efficiently. This precompilation step is very expensive but it only has to be performed once. We propose to apply this technique to knowled...
Conference Paper
Full-text available
This paper offers an informal overview and discussion on first order predicate logic reasoning systems together with a description of applications which are carried out in the Artificial Intelligence Research Group of the University in Koblenz. Furthermore the technique of knowledge compilation is shortly introduced.
Conference Paper
In this paper we introduce a normal form for ALC\mathcal{ALC} concepts and TBoxes called linkless normal form. We investigate properties of concepts given in this normal form such as an efficient satisfiability test and the calculation of uniform interpolants. We further show a way to approximate a TBox by a concept in linkless normal form, which a...
Article
Full-text available
Zusammenfassung Der Mensch ist zweifellos die intelligenteste Spezi- es der Welt. Trotzdem unterlaufen ihm beim logischen Denken zahlreiche Fehler, wenn er nach den von den Menschen selbst entwickelten Regeln der formalen Logik beurteilt wird. Viele der beobachteten Fehler treten systematisch auf und konnten daher genauer untersucht werden. Diese S...
Article
Full-text available
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered efficiently. This precompilation step is expensive, but it only has to be performed once. We apply this technique to concepts defined in the Description Logic ALC. We introd...

Network

Cited By

Projects

Projects (2)
Archived project
In der Produktentwicklung lassen sich durch Wiederverwendung bereits vorhandener Produktmodelle und entwicklungsprozesse erhebliche Aufwände einsparen. Aufgrund der Computerunterstützung in der Produktentwicklung stehen solche Modelle und Prozesse in digitaler Form zur Verfügung. Allerdings müssen auch Modellelemente und Prozessschritte absichtlich vergessen werden, die für das neue Produkt nicht mehr zutreffen. Im Fall von komplexen Produktmodellen und entwicklungsprozessen gerät dieses absichtliche Vergessen (Intentional Forgetting (IF)) zu einem erheblichen Problem, da es hierfür weder adäquate Vorgehensmodelle noch adäquate IT-Unterstützung gibt. Ziel des Projekts EVOWIP ist es, den Produktentwicklungsprozess um stringente Methoden für das Intentional Forgetting so zu erweitern, dass die Komplexität die im Produktmodell, im Produktentwicklungsprozess und im Prozess des Vergessens selbst steckt, vom Produktentwickler gemeistert werden kann. Hierfür werden in EVOWIP (i) bereits implizit genutzte Vergessensmethoden systematisiert, (ii) zweckdienliche, konsistente und korrekte Wissensrepräsentationsmethoden für das absichtsvolle Vergessen entwickelt, (iii) diese Informatikmethoden in die Produktentwicklung integriert und (iv) diese Vorgehensweise validiert und in einem Vorgehensmodell generalisiert. Mit diesen Arbeiten erzielt EVOWIPE grundlegende Beiträge auf drei Ebenen: - Der Produktentwicklungsprozess wird für eine systematische und praktikable Anwendung von IF-Mechanismen durch den Produktentwickler revidiert. - Für ontologiebasierte Wissensbasen werden existierende IF-Operatoren für das (i) Vergessen inferierten Wissens erweitert um neuartige IF-Methoden für (ii) das Erinnern an das Vergessen, (iii) temporäres Vergessen, (iv) die Repräsentation von Leerstellen und (v) kaskadierendes Vergessen. - In der interdisziplinären Zusammenarbeit werden die Wissensrepräsentationsmethoden in den revidierten Produktentwicklungsprozess integriert und validiert.
Archived project