Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
A Tableau Calculus for Combining Non-disjoint Theories
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Applying Rewriting Techniques to the Verification of Erlang Processes
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Simplification and termination of strategies in rule-based languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
On the confluence of lambda-calculus with conditional rewriting
Theoretical Computer Science
On the confluence of λ-calculus with conditional rewriting
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Extension of first-order theories into trees
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Modularity in term rewriting revisited
Theoretical Computer Science
| Hi-index | 0.00 |