loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Carsten Elfers ; Stefan Edelkamp and Otthein Herzog

Affiliation: University of Bremen, Germany

Keyword(s): Tolerant pattern matching, Constraint abstraction, Description logic, Constraint satisfaction.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Computational Intelligence ; e-Business ; Enterprise Engineering ; Enterprise Information Systems ; Enterprise Ontologies ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Representation and Reasoning ; Ontologies ; Simulation and Modeling ; Soft Computing ; Symbolic Systems ; Uncertainty in AI

Abstract: In this paper we consider efficiently matching logical constraint compositions called patterns by introducing a degree of satisfaction. The major advantage of our approach to other soft pattern matching methods is to exploit existing domain knowledge represented in Description Logic to handle imprecision in the data and to overcome the problem of an insufficient number of patterns. The matching is defined in a probabilistic framework to support post-processing with probabilistic models. Additionally, we propose an efficient complete algorithm for this kind of pattern matching, which reduces the number of inference calls to the reasoner. We analyze its worst-case complexity and compare it to a simple and to a theoretical optimal algorithm.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.76.159

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Elfers, C.; Edelkamp, S. and Herzog, O. (2012). EFFICIENT TOLERANT PATTERN MATCHING WITH CONSTRAINT ABSTRACTIONS IN DESCRIPTION LOGIC. In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-8425-95-9; ISSN 2184-433X, SciTePress, pages 256-261. DOI: 10.5220/0003720102560261

@conference{icaart12,
author={Carsten Elfers. and Stefan Edelkamp. and Otthein Herzog.},
title={EFFICIENT TOLERANT PATTERN MATCHING WITH CONSTRAINT ABSTRACTIONS IN DESCRIPTION LOGIC},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2012},
pages={256-261},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003720102560261},
isbn={978-989-8425-95-9},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - EFFICIENT TOLERANT PATTERN MATCHING WITH CONSTRAINT ABSTRACTIONS IN DESCRIPTION LOGIC
SN - 978-989-8425-95-9
IS - 2184-433X
AU - Elfers, C.
AU - Edelkamp, S.
AU - Herzog, O.
PY - 2012
SP - 256
EP - 261
DO - 10.5220/0003720102560261
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic