Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

A Flexible Proof Format for SAT Solver-Elaborator Communication

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2022
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030187890409476
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5533
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2022
publishDateSort 2022
record_format rss_article
spellingShingle A Flexible Proof Format for SAT Solver-Elaborator Communication
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title A Flexible Proof Format for SAT Solver-Elaborator Communication
title_auth A Flexible Proof Format for SAT Solver-Elaborator Communication
title_full A Flexible Proof Format for SAT Solver-Elaborator Communication
title_fullStr A Flexible Proof Format for SAT Solver-Elaborator Communication
title_full_unstemmed A Flexible Proof Format for SAT Solver-Elaborator Communication
title_short A Flexible Proof Format for SAT Solver-Elaborator Communication
title_sort a flexible proof format for sat solver-elaborator communication
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.46298/lmcs-18(2:3)2022