History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Unification problems with one-sided distributivity
Journal of Symbolic Computation
IEEE Transactions on Software Engineering
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
Journal of Symbolic Computation
Journal of Symbolic Computation
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Moded type systems for logic programming
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unification in Boolean Rings and Abelian Groups
Journal of Symbolic Computation
A strong restriction of the inductive completion procedure
Journal of Symbolic Computation
Unification in permutative equational theories is undecidable
Journal of Symbolic Computation
A rewrite-based type discipline for a subset of computer algebra
Journal of Symbolic Computation
Higher-order equational logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Equations, sets, and reduction semantics for functional and logic programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Journal of the ACM (JACM)
Constraints in computational logics
Functional and constraint logic programming
Constraints in computational logics
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equational logic programming: an extension to equational programming
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The narrowing-driven approach to functional logic program specialization
New Generation Computing - Partial evaluation and program transformation
Solution of the Robbins Problem
Journal of Automated Reasoning
Complete Strategies for Term Graph Narrowing
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
A Complete Selection Function for Lazy Conditional Narrowing
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Reducing Search Space in Solving Higher-Order Equations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
A Model-Based Completeness Proof of Extended Narrowing and Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A New Rewrite Method for Convergence of Self-Stabilizing Systems
Proceedings of the 13th International Symposium on Distributed Computing
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The unification problem for confluent right-ground term rewriting systems
Information and Computation - RTA 2001
Refining weakly outermost-needed rewriting and narrowing
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Journal of Automated Reasoning
Higher-order narrowing with definitional trees
Journal of Functional Programming
Leftmost outside-in narrowing calculi
Journal of Functional Programming
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic Programming
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
Complete symbolic reachability analysis using back-and-forth narrowing
Theoretical Computer Science - Algebra and coalgebra in computer science
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination of Narrowing Using Dependency Pairs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics
Applications of Declarative Programming and Knowledge Management
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
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
Termination of narrowing revisited
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Programming with narrowing: A tutorial
Journal of Symbolic Computation
Cap unification: application to protocol security modulo homomorphic encryption
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Key substitution in the symbolic analysis of cryptographic protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Termination of narrowing in left-linear constructor systems
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Order-sorted parameterization and induction
Semantics and algebraic specification
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Transformation and debugging of functional logic programs
A 25-year perspective on logic programming
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Learning-based testing for reactive systems using term rewriting technology
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Well-typed narrowing with extra variables in functional-logic programming
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Decidability of Equivalence of Symbolic Derivations
Journal of Automated Reasoning
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The finite variant property: how to get rid of some algebraic properties
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
Complete symbolic reachability analysis using back-and-forth narrowing
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A new approach to inferences of semantic constraints
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Towards the uniform implementation of declarative languages
Computer Languages
Lazy narrowing with simplification
Computer Languages
S-Narrowing for constructor systems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Narrowing Strategies For Arbitrary Canonical Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |