We propose probabilistic rewrite theories as a general semantic framework supporting highlevel specification of probabilistic systems that can be massively concurrent. We give the definition and semantics of probabilistic rewrite theories and discuss the mappings between different classes of theories and models. We then define the semantics of probabilistic temporal formulae for a given probabi...

This papers presents δ-resolution, a dual resolution calculus. It is based on standard resolution, and uses appropriate formulae equivalent to disjunctive normal forms, instead of conjunctive normal ones, as it is the case for resolution. This duality is then useful to create a calculus for abductive processes, as a way to construct a set of abductive solutions. The proposed calculus is compare...

A complete axiomatic system CTL rp is introduced for a temporal logic for nitely branching ! +-trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL into CTL rp. In particular, that yields a complete axiomatization for the translations of all valid CTL-formulae. Thus, the temporal ...

In this paper we describe the semantic analysis of differential equations given in the ubiquitous formats MathML and OpenMath. The analysis is integrated in a deployed Web indexing framework. Starting from basic classifications for differential equations the proposed system architecture is amenable to extensions for further reconstruction of mathematical content on the Web. The syntactic analys...