Sciweavers

247 search results - page 38 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
ICALP
2010
Springer
13 years 9 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
AAAI
2006
13 years 8 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
ML
2006
ACM
13 years 7 months ago
Relational IBL in classical music
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...
Asmir Tobudic, Gerhard Widmer
FUIN
2000
71views more  FUIN 2000»
13 years 7 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
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...
Stéphane Demri
JANCL
2008
109views more  JANCL 2008»
13 years 7 months ago
Conditionalization and total knowledge
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...
Ian Pratt-Hartmann