×

Found 103 Documents (Results 1–100)

Newest Citations Relevance
Orvalho, Pedro; Manquinho, Vasco; Martins, Ruben

UpMax: user partitioning for MaxSAT. (English) Zbl 07949192

Mahajan, Meena (ed.) et al., 26th international conference on theory and applications of satisfiability testing, SAT 2023, Alghero, Italy, July 4–8, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 271, Article 19, 13 p. (2023).
MSC:  68Q25 68R07 68T20
Cite Review PDF
Full Text: DOI arXiv
Katsirelos, George

An analysis of core-guided maximum satisfiability solvers using linear programming. (English) Zbl 07949185

Mahajan, Meena (ed.) et al., 26th international conference on theory and applications of satisfiability testing, SAT 2023, Alghero, Italy, July 4–8, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 271, Article 12, 19 p. (2023).
MSC:  68Q25 68R07 68T20
Cite Review PDF
Full Text: DOI
Narodytska, Nina; Bjørner, Nikolaj

Analysis of core-guided maxsat using cores and correction sets. (English) Zbl 07880747

Meel, Kuldeep S. (ed.) et al., 25th international conference on theory and applications of satisfiability testing, SAT 2022, Haifa, Israel, August 2–5, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 236, Article 26, 20 p. (2022).
MSC:  68Q25 68R07 68T20
Cite Review PDF
Full Text: DOI
Niskanen, Andreas; Berg, Jeremias; Järvisalo, Matti

Incremental maximum satisfiability. (English) Zbl 07880735

Meel, Kuldeep S. (ed.) et al., 25th international conference on theory and applications of satisfiability testing, SAT 2022, Haifa, Israel, August 2–5, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 236, Article 14, 19 p. (2022).
MSC:  68Q25 68R07 68T20
Cite Review PDF
Full Text: DOI
Jabs, Christoph; Berg, Jeremias; Niskanen, Andreas; Järvisalo, Matti

MaxSAT-based bi-objective Boolean optimization. (English) Zbl 07880733

Meel, Kuldeep S. (ed.) et al., 25th international conference on theory and applications of satisfiability testing, SAT 2022, Haifa, Israel, August 2–5, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 236, Article 12, 23 p. (2022).
MSC:  68Q25 68R07 68T20
Cite Review PDF
Full Text: DOI
Berg, Jeremias; Demirović, Emir; Stuckey, Peter J.

Core-boosted linear search for incomplete MaxSAT. (English) Zbl 1525.68140

Rousseau, Louis-Martin (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 16th international conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11494, 39-56 (2019).
MSC:  68T20
Cite Review PDF
Full Text: DOI Link
Boumarafi, Yazid M.; Sais, Lakhdar; Salhi, Yakoub

From SAT to maximum independent set: a new approach to characterize tractable classes. (English) Zbl 1403.68073

Eiter, Thomas (ed.) et al., LPAR-21. 21st international conference on logic for programming, artificial intelligence and reasoning, Maun, Botswana, May 8–12, 2017. Selected papers. Manchester: EasyChair. EPiC Series in Computing 46, 286-299 (2017).
MSC:  68Q25 05C69 68T20
Cite Review PDF
Full Text: DOI
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi

Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression. (English) Zbl 1398.68259

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 82, 16 p. (2016).
MSC:  68Q25 68Q17 94C10
Cite Review PDF
Full Text: DOI
Zhang, Xin; Mangal, Ravi; Nori, Aditya V.; Naik, Mayur

Query-guided maximum satisfiability. (English) Zbl 1347.68188

Bodik, Rastislav (ed.) et al., Proceedings of the 43rd annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’16, St. Petersburg, FL, USA, January 20–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3549-2). 109-122 (2016).
MSC:  68Q25 68N30 68P20 68T20
Cite Review PDF
Full Text: DOI
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi

Improved exact algorithms for mildly sparse instances of MAX SAT. (English) Zbl 1378.68091

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 90-101 (2015).
MSC:  68Q25 68W40
Cite Review PDF
Full Text: DOI
Bouhmala, Noureddine; Hjelmervik, Karina; Øvergaard, Kjell Ivar

A generalized variable neighborhood search for combinatorial optimization problems. (English) Zbl 1362.90319

Jarboui, Bassem (ed.) et al., Selected short papers of the 3rd international conference on variable neighborhood search (VNS’14), Djerba, Tunisia, October 8–11, 2014. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 47, 45-52, electronic only (2015).
MSC:  90C27 90C59
Cite Review PDF
Full Text: DOI
Tamaki, Suguru; Yoshida, Yuichi

Robust approximation of temporal CSP. (English) Zbl 1359.68144

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 17th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2014) and the 18th international workshop on randomization and computation (RANDOM 2014), Universitat Politècnica de Catalunya, Barcelona, Spain, September 4–6, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-74-3). LIPIcs – Leibniz International Proceedings in Informatics 28, 419-432 (2014).
MSC:  68Q25 68Q17 68W25
Cite Review PDF
Full Text: DOI
Golovnev, Alexander

New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree. (English) Zbl 1352.68107

Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 106-117 (2012).
MSC:  68Q25 68Q17
Cite Review PDF
Full Text: DOI
Szeider, Stefan

Not so easy problems for tree decomposable graphs. (English) Zbl 1231.05252

Acharya, B. D. (ed.) et al., Advances in discrete mathematics and applications: Mysore, 2008. Proceedings of the international conference on discrete mathematics (ICDM 2008), Mysore, India, June 6–10, 2008. Mysore: Ramanujan Mathematical Society (ISBN 978-93-80416-03-8/hbk). Ramanujan Mathematical Society Lecture Notes Series 13, 179-190 (2010).
MSC:  05C85 05C15 05C70 68Q25 68R10
Cite Review PDF
Full Text: arXiv
Porschen, Stefan

On some weighted satisfiability and graph problems. (English) Zbl 1117.68382

Vojtáš, Peter (ed.) et al., SOFSEM 2005: Theory and practice of computer science. 31st conference on current trends in theory and practice of computer science, Liptovský Ján, Slovakia, January 22–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24302-X/pbk). Lecture Notes in Computer Science 3381, 278-287 (2005).
MSC:  68Q25 68Q17 68R10 68W05
Cite Review PDF
Full Text: DOI
Drias, Habiba; Khabzaoui, Mohamed

Scatter search with random walk strategy for SAT and MAX-W-SAT problems. (English) Zbl 0981.68637

Monostori, László (ed.) et al., Engineering of intelligent systems. 14th international conference on industrial and engineering applications of artificial intelligence and expert systems, IEA/AIE 2001, Budapest, Hungary, June 4-7, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2070, 35-44 (2001).
MSC:  68U99 68P10
Cite Review PDF
Full Text: Link
Wallace, Richard J.; Freuder, Eugene C.

Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. (English) Zbl 0859.68072

Johnson, David S. (ed.) et al., Cliques, coloring, and satisfiability. Second DIMACS implementation challenge. Proceedings of a workshop held at DIMACS, October 11–13, 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 587-615 (1996).
MSC:  68R99 68Q25 05A99 00B25
Cite Review PDF
Cheriyan, J.; Cunningham, W. H.; Tunçel, L.; Wang, Y.

A linear programming and rounding approach to max 2-sat. (English) Zbl 0864.90102

Johnson, David S. (ed.) et al., Cliques, coloring, and satisfiability. Second DIMACS implementation challenge. Proceedings of a workshop held at DIMACS, October 11–13, 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 395-414 (1996).
MSC:  90C27 90C35 90C10
Cite Review PDF

Filter Results by …

Access

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software