295 search results - page 4 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
CSL
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
IGPL
2010
13 years 4 months ago
2010
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
EACL
2003
ACL Anthology
13 years 8 months ago
2003
ACL Anthology
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
CSL
2004
Springer
14 years 25 days ago
2004
Springer
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...