Paper Info
Title
Finite Model Theory of the Triguarded Fragment and Related Logics
Abstract
The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size) and hence finite satisfiability coincides with satisfiability known to be N2ExpTime-complete. Using similar const...
Year
DOI
Venue
2021
10.1109/LICS52264.2021.9470734
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Keywords
DocType
ISBN
Computer science,Upper bound,Complexity theory,Computational efficiency,Standards
Conference
978-1-6654-4895-6
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Emanuel Kieronski111413.85
Sebastian Rudolph221.39