Sciweavers

CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
EPIA
1993
Springer
13 years 10 months ago
Resolution of Constraints in Algebras of Rational Trees
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
Luís Damas, Nelma Moreira, Sabine Broda
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
13 years 10 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
LPAR
2001
Springer
13 years 10 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...