Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
Petr A. GolovachGiannos StamoulisDimitrios M. ThilikosPublished in: CoRR (2022)
Keyphrases
- model checking
- first order logic
- disjoint paths
- timed automata
- horn clauses
- temporal logic
- closure operator
- undirected graph
- directed graph
- expressive power
- function symbols
- propositional logic
- theorem proving
- inference rules
- approximation algorithms
- knowledge representation
- theorem prover
- finite state
- probabilistic reasoning
- formal specification
- inductive logic programming
- logical formulas
- random walk
- pspace complete
- machine learning
- spanning tree