In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
We consider online learning in repeated decision problems, within the framework of a repeated game against an arbitrary opponent. For repeated matrix games, well known results esta...