How to Best Nest Regular Path Queries.
Aus International Center for Computational Logic
How to Best Nest Regular Path Queries.
Pierre BourhisPierre Bourhis, Markus KrötzschMarkus Krötzsch, Sebastian RudolphSebastian Rudolph
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
How to Best Nest Regular Path Queries.
Description Logics, 404-415, 2014
How to Best Nest Regular Path Queries.
Description Logics, 404-415, 2014
- Forschungsgruppe:Research Group: Information Systems„Information Systems“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Knowledge-Based Systems
@inproceedings{BKR2014,
author = {Pierre Bourhis and Markus Kr{\"{o}}tzsch and Sebastian Rudolph},
title = {How to Best Nest Regular Path Queries.},
booktitle = {Description Logics},
year = {2014},
pages = {404-415}
}