TL;DR
This paper investigates the complexity of satisfiability problems for various ordered fragments of first-order logic, using an algebraic framework to classify these logical fragments based on syntactical restrictions.
Contribution
It introduces a new algebraic approach to analyze the complexity of ordered and fluted logic fragments, extending previous classifications.
Findings
Complexity classifications for multiple ordered logic fragments
Identification of fragments with decidable satisfiability problems
Extension of algebraic methods to new logical fragment classes
Abstract
Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the ordered logic and the fluted logic by modifying some of their syntactical restrictions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.