Finite and Rational Tree Constraints

DOI10.1093/JIGPAL/2.2.167MaRDI QIDQ4318170zbMATH OpenOpenAlexFDO

Authors Torbjörn Keisu

Publication date 20 April 1995

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/2.2.167

zbMATH Keywords

algorithmsClark equality theoryconcurrent programming languageconjunctive normal formdecision procedurefirst-order equality theory over a Herbrand universerational treessatisfiability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Theory of programming languages (68N15) Logic programming (68N17)

Recommendations

• Linear constraints over infinite trees
• scientific article; zbMATH DE number 1696804
• On tree-preserving constraints
• The tree Constraint
• scientific article; zbMATH DE number 2085189
• Global numerical constraints on trees
• Properties of tree convex constraints
• scientific article; zbMATH DE number 2080306

Cited in

(8)

• Rational tree relations
• Situated simplification
• Linear constraints over infinite trees
• A complete axiomatization of strict equality
• scientific article; zbMATH DE number 2079035 (Why is no real title available?)
• scientific article; zbMATH DE number 1832223 (Why is no real title available?)
• Equational and membership constraints for infinite trees
• Decidable inequalities over infinite trees

This page was built for publication: Finite and Rational Tree Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318170)