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:
MFCS (2009)
Keyphrases
</>
computational complexity
neural network
space complexity
worst case
logic programming
decision problems
automated reasoning
data sets
np complete
orders of magnitude
propositional logic
hybrid learning
table of contents
decision procedures
asynchronous circuits