OCL2MSFOL: a mapping to many-sorted first-order logic for efficiently checking the satisfiability of OCL constraints.
Carolina DaniaManuel ClavelPublished in: MoDELS (2016)
Keyphrases
- first order logic
- constraint language
- propositional logic
- expressive power
- quantifier free
- inference rules
- constraint networks
- theorem proving
- representation language
- davis putnam logemann loveland
- integrity constraints
- theorem prover
- probabilistic graphical models
- inductive logic programming
- knowledge representation
- probabilistic reasoning
- modeling language
- function symbols
- markov networks
- object oriented
- transitive closure
- logical rules
- satisfiability problem
- relational algebra
- quantifier elimination
- markov logic
- markov logic networks
- computational properties
- data complexity
- mazurkiewicz traces
- constraint satisfaction
- horn clauses
- database systems
- temporal reasoning
- normal form
- computational complexity