SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability.
Matthias BaazAgata CiabattoniNorbert PreiningPublished in: WoLLIC (2009)
Keyphrases
- query containment
- decision procedures
- valued logic
- description logics
- satisfiability problem
- datalog programs
- modal logic
- number restrictions
- query answering
- conjunctive queries
- propositional satisfiability
- transitive closure
- propositional logic
- classical logic
- expressive power
- sat problem
- temporal logic
- automated reasoning
- first order logic
- computational properties
- datalog queries
- sat solvers
- search algorithm
- fuzzy sets
- logic programs
- sat instances
- theorem proving
- data complexity
- answering queries
- truth values
- phase transition
- sat solving
- knowledge base
- stochastic local search
- max sat
- inference rules
- stochastic local search algorithms
- social bookmarking
- deductive databases
- np complete
- exptime complete
- regular expressions
- boolean satisfiability
- integrity constraints
- query optimization
- multi valued
- query rewriting
- stable models
- theorem prover
- fixpoint
- query language
- knowledge representation
- logic programming
- constraint satisfaction problems
- data integration
- orders of magnitude
- model checking