Sciweavers

34 search results - page 3 / 7
» Weak Nonmonotonic Probabilistic Logics
Sort
View
IJCAI
1989
13 years 6 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
VMCAI
2012
Springer
12 years 26 days ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
LFCS
2009
Springer
13 years 12 months ago
Temporalization of Probabilistic Propositional Logic
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
Pedro Baltazar, Paulo Mateus
FOSSACS
2007
Springer
13 years 11 months ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala
FOSSACS
2006
Springer
13 years 9 months ago
A Finite Model Construction for Coalgebraic Modal Logic
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
Lutz Schröder