Pages that link to "Item:Q3908476"

The following pages link to Variations on the Common Subexpression Problem (Q3908476):

Displaying 50 items.

• XML compression via directed acyclic graphs (Q269349) (← links)
• Symbol different term rewrite systems (Q492918) (← links)
• A language for generic programming in the large (Q532409) (← links)
• Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
• Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
• Another variation on the common subexpression problem (Q685700) (← links)
• A semantic approach to optimize linear datalog programs (Q854685) (← links)
• Fast congruence closure and extensions (Q876046) (← links)
• Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
• A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
• Mining approximate patterns with frequent locally optimal occurrences (Q906440) (← links)
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
• Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
• Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
• A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
• An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
• Fast algorithms for testing unsatisfiability of ground Horn clauses with equations (Q1100933) (← links)
• On the relationship of congruence closure and unification (Q1124338) (← links)
• Purging in an equality data base (Q1138393) (← links)
• Complexity, convexity and combinations of theories (Q1141138) (← links)
• On the computational complexity of cardinality constraints in relational databases (Q1154820) (← links)
• Natural language syntax and first-order inference (Q1193491) (← links)
• On finding common subtrees (Q1208722) (← links)
• A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
• Computing congruent closures on terms (Q1280915) (← links)
• Tree automata for code selection (Q1342507) (← links)
• Generalizations of algorithms that find invariant relationships in programs over algebra of terms (Q1364103) (← links)
• A rewriting approach to satisfiability procedures. (Q1401930) (← links)
• The tree equivalence of linear recursion schemes (Q1575234) (← links)
• The map equality domain (Q1629967) (← links)
• NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
• Encoding trees by linear recurrence sequences (Q1699391) (← links)
• Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
• Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
• Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
• Computing all subtree repeats in ordered trees (Q1941702) (← links)
• On rewriting rules in Mizar (Q1945908) (← links)
• Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
• Top tree compression of tries (Q2067669) (← links)
• Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
• Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)
• Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
• Supercharging plant configurations using Z3 (Q2117195) (← links)
• Compressed range minimum queries (Q2297849) (← links)
• Asymptotic enumeration of compacted binary trees of bounded right height (Q2299626) (← links)
• Extending SMT solvers to higher-order logic (Q2305406) (← links)
• Tree compression with top trees (Q2347804) (← links)
• Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
• Size-optimal top dag compression (Q2414042) (← links)
• Typed path polymorphism (Q2424892) (← links)