How Easy it is to Know How: An Upper Bound for the Satisfiability Problem. Areces, C., Cassano, V., Castro, P. F., Fervari, R., & Saravia, A. R. In Gaggl, S. A., Martinez, M. V., & Ortiz, M., editors, Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings, volume 14281, of Lecture Notes in Computer Science, pages 405–419, 2023. Springer. ![How Easy it is to Know How: An Upper Bound for the Satisfiability Problem [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex @inproceedings{DBLP:conf/jelia/ArecesCCFS23,
author = {Carlos Areces and Valentin Cassano and Pablo F. Castro and Raul Fervari and Andr{\'{e}}s R. Saravia},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib},
booktitle = {Logics in Artificial Intelligence - 18th European Conference, {JELIA} 2023, Dresden, Germany, September 20-22, 2023, Proceedings},
date-added = {2023-12-05 16:05:52 -0300},
date-modified = {2023-12-05 16:05:52 -0300},
doi = {10.1007/978-3-031-43619-2\_28},
editor = {Sarah Alice Gaggl and Maria Vanina Martinez and Magdalena Ortiz},
pages = {405--419},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {Thu, 28 Sep 2023 17:18:56 +0200},
title = {How Easy it is to Know How: An Upper Bound for the Satisfiability Problem},
url = {https://doi.org/10.1007/978-3-031-43619-2\_28},
volume = {14281},
year = {2023},
bdsk-url-1 = {https://dblp.org/rec/conf/jelia/ArecesCCFS23},
bdsk-url-2 = {https://doi.org/10.1007/978-3-031-43619-2_28}}
Downloads: 0
{"_id":"dZNrRYgRnp9XBhEfP","bibbaseid":"areces-cassano-castro-fervari-saravia-howeasyitistoknowhowanupperboundforthesatisfiabilityproblem-2023","author_short":["Areces, C.","Cassano, V.","Castro, P. F.","Fervari, R.","Saravia, A. R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Carlos"],"propositions":[],"lastnames":["Areces"],"suffixes":[]},{"firstnames":["Valentin"],"propositions":[],"lastnames":["Cassano"],"suffixes":[]},{"firstnames":["Pablo","F."],"propositions":[],"lastnames":["Castro"],"suffixes":[]},{"firstnames":["Raul"],"propositions":[],"lastnames":["Fervari"],"suffixes":[]},{"firstnames":["Andrés","R."],"propositions":[],"lastnames":["Saravia"],"suffixes":[]}],"bibsource":"dblp computer science bibliography, https://dblp.org","biburl":"https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib","booktitle":"Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings","date-added":"2023-12-05 16:05:52 -0300","date-modified":"2023-12-05 16:05:52 -0300","doi":"10.1007/978-3-031-43619-2_28","editor":[{"firstnames":["Sarah","Alice"],"propositions":[],"lastnames":["Gaggl"],"suffixes":[]},{"firstnames":["Maria","Vanina"],"propositions":[],"lastnames":["Martinez"],"suffixes":[]},{"firstnames":["Magdalena"],"propositions":[],"lastnames":["Ortiz"],"suffixes":[]}],"pages":"405–419","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"Thu, 28 Sep 2023 17:18:56 +0200","title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","url":"https://doi.org/10.1007/978-3-031-43619-2\\_28","volume":"14281","year":"2023","bdsk-url-1":"https://dblp.org/rec/conf/jelia/ArecesCCFS23","bdsk-url-2":"https://doi.org/10.1007/978-3-031-43619-2_28","bibtex":"@inproceedings{DBLP:conf/jelia/ArecesCCFS23,\n\tauthor = {Carlos Areces and Valentin Cassano and Pablo F. Castro and Raul Fervari and Andr{\\'{e}}s R. Saravia},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib},\n\tbooktitle = {Logics in Artificial Intelligence - 18th European Conference, {JELIA} 2023, Dresden, Germany, September 20-22, 2023, Proceedings},\n\tdate-added = {2023-12-05 16:05:52 -0300},\n\tdate-modified = {2023-12-05 16:05:52 -0300},\n\tdoi = {10.1007/978-3-031-43619-2\\_28},\n\teditor = {Sarah Alice Gaggl and Maria Vanina Martinez and Magdalena Ortiz},\n\tpages = {405--419},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Thu, 28 Sep 2023 17:18:56 +0200},\n\ttitle = {How Easy it is to Know How: An Upper Bound for the Satisfiability Problem},\n\turl = {https://doi.org/10.1007/978-3-031-43619-2\\_28},\n\tvolume = {14281},\n\tyear = {2023},\n\tbdsk-url-1 = {https://dblp.org/rec/conf/jelia/ArecesCCFS23},\n\tbdsk-url-2 = {https://doi.org/10.1007/978-3-031-43619-2_28}}\n\n","author_short":["Areces, C.","Cassano, V.","Castro, P. F.","Fervari, R.","Saravia, A. R."],"editor_short":["Gaggl, S. A.","Martinez, M. V.","Ortiz, M."],"key":"DBLP:conf/jelia/ArecesCCFS23","id":"DBLP:conf/jelia/ArecesCCFS23","bibbaseid":"areces-cassano-castro-fervari-saravia-howeasyitistoknowhowanupperboundforthesatisfiabilityproblem-2023","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-031-43619-2\\_28"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://mfis.dc.exa.unrc.edu.ar/downloads/mfis-pubs.bib","dataSources":["HJM7dqFRHjcZZmjge","MSnnygamX7qXNxsq6","KKtjZs868TWfeLxN2","CctimS4AgKgzGybH5"],"keywords":[],"search_terms":["easy","know","upper","bound","satisfiability","problem","areces","cassano","castro","fervari","saravia"],"title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","year":2023}