Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
We apply the 2-sequents approach to the analysis of several calculi derived from linear logic. We present a uniform formal system for Linear Logic, Elementary Linear Logic and Lig...
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
Abstract. We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge...
Franz Baader, Bernhard Ganter, Baris Sertkaya, Ulr...