@inproceedings{DBLP:conf/jelia/ArecesCCFS23,
  author       = {Carlos Areces and
                  Valentin Cassano and
                  Pablo F. Castro and
                  Raul Fervari and
                  Andr{\'{e}}s R. Saravia},
  editor       = {Sarah Alice Gaggl and
                  Maria Vanina Martinez and
                  Magdalena Ortiz},
  title        = {How Easy it is to Know How: An Upper Bound for the Satisfiability
                  Problem},
  booktitle    = {Logics in Artificial Intelligence - 18th European Conference, {JELIA}
                  2023, Dresden, Germany, September 20-22, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14281},
  pages        = {405--419},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-43619-2\_28},
  doi          = {10.1007/978-3-031-43619-2\_28},
  timestamp    = {Thu, 28 Sep 2023 17:18:56 +0200},
  biburl       = {https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_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":[]}],"editor":[{"firstnames":["Sarah","Alice"],"propositions":[],"lastnames":["Gaggl"],"suffixes":[]},{"firstnames":["Maria","Vanina"],"propositions":[],"lastnames":["Martinez"],"suffixes":[]},{"firstnames":["Magdalena"],"propositions":[],"lastnames":["Ortiz"],"suffixes":[]}],"title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","booktitle":"Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings","series":"Lecture Notes in Computer Science","volume":"14281","pages":"405–419","publisher":"Springer","year":"2023","url":"https://doi.org/10.1007/978-3-031-43619-2\\_28","doi":"10.1007/978-3-031-43619-2_28","timestamp":"Thu, 28 Sep 2023 17:18:56 +0200","biburl":"https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/jelia/ArecesCCFS23,\n author = {Carlos Areces and\n Valentin Cassano and\n Pablo F. Castro and\n Raul Fervari and\n Andr{\\'{e}}s R. Saravia},\n editor = {Sarah Alice Gaggl and\n Maria Vanina Martinez and\n Magdalena Ortiz},\n title = {How Easy it is to Know How: An Upper Bound for the Satisfiability\n Problem},\n booktitle = {Logics in Artificial Intelligence - 18th European Conference, {JELIA}\n 2023, Dresden, Germany, September 20-22, 2023, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {14281},\n pages = {405--419},\n publisher = {Springer},\n year = {2023},\n url = {https://doi.org/10.1007/978-3-031-43619-2\\_28},\n doi = {10.1007/978-3-031-43619-2\\_28},\n timestamp = {Thu, 28 Sep 2023 17:18:56 +0200},\n biburl = {https://dblp.org/rec/conf/jelia/ArecesCCFS23.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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://dblp.org/pid/117/9953.bib","dataSources":["HJM7dqFRHjcZZmjge","CctimS4AgKgzGybH5","MSnnygamX7qXNxsq6"],"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}