Deduction Beyond Satisfiability (Dagstuhl Seminar 19371).
Carsten FuhsPhilipp RümmerRenate A. SchmidtCesare TinelliPublished in: Dagstuhl Reports (2019)
Keyphrases
- satisfiability problem
- theorem proving
- decision procedures
- propositional logic
- np complete
- inference rules
- computational complexity
- phase transition
- satisfiability testing
- proof procedure
- automated deduction
- computer algebra
- terminological reasoning
- neural network
- collaborative e learning
- intuitionistic logic
- sat solving
- quantified boolean formulas
- reasoning problems
- first order logic
- evolutionary algorithm
- optimal solution