1032 search results - page 51 / 207 » Extended Computation Tree Logic |
104
click to vote
APAL
2007
15 years 3 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
141
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
126
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
133
click to vote
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
108
Voted
BMVC
2001
15 years 6 months ago
2001
This paper explores a new method for analysing and comparing image histograms. The technique amounts to a novel way of backprojecting an image into one with fewer, statistically s...