REGULAR PATH EXPRESSIONS IN FEATURE LOGIC

被引：4

作者：

BACKOFEN, R

机构：

[1] DFKI, W6600 Saarbrücken

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1994年 / 17卷 / 05期

关键词：

D O I：

10.1006/jsco.1994.1028

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. In the ama of computational linguistics, this notion has been introduced as ''functional uncertainty''. We will prove that satisfiability is decidable by constructing a quasi-terminating rule system.

引用

页码：421 / 455

页数：35

共 50 条

[1] Rewriting of regular expressions and regular path queries
Calvanese, D
De Giacomo, G
Lenzerini, M
Vardi, MY
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (03) : 443 - 465
[2] Query processing and optimization for regular path expressions
Wang, GR
Liu, MC
ADVANCED INFORMATION SYSTEMS ENGINEERING, PROCEEDINGS, 2003, 2681 : 30 - 45
[3] Optimizing regular path expressions using graph schemas
Fernandez, M
Suciu, D
14TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 1998, : 14 - 23
[4] Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts
Barozzini, David
de Frutos-Escrig, David
Della Monica, Dario
Montanari, Angelo
Sala, Pietro
THEORETICAL COMPUTER SCIENCE, 2020, 813 : 270 - 304
[5] Propositional projection temporal logic, buchi automata and ω-regular expressions
Tian, Cong
Duan, Zhenhua
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 47 - 58
[6] An evaluation of regular path expressions with qualifiers against XML streams
Olteanu, D
Kiesling, T
Bry, F
19TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2003, : 702 - 704
[7] An effective query pruning technique for multiple regular path expressions
Park, CW
Chung, CW
JOURNAL OF SYSTEMS AND SOFTWARE, 2002, 64 (03) : 219 - 233
[8] Regular Expressions and Predicate Logic in Finite-State Language Processing
Hulden, Mans
FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2009, 191 : 82 - 97
[9] On the efficient processing regular path expressions of an enormous volume of XML data
Kratky, Michal
Baca, Radim
Snasel, Vaclav
DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2007, 4653 : 1 - +
[10] Efficient Regular Simple Path Queries under Transitive Restricted Expressions
Liang, Qi
Ouyang, Dian
Zhang, Fan
Yang, Jianye
Lin, Xuemin
Tian, Zhihong
PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (07): : 1710 - 1722

← 1 2 3 4 5 →