10 research outputs found
Learning Description Logic Concepts: When can Positive and Negative Examples be Separated?
Learning description logic (DL) concepts from positive and negative examples given in the form of labeled data items in a KB has received significant attention in the literature. We study the fundamental question of when a separating DL concept exists and provide useful model-theoretic characterizations as well as complexity results for the associated decision problem. For expressive DLs such as ALC and ALCQI, our characterizations show a surprising link to the evaluation of ontology-mediated conjunctive queries. We exploit this to determine the combined complexity (between ExpTime and NExpTime) and data complexity (second level of the polynomial hierarchy) of separability. For the Horn DL EL, separability is ExpTime-complete both in combined and in data complexity while for its modest extension ELI it is even undecidable. Separability is also undecidable when the KB is formulated in ALC and the separating concept is required to be in EL or ELI.</jats:p
Recommended from our members
Toward Autonomous Verification Systems
Design verification has been a challenging problem due to the increasing complexity of modern system-on-chip (SoC) designs and it is considered one of the costliest processes in hardware design flow. This dissertation investigates a major labor-intensive task, generating tests to hit a given coverage point, in simulation-based verification, and proposes an autonomous software system capable of completing the task. A key feature of the proposed system is its learning capability -- it can learn from examples provided by human engineers to improve itself. There are three major components in the proposed system: test generation, a knowledge database, and rule learning algorithms. The proposed system is able to retrieve information from the database, use the information to analyze simulation results, and generate new tests based on the analysis. Several machine learning techniques are used in the proposed system. For test generation, a novel method, constrained process discovery, is used to learn a test case generation model from manually developed tests. The test case generation model can create new tests and increase its test generation capability by learning from tests developed by humans. For creating a knowledge database, text mining methods are used to extract important design features from design documents. Experiments showed that the extracted signals can be utilized as observation points to infer important hardware events. Last, a novel rule learning method, VeSC-CoL, is proposed to analyze simulation results. VeSC-CoL can handle extremely imbalanced data, which is common in verification, while traditional rule learning methods cannot
A global workspace framework for combined reasoning
Artificial Intelligence research has produced
many effective techniques for solving a wide range
of problems. Practitioners tend to concentrate their efforts in one particular problem solving
paradigm and, in the main, AI research describes new methods for solving particular types of
problems or improvements in existing approaches. By contrast, much less research has considered
how to fruitfully combine different problem solving techniques. Numerous studies have
demonstrated how a combination of reasoning approaches can improve the effectiveness of one of
those methods. Others have demonstrated how, by using several different reasoning techniques,
a system or method can be developed to accomplish a novel task, that none of the individual
techniques could perform. Combined reasoning systems, i.e., systems which apply disparate
reasoning techniques in concert, can be more than the sum of their parts. In addition, they
gain leverage from advances in the individual methods they encompass. However, the benefits
of combined reasoning systems are not easily accessible, and systems have been hand-crafted
to very specific tasks in certain domains. This approach means those systems often suffer from
a lack of clarity of design and are inflexible to extension. In order for the field of combined reasoning
to advance, we need to determine best practice and identify effective general approaches.
By developing useful frameworks, we can empower researchers to explore the potential of combined
reasoning, and AI in general. We present here a framework for developing combined
reasoning systems, based upon Baars’ Global Workspace Theory. The architecture describes a
collection of processes, embodying individual reasoning techniques, which communicate via a
global workspace. We present, also, a software toolkit which allows users to implement systems
according to the framework. We describe how, despite the restrictions of the framework, we
have used it to create systems to perform a number of combined reasoning tasks. As well
as being as effective as previous implementations, the simplicity of the underlying framework
means they are structured in a straightforward and comprehensible manner. It also makes the
systems easy to extend to new capabilities, which we demonstrate in a number of case studies.
Furthermore, the framework and toolkit we describe allow developers to harness the parallel
nature of the underlying theory by enabling them to readily convert their implementations into
distributed systems. We have experimented with the framework in a number of application domains
and, through these applications, we have contributed to constraint satisfaction problem
solving and automated theory formation
Version spaces and the consistency problem
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Mit82] proposed representing a version space by its boundary sets: the maximally general (G) and maximally specific consistent concepts (S). For many simple concept classes, the size of G and S is known to grow exponentially in the number of positive and negative examples. This paper argues that previous work on alternative representations of version spaces has disguised the real question underlying version space reasoning. We instead show that tractable reasoning with version spaces turns out to depend on the consistency problem, i.e., determining if there is any concept consistent with a set of positive and negative examples. Indeed, we show that tractable version space reasoning is possible if and only if there is an efficient algorithm for the consistency problem. Our observations give rise to new concept classes for which tractable version space reasoning is now possible, e.g., 1-decision lists, monotone depth two formulas, and halfspaces. 1
www.elsevier.com/locate/artint Version spaces and the consistency problem ✩
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Artificial Intelligence 18 (1982) 203–226] proposed representing a version space by its boundary sets: the maximally general (G) and maximally specific consistent concepts (S).For many simple concept classes, the size of G and S is known to grow exponentially in the number of positive and negative examples. This paper argues that previous work on alternative representations of version spaces has disguised the real question underlying version space reasoning. We instead show that tractable reasoning with version spaces turns out to depend on the consistency problem, i.e., determining if there is any concept consistent with a set of positive and negative examples. Indeed, we show that tractable version space reasoning is possible if and only if there is an efficient algorithm for the consistency problem. Our observations give rise to new concept classes for which tractable version space reasoning is now possible, e.g., 1-decision lists, monotone depth two formulas, and halfspaces. © 2004 Elsevier B.V. All rights reserved