We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiew...
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
"This book on applications of logic in the semantic analysis of language pays the
reader the compliment of not assuming anything about what he or she knows (in particular, no...
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of s...