@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},
    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 = {Sun, 04 Aug 2024 01:00:00 +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}
}

{"_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","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":"Sun, 04 Aug 2024 01:00:00 +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","bibtex":"@inproceedings{DBLP:conf/jelia/ArecesCCFS23,\n author = {Carlos Areces and\nValentin Cassano and\nPablo F. Castro and\nRaul Fervari and\nAndr{\\'{e}}s R. Saravia},\n bibsource = {dblp computer science bibliography, https://dblp.org},\n biburl = {https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib},\n booktitle = {Logics in Artificial Intelligence - 18th European Conference, {JELIA}\n2023, Dresden, Germany, September 20-22, 2023, Proceedings},\n doi = {10.1007/978-3-031-43619-2\\_28},\n editor = {Sarah Alice Gaggl and\nMaria Vanina Martinez and\nMagdalena Ortiz},\n pages = {405--419},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},\n title = {How Easy it is to Know How: An Upper Bound for the Satisfiability\nProblem},\n url = {https://doi.org/10.1007/978-3-031-43619-2\\_28},\n volume = {14281},\n year = {2023}\n}\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":["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}