Foundations of logic programming
Foundations of logic programming
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
Term rewriting and all that
Decidability and complexity analysis by basic paramodulation
Information and Computation
The regular viewpoint on PA-processes
Theoretical Computer Science
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A General Framework for R-Unification Problems
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Deciding satisfiability of positive second order joinability formulae
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
In this paper, we study the class of pseudo-regular relations which is an extension of regular relations that weakens some restrictions on the ”synchronization” between tuple components of the relation. We choose logic programming as formalism to describe tree tuple languages (i.e. relations) and logic program transformation techniques for computing operations on them. We show that even if pseudo-regular cs-programs are syntactically less restrictive than regular ones, they define the same class of tree tuple languages. However, pseudo-regular relations allow one to define classes of term rewrite systems the transitive closure of which is a regular relation. We apply this result to give a decidable class of first order formulae based on the joinability predicate $\downarrow^{\rm ?}_{R}$ where R is a pseudo-regular term rewrite system.