Sciweavers

CADE
2010
Springer
14 years 6 months ago
Terminating Tableaux for Hybrid Logic with Eventualities
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
Mark Kaminski, Gert Smolka
60
Voted
IRI
2007
IEEE
15 years 3 months ago
Reducing hard SAT instances to polynomial ones
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
Olivier Fourdrinoy, Éric Grégoire, B...