Sciweavers

150 search results - page 11 / 30
» Counting Results in Weak Formalisms
Sort
View
BSL
2000
153views more  BSL 2000»
13 years 8 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
CL
2000
Springer
14 years 1 months ago
A Logic Programming Application for the Analysis of Spanish Verse
Logic programming rules are provided to capture the rules governing formal poetry in Spanish. The resulting logic program scans verses in Spanish to provide their metric analysis. ...
Pablo Gervás
MST
2006
81views more  MST 2006»
13 years 8 months ago
Local Limit Properties for Pattern Statistics and Rational Models
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
Alberto Bertoni, Christian Choffrut, Massimiliano ...
CHARME
2003
Springer
73views Hardware» more  CHARME 2003»
14 years 13 days ago
Towards Diagrammability and Efficiency in Event Sequence Languages
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
Kathi Fisler
TGC
2007
Springer
14 years 2 months ago
Elimination of Ghost Variables in Program Logics
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
Martin Hofmann, Mariela Pavlova