No-Signaling Proofs with O(√(log n)) Provers are in PSPACE.
Dhiraj HoldenYael KalaiPublished in: CoRR (2019)
Keyphrases
- theorem proving
- decision procedures
- theorem prover
- automated reasoning
- proof search
- first order logic
- natural deduction
- formal proof
- inference rules
- lower bound
- computer algebra
- worst case
- equational theories
- proof procedure
- mathematical proofs
- complexity bounds
- information systems
- upper bound
- multi agent
- artificial intelligence
- genetic algorithm
- databases