Parameterized circuit complexity of model checking first-order logic on sparse structures.
Michal PilipczukSebastian SiebertzSzymon TorunczykPublished in: CoRR (2018)
Keyphrases
- model checking
- first order logic
- timed automata
- pspace complete
- temporal logic
- expressive power
- model checker
- theorem proving
- formal verification
- set theory
- finite state
- formal specification
- propositional logic
- inference rules
- knowledge representation
- incomplete information
- theorem prover
- probabilistic reasoning
- verification method
- transitive closure
- formal methods
- finite state machines
- horn clauses
- asynchronous circuits
- formal semantics
- computational complexity
- decision problems
- np complete
- markov logic networks
- epistemic logic
- satisfiability problem
- constraint satisfaction problems