276 search results - page 48 / 56 » Representing Transition Systems by Logic Programs |
IJIT
2004
13 years 9 months ago
2004
Both software applications and their development environment are becoming more and more distributed. This trend impacts not only the way software computes, but also how it looks. T...
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
SYNTHESE
2010
13 years 6 months ago
2010
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
DASFAA
2008
IEEE
13 years 9 months ago
2008
IEEE
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...