Satisfiability in Many-Valued Sentential Logic is NP-Complete.
Daniele MundiciPublished in: Theor. Comput. Sci. (1987)
Keyphrases
- np complete
- modal logic
- satisfiability problem
- truth values
- computational complexity
- temporal logic
- description logic alc
- phase transition
- randomly generated
- np hard
- pspace complete
- decision procedures
- sat problem
- constraint satisfaction problems
- inference rules
- conjunctive queries
- logical equivalence
- classical logic
- multi valued
- bounded treewidth
- proof theory
- data complexity
- np complete problems
- cnf formula
- boolean formula
- bounded model checking
- automated reasoning
- computational properties
- fixpoint
- default logic
- concept lattice
- model checking
- data model