×

zbMATH — the first resource for mathematics

Found 112 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Berg, Jeremias; Järvisalo, Matti
Unifying reasoning and core-guided search for maximum satisfiability. (English) Zbl 07169113
Calimeri, Francesco (ed.) et al., Logics in artificial intelligence. 16th European conference, JELIA 2019, Rende, Italy, May 7–11, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-19569-4/pbk; 978-3-030-19570-0/ebook). Lecture Notes in Computer Science 11468. Lecture Notes in Artificial Intelligence, 287-303 (2019).
MSC:  68T27
PDF BibTeX XML Cite
\textit{J. Berg} and \textit{M. Järvisalo}, Lect. Notes Comput. Sci. 11468, 287--303 (2019; Zbl 07169113)
Full Text: DOI
Berg, Jeremias; Demirović, Emir; Stuckey, Peter J.
Core-boosted linear search for incomplete MaxSAT. (English) Zbl 07116684
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 (ISBN 978-3-030-19211-2/pbk; 978-3-030-19212-9/ebook). Lecture Notes in Computer Science 11494, 39-56 (2019).
MSC:  68T20 90C27
PDF BibTeX XML Cite
\textit{J. Berg} et al., Lect. Notes Comput. Sci. 11494, 39--56 (2019; Zbl 07116684)
Full Text: DOI
Chimani, Markus; Hedtke, Ivo; Wiedera, Tilo
Exact algorithms for the maximum planar subgraph problem: new models and experiments. (English) Zbl 07286695
D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-070-5). LIPIcs – Leibniz International Proceedings in Informatics 103, Article 22, 15 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{M. Chimani} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 22, 15 p. (2018; Zbl 07286695)
Full Text: DOI
Belova, Tatiana; Bliznets, Ivan
Upper and lower bounds for different parameterizations of (n,3)-MAXSAT. (English) Zbl 07116388
Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer (ISBN 978-3-030-04650-7/pbk; 978-3-030-04651-4/ebook). Lecture Notes in Computer Science 11346, 299-313 (2018).
MSC:  68T20 90C27
PDF BibTeX XML Cite
\textit{T. Belova} and \textit{I. Bliznets}, Lect. Notes Comput. Sci. 11346, 299--313 (2018; Zbl 07116388)
Full Text: DOI
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
PDF BibTeX XML Cite
\textit{Y. M. Boumarafi} et al., EPiC Ser. Comput. 46, 286--299 (2017; Zbl 1403.68073)
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
PDF BibTeX XML Cite
\textit{T. Sakai} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 82, 16 p. (2016; Zbl 1398.68259)
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
PDF BibTeX XML Cite
\textit{X. Zhang} et al., in: 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). 109--122 (2016; Zbl 1347.68188)
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
PDF BibTeX XML Cite
\textit{T. Sakai} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 90--101 (2015; Zbl 1378.68091)
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
PDF BibTeX XML Cite
\textit{N. Bouhmala} et al., Electron. Notes Discrete Math. 47, 45--52 (2015; Zbl 1362.90319)
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
PDF BibTeX XML Cite
\textit{S. Tamaki} and \textit{Y. Yoshida}, LIPIcs -- Leibniz Int. Proc. Inform. 28, 419--432 (2014; Zbl 1359.68144)
Full Text: DOI
Bliznets, Ivan; Golovnev, Alexander
A new algorithm for parameterized MAX-SAT. (English) Zbl 1360.68494
Thilikos, Dimitrios M. (ed.) et al., Parameterized and exact computation. 7th international symposium, IPEC 2012, Ljubljana, Slovenia, September 12–14, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33292-0/pbk). Lecture Notes in Computer Science 7535, 37-48 (2012).
MSC:  68Q25 68W05
PDF BibTeX XML Cite
\textit{I. Bliznets} and \textit{A. Golovnev}, Lect. Notes Comput. Sci. 7535, 37--48 (2012; Zbl 1360.68494)
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
PDF BibTeX XML Cite
\textit{A. Golovnev}, Lect. Notes Comput. Sci. 7112, 106--117 (2012; Zbl 1352.68107)
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
PDF BibTeX XML Cite
\textit{S. Szeider}, Ramanujan Math. Soc. Lect. Notes Ser. 13, 179--190 (2010; Zbl 1231.05252)
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
PDF BibTeX XML Cite
\textit{S. Porschen}, Lect. Notes Comput. Sci. 3381, 278--287 (2005; Zbl 1117.68382)
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
PDF BibTeX XML Cite
\textit{H. Drias} and \textit{M. Khabzaoui}, Lect. Notes Comput. Sci. 2070, 35--44 (2001; Zbl 0981.68637)
Full Text: Link
Hansen, Pierre; Jaumard, Brigitte
Probabilistic satisfiability. (English) Zbl 1015.68198
Gabbay, Dov M. (ed.) et al., Handbook of defeasible reasoning and uncertainty management systems. Vol. 5: Algorithms for uncertainty and defeasible reasoning. Dordrecht: Kluwer Academic Publishers. 321-367 (2000).
MSC:  68T35
PDF BibTeX XML Cite
\textit{P. Hansen} and \textit{B. Jaumard}, in: Handbook of defeasible reasoning and uncertainty management systems. Vol. 5: Algorithms for uncertainty and defeasible reasoning. Dordrecht: Kluwer Academic Publishers. 321--367 (2000; Zbl 1015.68198)
Asano, Takao; Williamson, David P.
Improved approximation algorithms for MAX SAT. (English) Zbl 0952.90019
Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 96-105 (2000).
MSC:  90B80
PDF BibTeX XML Cite
\textit{T. Asano} and \textit{D. P. Williamson}, in: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms, SODA 2000, San Francisco, CA, USA, January 9--11, 2000. Philadelphia, PA: SIAM. 96--105 (2000; Zbl 0952.90019)
Resende, M. G. C.; Pitsoulis, L. S.; Pardalos, P. M.
Approximate solution of weighted MAX-SAT problems using GRASP. (English) Zbl 0889.68139
Du, Dingzhu (ed.) et al., Satisfiability problem: theory and applications. DIMACS workshop, Piscataway, NJ, USA, March 11-13, 1996. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 35, 393-405 (1997).
MSC:  68T20 68P20 68R05
PDF BibTeX XML Cite
\textit{M. G. C. Resende} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 35, 393--405 (1997; Zbl 0889.68139)
Fleurent, Charles; Ferland, Jacques A.
Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. (English) Zbl 0864.90118
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, 619-652 (1996).
MSC:  90C35 68R10 90C09
PDF BibTeX XML Cite
\textit{C. Fleurent} and \textit{J. A. Ferland}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 619--652 (1996; Zbl 0864.90118)
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
PDF BibTeX XML Cite
\textit{R. J. Wallace} and \textit{E. C. Freuder}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 587--615 (1996; Zbl 0859.68072)
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
PDF BibTeX XML Cite
\textit{J. Cheriyan} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 395--414 (1996; Zbl 0864.90102)

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
all top 3
Software