Sciweavers

1670 search results - page 121 / 334
» On Skolemization in constructive theories
Sort
View
LATA
2009
Springer
16 years 1 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
FSTTCS
2009
Springer
16 years 1 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
JOLLI
2010
142views more  JOLLI 2010»
15 years 4 months ago
Towards a Type-Theoretical Account of Lexical Semantics
After a quick overview of the field of study known as “Lexical Semantics”, where we advocate the need of accessing additional information besides syntax and Montaguestyle sema...
Christian Bassac, Bruno Mery, Christian Retor&eacu...
WWW
2003
ACM
16 years 7 months ago
A Web Service Market Model based on Dependencies
The construction of composite Web Services from service fragments requires semantic descriptions of service offers and service requests. We propose the use of dependencies as a mo...
Robert Tolksdorf, Christian Bizer, Ralf Heese
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 6 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...