Journal of Automated Reasoning
Explicit versus implicit representations of subsets of the Herbrand universe
Theoretical Computer Science
Extending Decidable Clause Classes via Constraints
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
On Deciding Subsumption Problems
Annals of Mathematics and Artificial Intelligence
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
Disunification for ultimately periodic interpretations
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
ON SETS OF TERMS: A STUDY OF A GENERALISATION RELATION AND OF ITS ALGORITHMIC PROPERTIES
Fundamenta Informaticae
Bilateral algorithms for symbolic abstraction
SAS'12 Proceedings of the 19th international conference on Static Analysis
Deriving a complete type inference for hindley-milner and vector sizes using expansion
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Hi-index | 0.00 |