Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system.
Robert E. MercerVincent RischPublished in: Answer Set Programming (2003)
Keyphrases
- nonmonotonic reasoning
- maximal cliques
- graph properties
- graph theory
- pairwise
- default reasoning
- logic programming
- graph theoretic
- maximal clique enumeration
- belief revision
- default logic
- maximum clique
- graph matching
- complex networks
- association graph
- directed graph
- nonmonotonic inference
- logic programs
- machine learning
- autoepistemic logic
- higher order
- protein interaction networks
- random walk
- massive data
- fully connected
- fixpoint
- structural properties
- deductive databases