247 search results - page 38 / 50 » A Computational Structure for the Propositional Calculus |
79
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
95
Voted
AAAI
2006
15 years 1 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
83
Voted
ML
2006
ACM
15 years 12 days ago
2006
ACM
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
83
Voted
FUIN
2000
15 years 8 days 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...
109
Voted
JANCL
2008
15 years 14 days 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...