Incremental Maximum Satisfiability

Andreas Niskanen; Jeremias Berg; Matti Järvisalo

Incremental Maximum Satisfiability

Andreas Niskanen, Jeremias Berg, Matti Järvisalo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

Original language	English
Title of host publication	Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication status	Accepted/In press - 2022
MoE publication type	A4 Article in conference proceedings

Fields of Science

113 Computer and information sciences

2 Active

Symbolic Techniques for Formally Verified and Explainable AI
Järvisalo, M.
01/01/2020 → 31/12/2022
Project: Research project
Declarative Boolean Optimization: Pushing the Envelope
Järvisalo, M.
01/09/2019 → 31/08/2023
Project: Research project

Cite this

@inproceedings{49d5b80d21a64a47baab4fb1e753f405,

title = "Incremental Maximum Satisfiability",

keywords = "113 Computer and information sciences",

author = "Andreas Niskanen and Jeremias Berg and Matti J{\"a}rvisalo",

year = "2022",

language = "English",

booktitle = "Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",

address = "Germany",

}

Incremental Maximum Satisfiability. / Niskanen, Andreas ; Berg, Jeremias ; Järvisalo, Matti.

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Incremental Maximum Satisfiability

AU - Niskanen, Andreas

AU - Berg, Jeremias

AU - Järvisalo, Matti

PY - 2022

Y1 - 2022

KW - 113 Computer and information sciences

M3 - Conference contribution

BT - Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

ER -

Incremental Maximum Satisfiability

Fields of Science

Projects

Symbolic Techniques for Formally Verified and Explainable AI

Declarative Boolean Optimization: Pushing the Envelope

Cite this