On the Parameterized Complexity of Graph Modification to First-Order Logic Properties.
Fedor V. FominPetr A. GolovachDimitrios M. ThilikosPublished in: Theory Comput. Syst. (2020)
Keyphrases
- first order logic
- expressive power
- parameterized complexity
- theorem proving
- propositional logic
- inference rules
- probabilistic reasoning
- knowledge representation
- inductive logic programming
- horn clauses
- incomplete information
- transitive closure
- markov logic networks
- theorem prover
- directed graph
- weighted graph
- constraint satisfaction
- data management