| A |
| ai | |
| ALCH | |
| auction theory | |
| automate reasoning | |
| automated reasoning | |
| automated theorem proving | |
| Autonomous systems | |
| B |
| Boolean Algebra and Presburger Arithmetic | |
| C |
| CDCL algorithm | |
| classical logic | |
| Constraints | |
| CSP | |
| D |
| Definability | |
| Deontic logic | |
| E |
| economics | |
| Expressive Description Logics | |
| extended resolution | |
| F |
| first-order logic | |
| Focus Groups | |
| Forgetting | |
| Forgetting/projection/uniform interpolation | |
| formal methods | |
| Formal Verification | |
| functional programming | |
| G |
| General resolution | |
| H |
| Herbrand theorem | |
| Heuristics | |
| higher-order | |
| Human Reasoning | |
| hybrid automata | |
| I |
| Interactive Theorem Provers | |
| Intuitionistic logic | |
| M |
| mechanism design | |
| Minimal model generation | |
| modal logic | |
| Model generation | |
| modular verification | |
| multi agent | |
| N |
| natural deduction | |
| normal modal logics | |
| P |
| parallel deduction | |
| parameter synthesis | |
| planning | |
| program equivalence | |
| program verification | |
| proof complexity | |
| proof search | |
| Propositional proof system | |
| Q |
| query rewriting | |
| R |
| Reconfiguration | |
| regression verification | |
| resolution | |
| resolution method | |
| Robots | |
| S |
| SAT solving | |
| Satisfiability Modulo Theories | |
| search | |
| Second-order quantifier elimination | |
| sequent calculus | |
| socratic proofs | |
| SPA | |
| Strongest Necessary Conditions | |
| Subset-simulation | |
| superposition | |
| T |
| Tableau | |
| Tableaux calculi | |
| temporal logic | |
| term indexing | |
| term ordering | |
| Theorem-Proving | |
| U |
| Uniform Interpolation | |
| Usability | |
| V |
| verification | |