Building and combining matching algorithms

DOI10.1007/978-3-030-22102-7_24zbMATH Open1444.68089OpenAlexW2955302716MaRDI QIDQ2185488FDOQ2185488

Christophe Ringeissen

Publication date: 4 June 2020

Full work available at URL: https://hal.inria.fr/hal-02187244/file/survey-combi-matching.pdf

zbMATH Keywords

matchingunificationcombination of theoriessyntactic theories

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Cited In (1)

• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Solving (large scale) matching problems combinatorially 👍 👎
• An algebraic matching algorithm 👍 👎
• Combining matching algorithms: The regular case 👍 👎
• On the support of matching algorithms 👍 👎
• A short note on matching algorithms 👍 👎
• Combining matching algorithms: The regular case 👍 👎
• Dynamic Matching Algorithms in Practice 👍 👎

This page was built for publication: Building and combining matching algorithms

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