Quantified constraints under perturbation
Journal of Symbolic Computation
Dynamically Ordered Probabilistic Choice Logic Programming
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Making revision reversible: an approach based on polynomials
Fundamenta Informaticae
Convergent approximate solving of first-order constraints by approximate quantifiers
ACM Transactions on Computational Logic (TOCL)
A dissimilarity measure for ALC concept descriptions
Proceedings of the 2006 ACM symposium on Applied computing
Analogical Reasoning in Description Logics
Uncertainty Reasoning for the Semantic Web I
Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Approaches to Uncertain or Imprecise Rules - A Survey
RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
A theoretical framework for knowledge discovery in databases based on probabilistic logic
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Default reasoning from statistics
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Using first-order probability logic for the construction of Bayesian networks
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Lazy learning from terminological knowledge bases
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Formal analysis of a probabilistic knowledge communication framework
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Making revision reversible: an approach based on polynomials
Fundamenta Informaticae
| Hi-index | 0.00 |