On the Parameterized Complexity of Graph Modification to First-Order Logic Properties.
Fedor V. FominPetr A. GolovachDimitrios M. ThilikosPublished in: CoRR (2018)
Keyphrases
- first order logic
- expressive power
- parameterized complexity
- inference rules
- propositional logic
- theorem proving
- probabilistic reasoning
- transitive closure
- incomplete information
- inductive logic programming
- theorem prover
- knowledge representation
- markov logic networks
- random walk
- directed acyclic graph
- databases
- logic programs
- graphical models
- weighted graph
- artificial intelligence