| A |
| Abductive logic programming | |
| B |
| BDD | |
| C |
| Circumscription | |
| clausal proofs | |
| Concept matching | |
| Concolic | |
| Craig interpolation | |
| Craig's interpolation | |
| D |
| Databases | |
| Definability | |
| Description Logics | |
| Domain Independence | |
| DRUP | |
| F |
| Fault Localization | |
| Forgetting | |
| Formal Verification | |
| G |
| Generalized Craig interpolation | |
| I |
| interpolants | |
| Interpolation | |
| L |
| Lazy Annotation | |
| local-first | |
| Logic Programming | |
| Logical abduction | |
| M |
| Maximal interpolants | |
| modulare SMT solving | |
| N |
| n-interpolation | |
| O |
| Ontologies | |
| P |
| Probabilistic BMC | |
| Probabilistic hybrid automaton | |
| Projection | |
| Property-driven reachability | |
| Pudlak rules | |
| Q |
| query optimization | |
| query plan generation | |
| query rewriting | |
| R |
| reachability games | |
| resolution | |
| Resolution rules | |
| S |
| SAT | |
| SAT modulo theories | |
| security protocols | |
| SMT | |
| Software model checking | |
| Specification Synthesis | |
| Stochastic satisfiability modulo theories | |
| string constraints | |
| synthesis | |
| T |
| Tableau | |
| Theory approximation | |
| two-player games | |
| U |
| Uniform Interpolation | |