148 search results - page 19 / 30 » On the Complexity of Elementary Modal Logics |
CSL
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
123
click to vote
LPAR
2004
Springer
15 years 7 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
122
click to vote
JANCL
2008
15 years 1 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
FUIN
2000
15 years 1 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
105
Voted
IEEEICCI
2007
IEEE
15 years 8 months ago
2007
IEEE
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...