First-order satisfiability in Gödel logics: An NP-complete fragment.
Matthias BaazAgata CiabattoniNorbert PreiningPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- np complete
- valued logic
- satisfiability problem
- propositional logic
- first order logic
- conditional logic
- classical logic
- sat problem
- np hard
- randomly generated
- expressive power
- phase transition
- cnf formula
- computational complexity
- constraint satisfaction problems
- decision procedures
- classical first order logic
- inference rules
- modal logic
- pspace complete
- multi valued
- higher order
- conjunctive queries
- logic programs
- truth values
- horn clauses
- social bookmarking
- model theoretic
- bounded treewidth
- conp complete
- nonmonotonic reasoning
- automated reasoning
- relational learning
- logic programming
- default reasoning
- knowledge representation
- data model