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