SMTS: Distributed, Visualized Constraint Solving

DOI10.29007/FHGNzbMATH Open1415.68197OpenAlexW2906882231MaRDI QIDQ5222977FDOQ5222977

Authors: Matteo Marescotti, Antti E. J. Hyvärinen, Natasha Sharygina 

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/fhgn

Recommendations

• A system for solving constraint satisfaction problems with SMT
• scientific article; zbMATH DE number 1975621
• Solving distributed constraint optimization problems using logic programming
• Constraint satisfaction in distributed concurrent logic programming
• scientific article
• Parallelizing SMT solving: lazy decomposition and conciliation
• Boosting Distributed Constraint Satisfaction

zbMATH Keywords

algorithm portfoliosdivide and conquerdistributed IC3distributed SMTweb-based GUI

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Cited In (3)

• Title not available (Why is that?)
• SMTS
• Distributed bounded model checking

Uses Software

• Chaff
• OpenSMT2
• PKind
• APT

This page was built for publication: SMTS: Distributed, Visualized Constraint Solving

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