3440 search results - page 61 / 688 » Logics For Context-Free Languages |
162
click to vote
LFCS
2009
Springer
16 years 25 days ago
2009
Springer
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
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...
144
click to vote
AGP
2003
IEEE
15 years 11 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...