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:
J. Appl. Log. (2010)
Keyphrases
</>
computational complexity
computational properties
satisfiability problem
data sets
worst case
logic programming
temporal logic
genetic algorithm
artificial intelligence
search algorithm
decision problems
modal logic
multi valued
predicate logic
bounded model checking