A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Testing for the Church-Rosser Property
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On some families of languages related to the Dyck language
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Properties of substitutions and unifications
Journal of Symbolic Computation
On the descriptive power of term rewriting systems
Journal of Symbolic Computation
Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
Rule-based transformation of relational queries into iterative programs
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Structure of a LOTOS interpreter
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
A catalogue of complete group presentations
Journal of Symbolic Computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Thue systems as rewriting systems
Journal of Symbolic Computation
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
A rule-based view of query optimization
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
On the translation of relational queries into iterative programs
ACM Transactions on Database Systems (TODS)
Journal of Symbolic Computation
Towards an efficient evaluation of general queries: quantifier and disjunction processing revisited
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Journal of Symbolic Computation
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Knuth-Bendix procedure and Buchberger algorithm: a synthesis
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Systematic design of algebraic specifications
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Rewrite, rewrite, rewrite, rewrite, rewrite...
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unification in commutative theories
Journal of Symbolic Computation
A strong restriction of the inductive completion procedure
Journal of Symbolic Computation
Using unavoidable set of trees to generalize Kruskal's theorem
Journal of Symbolic Computation
Unification in permutative equational theories is undecidable
Journal of Symbolic Computation
Non-commutative Gröbner bases in algebras of solvable type
Journal of Symbolic Computation
Journal of Symbolic Computation
A correctness proof for combinator reduction with cycles
ACM Transactions on Programming Languages and Systems (TOPLAS)
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logical theory of concurrent objects
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Compilation as partitioning: a new approach to compiling non-strict functional languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A record calculus based on symmetric concatenation
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A tool supporting query optimization and program transformation techniques
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Comparison of priority rules in pattern matching and term rewriting
Journal of Symbolic Computation
Automating inductionless induction using test sets
Journal of Symbolic Computation
On word problems in horn theories
Journal of Symbolic Computation
Term rewriting: Some experimental results
Journal of Symbolic Computation
Journal of the ACM (JACM)
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
Theorem proving using equational matings and rigid E-unification
Journal of the ACM (JACM)
Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
Combining matching algorithms: The regular case
Journal of Symbolic Computation
A confluent calculus of Macro expansion and evaluation
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical semantics for object-oriented databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
Z-module reasoning: an equality-oriented proving method with built-in ring axioms
Journal of the ACM (JACM)
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
Live-structure dataflow analysis for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
The translation power of top-down tree-to-graph transducers
Journal of Computer and System Sciences
Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
A theory of using history for equational systems with applications
Journal of the ACM (JACM)
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
Functional computation as concurrent computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Concurrent Architecture for Serializable Production Systems
IEEE Transactions on Parallel and Distributed Systems
A non-deterministic call-by-need lambda calculus
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Towards a semantic theory for equational programming languages
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Automatically Checking an Implementation against Its Formal Specification
IEEE Transactions on Software Engineering
Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Information and Computation
On implementing behavioral rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Formal Proofs About Rewriting Using ACL2
Annals of Mathematics and Artificial Intelligence
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Relative undecidability in term rewriting: II. the confluence hierarchy
Information and Computation
Context-sensitive rewriting strategies
Information and Computation
Abduction in logic programming: a new definition and an abductive procedure based on rewriting
Artificial Intelligence
Automated Proof Construction in Type Theory Using Resolution
Journal of Automated Reasoning
Function Materialization in Object Bases: Design, Realization, and Evaluation
IEEE Transactions on Knowledge and Data Engineering
Using Term Rewriting to Verify Software
IEEE Transactions on Software Engineering
Translating Aggregate Queries into Iterative Programs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Advanced Query Processing in Object Bases Using Access Support Relations
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Term Rewriting in a Logic of Special Relations
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Solving the Inheritance Anomaly in Concurrent Object-Oriented Programming
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
On Semantics and Correctness of Reactive Rule-Based Programs
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Improving Homeomorphic Embedding for Online Termination
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Normalisation in Weakly Orthogonal Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Instance Based Function Learning
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Completion of a set of rules modulo a set of equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rewriting systems on FP expressions that reduce the number of sequences they yield
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Schema recognition for program transformations
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Unique normal forms in term rewriting systems with repeated variables
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Using complexity functions to generate normal forms for free algebra terms
CSC '84 Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Uniform confluence in concurrent computation
Journal of Functional Programming
Parallelizing functional programs by generalization
Journal of Functional Programming
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
A framework for the integration of partial evaluation and abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstraction and control for shapely nested graph transformation
Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
A monadic analysis of information flow security with mutable state
Journal of Functional Programming
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Some reduction strategies for algebraic term rewriting
ACM SIGSAM Bulletin
Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions
Journal of Algebraic Combinatorics: An International Journal
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Normal forms for binary relations
Theoretical Computer Science
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Resource operators for λ-calculus
Information and Computation
A ρ-calculus of explicit constraint application
Higher-Order and Symbolic Computation
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Pattern minimization problems over recursive data types
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Embedding and Confluence of Graph Transformations with Negative Application Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Shallow confluence of conditional term rewriting systems
Journal of Symbolic Computation
Circularity, composition, and decomposition results for pebble macro tree transducers
Journal of Automata, Languages and Combinatorics
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science (ENTCS)
Using groups for investigating rewrite systems
Mathematical Structures in Computer Science
From exponential to almost linear decomposability of finite or infinite trees
Proceedings of the 2009 ACM symposium on Applied Computing
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
Languages: From Formal to Natural
Proving Confluence of Term Rewriting Systems Automatically
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Diagrammatic Confluence and Completion
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The Markgraf Karl refutation procedure
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Completeness of the negation as failure rule
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Towards an advanced implementation of the connection method
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Unique normal forms and confluence of rewrite systems: persistence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
Anti-patterns for rule-based languages
Journal of Symbolic Computation
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Testing extended regular language membership incrementally by rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Extensional rewriting with sums
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Complexity of a CHR solver for existentially quantified conjunctions of equations over trees
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Abstract critical pairs and confluence of arbitrary binary relations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Upper bounds on stream I/O using semantic interpretations
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Information Processing Letters
On the confluence of lambda-calculus with conditional rewriting
Theoretical Computer Science
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem
Journal of Automated Reasoning
Detecting redundant production rules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
How to correctly prune tropical trees
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Confluent Term Rewriting for Only-knowing Logics
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Quasi-interpretations a way to control resources
Theoretical Computer Science
Analysing graph transformation systems through constraint handling rules
Theory and Practice of Logic Programming
Semantics of concurrent revisions
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Decreasing Diagrams and Relative Termination
Journal of Automated Reasoning
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Conflict detection for graph transformation with negative application conditions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A terminating and confluent linear lambda calculus
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Processes, Terms and Cycles
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Confluence of graph transformation revisited
Processes, Terms and Cycles
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
The attributed pi-calculus with priorities
Transactions on Computational Systems Biology XII
Decreasing diagrams and relative termination
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Checking formal specifications by testing
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
Confluence of non-left-linear TRSs via relative termination
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Studia Logica
Confluence in data reduction: bridging graph transformation and kernelization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Abstraction and Control for Shapely Nested Graph Transformation
Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
Fundamenta Informaticae
Fundamenta Informaticae
New Undecidability Results for Properties of Term Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Simplification Orderings: History Of Results
Fundamenta Informaticae
Diagrammatic confluence for constraint handling rules*
Theory and Practice of Logic Programming
A term rewriting system for the calculus of moving surfaces
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Silent transitions in automata with storage
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A cognitive architecture based on dual process theory
AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
Closed type families with overlapping equations
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Confluence of aspects for sequence diagrams
Software and Systems Modeling (SoSyM)
Theory of Computing Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |