Sciweavers

1054 search results - page 22 / 211
» A Logic Language of Granular Computing
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 8 months ago
On the logical definability of certain graph and poset languages
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...
Pascal Weil
LICS
2009
IEEE
14 years 2 months ago
Wreath Products of Forest Algebras, with Applications to Tree Logics
—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...
SCP
1998
138views more  SCP 1998»
13 years 7 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
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...
Roberto Bagnara

Book
397views
15 years 6 months ago
Computational Semantics with Functional Programming
"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...
Jan van Eijck, Christina Unger
COLING
2002
13 years 7 months ago
Computation of Modifier Scope in NP by a Language-neutral Method
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...
Richard Campbell