3515 search results - page 261 / 703 » On the semantics of Strategy Logic |
174
click to vote
GC
2004
Springer
15 years 11 months ago
2004
Springer
This article summarises part of the work done during the first two years of the SOCS project, with respect to the task of modelling interaction amongst CL-based agents. It describe...
224
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...
183
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
201
click to vote
LOPSTR
2004
Springer
16 years 26 days ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
238
Voted
AGP
2003
IEEE
16 years 24 days ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...