Login / Signup
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
Arne Meier
Martin Mundhenk
Thomas Schneider
Michael Thomas
Volker Weber
Felix Weiss
Published in:
CoRR (2009)
Keyphrases
</>
computational complexity
computational properties
satisfiability problem
asynchronous circuits
genetic algorithm
worst case
phase transition
propositional logic
table of contents
np complete
multi valued