Colloque avec actes et comité de lecture. internationale.International audienceRewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic
International audienceWe study the termination problem for probabilistic term rewrite systems. We pr...
The temporal propositional logic of linear time is generalized to an uncertain world, in which rando...
Probabilistic logic programming is a powerful technique to represent and reason with imprecise proba...
In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider ...
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitio...
Colloque avec actes et comité de lecture. internationale.International audienceRecently rule based l...
This papers develops a logical language for representing probabilistic causal laws. Our interest in ...
In the nineteen sixties seminal work was done by Gaifman and then Scott and Krauss in adapting the c...
Rewriting logic is a simple computational logic that can naturally express both concurrent computati...
Colloque avec actes et comité de lecture. internationale.International audienceRecently rule based l...
AbstractIn the nineteen sixties seminal work was done by Gaifman and then Scott and Krauss in adapti...
AbstractWe introduce a rewrite-based specification language for modelling probabilistic concurrent a...
Rewriting logic is a simple computational logic that can naturally express both concurrent computati...
This papers develops a logical language for representing probabilistic causal laws. Our interest ...
Abstract. Recently rule based languages focussed on the use of rewrit-ing as a modeling tool which r...
International audienceWe study the termination problem for probabilistic term rewrite systems. We pr...
The temporal propositional logic of linear time is generalized to an uncertain world, in which rando...
Probabilistic logic programming is a powerful technique to represent and reason with imprecise proba...
In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider ...
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitio...
Colloque avec actes et comité de lecture. internationale.International audienceRecently rule based l...
This papers develops a logical language for representing probabilistic causal laws. Our interest in ...
In the nineteen sixties seminal work was done by Gaifman and then Scott and Krauss in adapting the c...
Rewriting logic is a simple computational logic that can naturally express both concurrent computati...
Colloque avec actes et comité de lecture. internationale.International audienceRecently rule based l...
AbstractIn the nineteen sixties seminal work was done by Gaifman and then Scott and Krauss in adapti...
AbstractWe introduce a rewrite-based specification language for modelling probabilistic concurrent a...
Rewriting logic is a simple computational logic that can naturally express both concurrent computati...
This papers develops a logical language for representing probabilistic causal laws. Our interest ...
Abstract. Recently rule based languages focussed on the use of rewrit-ing as a modeling tool which r...
International audienceWe study the termination problem for probabilistic term rewrite systems. We pr...
The temporal propositional logic of linear time is generalized to an uncertain world, in which rando...
Probabilistic logic programming is a powerful technique to represent and reason with imprecise proba...