We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...
In this paper, we review the paradigm of inductive process modeling, which uses background knowledge about possible component processes to construct quantitative models of dynamic...
Will Bridewell, Narges Bani Asadi, Pat Langley, Lj...
This paper addresses the challenge of generating test sets that achieve functional coverage, in the absence of a complete specification. The inductive testing technique works by p...
Neil Walkinshaw, Kirill Bogdanov, John Derrick, Ja...
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Here we present a scalable method to compute the structure of causal links over large scale dynamical systems that achieves high efficiency in discovering actual functional connec...
Guillermo A. Cecchi, Rahul Garg, A. Ravishankar Ra...