11740 search results - page 270 / 2348 » More Problems in Rewriting |
162
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 ...
169
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
163
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
160
click to vote
FSEN
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
135
click to vote
ICSEA
2006
IEEE
16 years 19 days ago
2006
IEEE
ey operate with computer abstractions not with AD ions they cannot fully bridge the semantic gap between IT and AD. Therefore, we can safely conclude that the research on computer ...