Two-Variable Logic for Hierarchically Partitioned and Ordered Data

2025-12-10

AI Summary

This paper investigates the satisfiability problem for two-variable first-order logic (FO₂) over hierarchical structured data models with semantic constraints. We consider four extensions: (1) FO₂ augmented with a linear order and a chain of coarsening equivalence relations; (2) FO₂ with nested total preorders; (3) FO₂ extended with successor relations over preorders; and (4) FO₂ with two independent nested equivalence chains. Employing model-theoretic analysis, finite-model construction, reductions, and automata-theoretic techniques, we establish the first complexity classification framework for FO₂ over multi-layered ordered structures. Our results show that cases (1) and (2) are NExpTime-complete; adding successor relations (case 3) raises complexity to ExpSpace-complete; and case (4) renders FO₂ undecidable. Collectively, this work systematically characterizes the fundamental impact of hierarchical semantics on the expressive power and decidability of FO₂.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for heterogeneous, signed, attributed, multi-relational, temporal, higher-order, and annotated Web-related graphs
• Web Mining and Content Analysis: Bridging structured and unstructured data

Abstract

We study Two-Variable First-Order Logic, FO2, under semantic constraints that model hierarchically structured data. Our first logic extends FO2 with a linear order < and a chain of increasingly coarser equivalence relations E_1, E_2, ... . We show that its finite satisfiability problem is NExpTime-complete. We also demonstrate that a weaker variant of this logic without the linear order enjoys the exponential model property. Our second logic extends FO2 with a chain of nested total preorders. We prove that its finite satisfiability problem is also NExpTime-complete.However, we show that the complexity increases to ExpSpace-complete once access to the successor relations of the preorders is allowed. Our last result is the undecidability of FO2 with two independent chains of nested equivalence relations.

Problem

• Studies FO2 logic under hierarchical data constraints
• Analyzes finite satisfiability complexity for ordered structures
• Investigates decidability with nested equivalence relations and preorders

Innovation

• FO2 extended with linear order and equivalence relations
• FO2 with nested total preorders for hierarchical data
• Undecidability with two independent chains of equivalence relations