Automatic synthesis of optimal-size concentrators by answer set programming

DOI10.1007/978-3-319-61660-5_25MaRDI QIDQ2401945zbMATH OpenOpenAlexFDO

Authors Marc Dahlem, Tripti Jain, Klaus Schneider, Michael Gillmann

Publication date 5 September 2017

Full work available at URL https://doi.org/10.1007/978-3-319-61660-5_25

Mathematics Subject Classification ID

Logic programming (68N17) Networks and circuits as models of computation; circuit complexity (68Q06) Parallel algorithms in computer science (68W10)

Recommendations

• Synthesizing concurrent programs using answer set programming
• Using combinatorial designs to construct partial concentrators
• Asymptotic results for partial concentrators
• Self-routing superconcentrators
• Natural bounded concentrators

Describes a project that uses

Uses Software

• clasp

This page was built for publication: Automatic synthesis of optimal-size concentrators by answer set programming

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