Koepke Machines and Satisfiability for Infinitary Propositional Languages.
Merlin CarlBenedikt LöweBenjamin G. RinPublished in: CiE (2017)
Keyphrases
- propositional logic
- satisfiability testing
- expressive power
- language independent
- satisfiability problem
- cnf formula
- propositional variables
- first order logic
- propositional formulas
- conjunctive normal form
- propositional theories
- np complete
- boolean formula
- language identification
- computational complexity
- default logic
- optimal solution