The first-order theory of ordering constraints over feature trees

zbMATH Open0981.68081MaRDI QIDQ2752467FDOQ2752467

Ralf Treinen, Joachim Niehren, Martin Müller

Publication date: 7 January 2002

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227586

zbMATH Keywords

automatafeature constraintslogic of trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• Title not available (Why is that?)
• Deciding the first-order theory of an algebra of feature trees with updates
• Ordering constraints over feature trees expressed in second-order monadic logic.

Uses Software

• Oz

   Recommendations

• Ordering constraints over feature trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Ordering constraints over feature trees expressed in second-order monadic logic. 👍 👎
• Solving First-Order Constraints in the Theory of the Evaluated Trees 👍 👎
• Solving First-Order Constraints in the Theory of the Evaluated Trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Deciding the first-order theory of an algebra of feature trees with updates 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees 👍 👎

This page was built for publication: The first-order theory of ordering constraints over feature trees

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