ADDING PATH-FUNCTIONAL DEPENDENCIES TO THE GUARDED TWO-VARIABLE FRAGMENT WITH COUNTING

被引：0

作者：

Kourtis, Georgios ^{[1
]}

Pratt-Hartmann, Ian ^{[1
]}

机构：

[1] Univ Manchester, Sch Comp Sci, Manchester, Lancs, England

来源：

LOGICAL METHODS IN COMPUTER SCIENCE | 2017年 / 13卷 / 04期

关键词：

Satisfiability; two-variable fragments; guarded fragment; counting quantifiers; integrity constraints; key constraints; path-functional dependencies; CONSTRAINTS; LOGIC;

D O I：

10.23638/LMCS-13(4:4)2017

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExPTIME-complete.

引用

页数：39

共 44 条

[1] Complexity of the guarded two-variable fragment with counting quantifiers
Pratt-Hartmann, Ian
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2007, 17 (01) : 133 - 155
[2] Equivalence closure in the two-variable guarded fragment
Kieronski, Emanuel
Pratt-Hartmann, Ian
Tendera, Lidia
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2017, 27 (04) : 999 - 1021
[3] The two-variable fragment with counting and equivalence
Pratt-Hartmann, Ian
[J]. MATHEMATICAL LOGIC QUARTERLY, 2015, 61 (06) : 474 - 515
[4] A polynomial translation from the two-variable guarded fragment with number restrictions to the guarded fragment
Kazakov, Y
[J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 372 - 384
[5] The Two-Variable Fragment with Counting Revisited
Pratt-Hartmann, Ian
[J]. LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2010, 6188 : 42 - 54
[6] On the complexity of the two-variable guarded fragment with transitive guards
Kieronski, Emanuel
[J]. INFORMATION AND COMPUTATION, 2006, 204 (11) : 1663 - 1703
[7] Complexity of the Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann
[J]. Journal of Logic, Language and Information, 2005, 14 (3) : 369 - 395
[8] ON TWO-VARIABLE GUARDED FRAGMENT LOGIC WITH EXPRESSIVE LOCAL PRESBURGER CONSTRAINTS
Lu, Chia-Hsuan
Tan, Tony
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 20 (03)
[9] Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
Kieronski, Emanuel
Tendera, Lidia
[J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2018, 19 (02)
[10] The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
Kieronski, E
[J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2003, 2620 : 299 - 312

← 1 2 3 4 5 →