4401 search results - page 191 / 881 » Computing with Default Logic |
152
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
119
click to vote
DLT
2009
15 years 1 months ago
2009
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
148
click to vote
TCS
2010
14 years 11 months ago
2010
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
156
Voted
BIRTHDAY
2012
Springer
13 years 12 months ago
2012
Springer
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
124
click to vote
PEPM
2007
ACM
15 years 10 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...