An automated tool for analyzing completeness of equational specifications
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Explicit versus implicit representations of subsets of the Herbrand universe
Theoretical Computer Science
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
The Theory of Total Unary RPO Is Decidable
CL '00 Proceedings of the First International Conference on Computational Logic
Ground reducibility is EXPTIME-complete
Information and Computation
On Deciding Subsumption Problems
Annals of Mathematics and Artificial Intelligence
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Data-Oblivious Stream Productivity
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
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
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Model representation over finite and infinite signatures
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
A sufficient completeness checker for linear order-sorted specifications modulo axioms
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Model representation via contexts and implicit generalizations
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |