Satisfiability Solving and Model Generation for Quantified First-Order Logic Formulas.
Christoph GladischPublished in: FoVeOOS (2010)
Keyphrases
- first order logic
- davis putnam logemann loveland
- propositional logic
- quantifier free
- predicate calculus
- expressive power
- horn clauses
- theorem proving
- guarded fragment
- inference rules
- propositional formulas
- inductive logic programming
- knowledge representation
- logical formulas
- boolean formula
- representation language
- probabilistic reasoning
- markov networks
- satisfiability problem
- transitive closure
- relational calculus
- relational algebra
- theorem prover
- probabilistic graphical models
- np complete
- quantifier elimination
- markov logic networks
- conjunctive normal form
- mazurkiewicz traces
- sat solvers