Scheduling complexity of interleaving search

DOI10.1007/978-3-030-99461-7_9MaRDI QIDQ2163166zbMATH OpenOpenAlexFDO

Authors Dmitry Rozplokhas, Dmitry Boulytchev

Publication date 10 August 2022

Full work available at URL https://arxiv.org/abs/2202.08511

zbMATH Keywords

time complexitysymbolic execution\textsc{miniKanren}interleaving search

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Recommendations

• Certified semantics for relational programming
• Independence in dynamically scheduled logic languages
• scientific article; zbMATH DE number 1332641
• Algebraic and logical semantics for CLP languages with dynamic scheduling
• scientific article; zbMATH DE number 1420818

Cites work

• Average-case analysis of unification algorithms
• Backtracking, interleaving, and terminating monad transformers (functional pearl)
• Certified semantics for relational programming
• Relational synthesis for pattern matching
• Unification theory

Describes a project that uses

Uses Software

• KANREN
• miniKanren

This page was built for publication: Scheduling complexity of interleaving search

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