Sciweavers

1071 search results - page 131 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
CADE
2007
Springer
15 years 10 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
ARGMAS
2005
Springer
14 years 11 months ago
A Logic of Abstract Argumentation
of Abstract Argumentation Guido Boella1 , Joris Hulstijn2 , and Leendert van der Torre3 1 Universit´a di Torino 2 Vrije Universiteit, Amsterdam 3 CWI Amsterdam and Delft Universit...
Guido Boella, Joris Hulstijn, Leendert W. N. van d...
LOGCOM
2010
143views more  LOGCOM 2010»
14 years 8 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
TARK
2009
Springer
15 years 4 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass
LPNMR
2005
Springer
15 years 3 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar