Equational problems anddisunification
Journal of Symbolic Computation
Constraints in computational logics
A Methodological View of Constraint Solving
Constraints
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Explicit versus implicit representations of subsets of the Herbrand universe
Theoretical Computer Science
Negation Elimination from Simple Equational Formulae
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Algorithms on Atomic Representations of Herbrand Models
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Elimination of Negation in a Logical Framework
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Extending Decidable Clause Classes via Constraints
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Information and Computation
Higher-order pattern complement and the strict λ-calculus
ACM Transactions on Computational Logic (TOCL)
On the complexity of equational problems in CNF
Journal of Symbolic Computation - Special issue: First order theorem proving
On Deciding Subsumption Problems
Annals of Mathematics and Artificial Intelligence
Theoretical Computer Science
Mechanized metatheory model-checking
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Electronic Notes in Theoretical Computer Science (ENTCS)
Theory of finite or infinite trees revisited
Theory and Practice of Logic Programming
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidability Results for Saturation-Based Model Building
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Anti-patterns for rule-based languages
Journal of Symbolic Computation
Complexity of rule redundancy in non-ground answer-set programming over finite domains
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
ESOP'07 Proceedings of the 16th European conference on Programming
Solving first-order constraints in the theory of the evaluated trees
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Classes of tree homomorphisms with decidable preservation of regularity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Generalization with taxonomic information
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Model representation over finite and infinite signatures
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Equational constraint solving via a restricted form of universal quantification
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Model representation via contexts and implicit generalizations
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
ON SETS OF TERMS: A STUDY OF A GENERALISATION RELATION AND OF ITS ALGORITHMIC PROPERTIES
Fundamenta Informaticae
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |