Finding Hard Instances of Satisfiability in Lukasiewicz Logics.
Miquel BofillFelip ManyàAmanda VidalMateu VillaretPublished in: ISMVL (2015)
Keyphrases
- modal logic
- decision procedures
- random instances
- phase transition
- expressive power
- random sat
- satisfiability problem
- sat instances
- stochastic local search
- inference rules
- randomly generated
- epistemic logic
- truth values
- np complete
- hard problems
- training instances
- sat problem
- propositional logic
- computational complexity