Fragments of first-order logic extending stratified formulas with restricted self-looping functions on one sort are decidable because they have the symbolic model property.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
citing papers explorer
-
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
Fragments of first-order logic extending stratified formulas with restricted self-looping functions on one sort are decidable because they have the symbolic model property.
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.