9532 search results - page 397 / 1907 » Logic, Graphs, and Algorithms |
301
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
157
click to vote
SUM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
163
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
172
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
179
click to vote
JMLR
2006
15 years 6 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...