… For this reason, we will define a finite-tree analysis based on the abstract domain
schema H×P, where the generic sharing component P is a parameter of the abstract domain …

… In the sequel, in order to model the constraint accumulation process of logic-based languages,
we will need to characterize those sets of equations that are stronger than (that can be …

… In the sequel, in order to model the constraint accumulation process of logicbased languages,
we will need to characterize those sets of equations that are stronger than (that can be …

… In the sequel, in order to model the constraint accumulation process of logicbased languages,
we will need to characterize those sets of equations that are stronger than (that can be …

… Logic programming language with Horn clauses is both logic-based and rule-based, so it is
widely accepted as a tool … A decision tree on A is a finite tree with the following restrictions: …

… of finite tree automata provides fundamental notations and tools for reasoning about sets
of terms called regular or recognizable tree languages. … language, grammar and set-constraint-…

… Many logic-based languages refer to a computation domain … domain, H × P, for finitetree
analysis. The H domain, written … we want the concrete constraint accumulation process to be …

… logic based natural language systems have not attempted to employ CLP. Our framework
and the prototype system UBS combines logic programming with constraint … be a finite tree …

… tree language recognition problem. The latter can then be solved via a finite tree automaton
(… In the first place, we thus compare the expressive power of two query languages. However, …

… Similarly, a data tree is an unranked ordered finite tree, whose every … languages over a
finite alphabet A. In particular, we use that a word … This work investigates a logic based on LTL …