Please use this identifier to cite or link to this item:
doi:10.22028/D291-24897
Title: | Regular path expressions in feature logic |
Author(s): | Backofen, Rolf |
Language: | English |
Year of Publication: | 1993 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1993 |
SWD key words: | Künstliche Intelligenz |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | We examine the existential fragment of a feature logic, which is extended by regular path expressions. A regular path expression is a subterm relation, where the allowed paths for the subterms are restricted to any given regular language. We will prove that satisfiability is decidable. This is achieved by setting up a quasi-terminating rule system. |
Link to this record: | urn:nbn:de:bsz:291-scidok-36530 hdl:20.500.11880/24953 http://dx.doi.org/10.22028/D291-24897 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 93-17 |
Date of registration: | 27-Jun-2011 |
Faculty: | SE - Sonstige Einrichtungen |
Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
RR_93_17.pdf | 315,81 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.