Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
Easy Cases of Probabilistic Satisfiability
Annals of Mathematics and Artificial Intelligence
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Complexity of many-valued logics
Beyond two
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Complexity of linear connectivity problems in directed hypergraphs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |