{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:54:40Z","timestamp":1762300480165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436185"},{"type":"electronic","value":"9783031436192"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43619-2_28","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"405-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["How Easy it is to\u00a0Know How: An Upper Bound for\u00a0the\u00a0Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Areces","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Cassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo F.","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Fervari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s R.","family":"Saravia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Areces, C., Fervari, R., Saravia, A.R., Vel\u00e1zquez-Quesada, F.R.: Uncertainty-based semantics for multi-agent knowing how logics. In: 18th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2021). EPTCS, vol. 335, pp. 23\u201337. Open Publishing Association (2021)","key":"28_CR1","DOI":"10.4204\/EPTCS.335.3"},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, Cambridge (2009)","edition":"1"},{"unstructured":"Baltag, A.: To know is to know the value of a variable. In: Advances in Modal Logic (AiML 2016), vol. 11, pp. 135\u2013155. College Publications (2016)","key":"28_CR3"},{"key":"28_CR4","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2022","unstructured":"Cormen, T., Leiserson, C., Rivest, R.L., Stein, C.: Introduction to Algorithms, 4th edn. MIT Press, Cambridge (2022)","edition":"4"},{"doi-asserted-by":"crossref","unstructured":"Demri, S., Fervari, R.: Model-checking for ability-based logics with constrained plans. In: 37th AAAI Conference on Artificial Intelligence (AAAI 2023), pp. 6305\u20136312. AAAI Press (2023)","key":"28_CR5","DOI":"10.1609\/aaai.v37i5.25776"},{"unstructured":"van Ditmarsch, H., Halpern, J.Y., van der Hoek, W., Kooi, B. (eds.): Handbook of Epistemic Logic. College Publications, Georgia (2015)","key":"28_CR6"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S1755020314000343","volume":"8","author":"J Fan","year":"2015","unstructured":"Fan, J., Wang, Y., van Ditmarsch, H.: Contingency and knowing whether. Rev. Symbolic Logic 8, 75\u2013107 (2015)","journal-title":"Rev. Symbolic Logic"},{"unstructured":"Fantl, J.: Knowledge how. In: The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, spring 2021 edn. (2021)","key":"28_CR8"},{"doi-asserted-by":"crossref","unstructured":"Fervari, R., Herzig, A., Li, Y., Wang, Y.: Strategically knowing how. In: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 1031\u20131038. International Joint Conferences on Artificial Intelligence (2017)","key":"28_CR9","DOI":"10.24963\/ijcai.2017\/143"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1017\/S1755020321000101","volume":"15","author":"R Fervari","year":"2022","unstructured":"Fervari, R., Vel\u00e1zquez-Quesada, F.R., Wang, Y.: Bisimulations for knowing how logics. Rev. Symbolic Logic 15(2), 450\u2013486 (2022)","journal-title":"Rev. Symbolic Logic"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/2.1.5","volume":"2","author":"V Goranko","year":"1992","unstructured":"Goranko, V., Passy, S.: Using the universal modality: gains and questions. J. Log. Comput. 2(1), 5\u201330 (1992)","journal-title":"J. Log. Comput."},{"unstructured":"Gu, T., Wang, Y.: \u201cKnowing value\u201d logic as a normal modal logic. In: Advances in Modal Logic (AiML 2016), vol. 11, pp. 362\u2013381. College Publications (2016)","key":"28_CR12"},{"issue":"5","key":"28_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10458-014-9267-z","volume":"29","author":"A Herzig","year":"2015","unstructured":"Herzig, A.: Logics of knowledge and action: critical analysis and challenges. Auton. Agent. Multi-Agent Syst. 29(5), 719\u2013753 (2015)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"doi-asserted-by":"crossref","unstructured":"Herzig, A., Troquard, N.: Knowing how to play: uniform choices in logics of agency. In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), pp. 209\u2013216. ACM (2006)","key":"28_CR14","DOI":"10.1145\/1160633.1160666"},{"key":"28_CR15","volume-title":"Knowledge and Belief","author":"J Hintikka","year":"1962","unstructured":"Hintikka, J.: Knowledge and Belief. Cornell University Press, Ithaca (1962)"},{"doi-asserted-by":"crossref","unstructured":"van der Hoek, W., Lomuscio, A.: Ignore at your peril - towards a logic for ignorance. In: 2nd International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2003), pp. 1148\u20131149. ACM (2003)","key":"28_CR16","DOI":"10.1145\/860575.860839"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.3166\/jancl.17.423-475","volume":"17","author":"W Jamroga","year":"2007","unstructured":"Jamroga, W., \u00c5gotnes, T.: Constructive knowledge: what agents can achieve under imperfect information. J. Appl. Non Class. Logics 17(4), 423\u2013475 (2007)","journal-title":"J. Appl. Non Class. Logics"},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1026761331498","volume":"66","author":"Y Lesp\u00e9rance","year":"2000","unstructured":"Lesp\u00e9rance, Y., Levesque, H.J., Lin, F., Scherl, R.B.: Ability and knowing how in the situation calculus. Stud. Logica. 66(1), 165\u2013186 (2000)","journal-title":"Stud. Logica."},{"issue":"4","key":"28_CR19","first-page":"34","volume":"9","author":"Y Li","year":"2017","unstructured":"Li, Y.: Stopping means achieving: a weaker logic of knowing how. Stud. Logic 9(4), 34\u201354 (2017)","journal-title":"Stud. Logic"},{"doi-asserted-by":"crossref","unstructured":"Li, Y.: Tableaux for the logic of strategically knowing how. In: 19th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2023). EPTCS, vol. 379, pp. 379\u2013391. Open Publishing Association (2023)","key":"28_CR20","DOI":"10.4204\/EPTCS.379.30"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-662-54069-5_12","volume-title":"Logic and Its Applications","author":"Y Li","year":"2017","unstructured":"Li, Y., Wang, Y.: Achieving while maintaining. In: Ghosh, S., Prasad, S. (eds.) ICLA 2017. LNCS, vol. 10119, pp. 154\u2013167. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54069-5_12"},{"unstructured":"Li, Y.: Knowing what to do: a logical approach to planning and knowing how. Ph.D. thesis, University of Groningen (2017)","key":"28_CR22"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-89391-0_15","volume-title":"Logic and Argumentation","author":"Y Li","year":"2021","unstructured":"Li, Y.: Tableau-based decision procedure for logic of knowing-how via simple plans. In: Baroni, P., Benzm\u00fcller, C., W\u00e1ng, Y.N. (eds.) CLAR 2021. LNCS (LNAI), vol. 13040, pp. 266\u2013283. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89391-0_15"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"103487","DOI":"10.1016\/j.artint.2021.103487","volume":"296","author":"Y Li","year":"2021","unstructured":"Li, Y., Wang, Y.: Planning-based knowing how: a unified approach. Artif. Intell. 296, 103487 (2021)","journal-title":"Artif. Intell."},{"unstructured":"McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. In: Machine Intelligence, pp. 463\u2013502. Edinburgh University Press (1969)","key":"28_CR25"},{"unstructured":"Moore, R.: A formal theory of knowledge and action. In: Formal Theories of the Commonsense World. Ablex Publishing Corporation (1985)","key":"28_CR26"},{"unstructured":"Naumov, P., Tao, J.: Second-order know-how strategies. In: 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018), pp. 390\u2013398. ACM (2018)","key":"28_CR27"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.artint.2018.06.007","volume":"262","author":"P Naumov","year":"2018","unstructured":"Naumov, P., Tao, J.: Together we know how to achieve: an epistemic logic of know-how. Artif. Intell. 262, 279\u2013300 (2018)","journal-title":"Artif. Intell."},{"unstructured":"Smith, D.E., Weld, D.S.: Conformant Graphplan. In: 15th National Conference on Artificial Intelligence and 10th Innovative Applications of Artificial Intelligence Conference (AAAI\/IAAI 1998), pp. 889\u2013896. AAAI Press\/The MIT Press (1998)","key":"28_CR29"},{"issue":"1","key":"28_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theoret. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-662-48561-3_32","volume-title":"Logic, Rationality, and Interaction","author":"Y Wang","year":"2015","unstructured":"Wang, Y.: A logic of knowing how. In: van der Hoek, W., Holliday, W.H., Wang, W. (eds.) LORI 2015. LNCS, vol. 9394, pp. 392\u2013405. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48561-3_32"},{"key":"28_CR32","series-title":"Outstanding Contributions to Logic","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-319-62864-6_21","volume-title":"Jaakko Hintikka on Knowledge and Game-Theoretical Semantics","author":"Y Wang","year":"2018","unstructured":"Wang, Y.: Beyond knowing that: a new generation of epistemic logics. In: van Ditmarsch, H., Sandu, G. (eds.) Jaakko Hintikka on Knowledge and Game-Theoretical Semantics. OCL, vol. 12, pp. 499\u2013533. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-62864-6_21"},{"issue":"10","key":"28_CR33","doi-asserted-by":"publisher","first-page":"4419","DOI":"10.1007\/s11229-016-1272-0","volume":"195","author":"Y Wang","year":"2018","unstructured":"Wang, Y.: A logic of goal-directed knowing how. Synthese 195(10), 4419\u20134439 (2018)","journal-title":"Synthese"},{"issue":"2","key":"28_CR34","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1007\/s11229-019-02104-0","volume":"198","author":"C Xu","year":"2021","unstructured":"Xu, C., Wang, Y., Studer, T.: A logic of knowing why. Synthese 198(2), 1259\u20131285 (2021)","journal-title":"Synthese"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:08:05Z","timestamp":1695481685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}