Which is the least complex explanation? Abduction and complexity. Soler-Toscano, F. Freund, M., A., Ruffino, M., & Fernandez de Castro, M., editors. Logic and Philosophy of Logic. Recent Trends in Latin America and Spain, pages 100-116. College Publicacions, 2018.

Paper Website abstract bibtex

Paper Website abstract bibtex

It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of abductive hypotheses. Are there criteria that can help us to select the simplest explanation in a broad spectrum of abductive problems? To give an (affirmative) answer to this question we will move to a field in theoretical computer science: Algorithmic Information Theory (AIT). The algorithmic complexity measure K(s) can be used to determine which is the best theory within those explaining a set of observations. We introduce an application of K(s) to the selection of the best abductive explanation, in the context of dynamic epistemic logic (DEL).

@inbook{ type = {inbook}, year = {2018}, identifiers = {[object Object]}, pages = {100-116}, websites = {http://arxiv.org/abs/1902.05479}, publisher = {College Publicacions}, id = {53a5a8b7-3615-31b1-ad93-1d12450eec6c}, created = {2020-11-24T19:22:39.186Z}, file_attached = {true}, profile_id = {b90fa0f0-b835-3487-8645-24bb43c8aba5}, group_id = {a91e2012-a2d1-3475-84d1-ff2f8b2ca743}, last_modified = {2020-11-24T20:24:36.890Z}, read = {false}, starred = {false}, authored = {false}, confirmed = {true}, hidden = {false}, citation_key = {Soler-Toscano2019}, folder_uuids = {cb689628-8825-4be3-9526-cd1da4d0adff}, private_publication = {false}, abstract = {It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of abductive hypotheses. Are there criteria that can help us to select the simplest explanation in a broad spectrum of abductive problems? To give an (affirmative) answer to this question we will move to a field in theoretical computer science: Algorithmic Information Theory (AIT). The algorithmic complexity measure K(s) can be used to determine which is the best theory within those explaining a set of observations. We introduce an application of K(s) to the selection of the best abductive explanation, in the context of dynamic epistemic logic (DEL).}, bibtype = {inbook}, author = {Soler-Toscano, Fernando}, editor = {Freund, Max A. and Ruffino, Marco and Fernandez de Castro, Max}, chapter = {Which is the least complex explanation? Abduction and complexity}, title = {Logic and Philosophy of Logic. Recent Trends in Latin America and Spain} }

Downloads: 0

{"_id":"F5czXqmnqetrFcKK4","bibbaseid":"solertoscano-logicandphilosophyoflogicrecenttrendsinlatinamericaandspain-2018","authorIDs":[],"author_short":["Soler-Toscano, F."],"bibdata":{"type":"inbook","year":"2018","identifiers":"[object Object]","pages":"100-116","websites":"http://arxiv.org/abs/1902.05479","publisher":"College Publicacions","id":"53a5a8b7-3615-31b1-ad93-1d12450eec6c","created":"2020-11-24T19:22:39.186Z","file_attached":"true","profile_id":"b90fa0f0-b835-3487-8645-24bb43c8aba5","group_id":"a91e2012-a2d1-3475-84d1-ff2f8b2ca743","last_modified":"2020-11-24T20:24:36.890Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Soler-Toscano2019","folder_uuids":"cb689628-8825-4be3-9526-cd1da4d0adff","private_publication":false,"abstract":"It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of abductive hypotheses. Are there criteria that can help us to select the simplest explanation in a broad spectrum of abductive problems? To give an (affirmative) answer to this question we will move to a field in theoretical computer science: Algorithmic Information Theory (AIT). The algorithmic complexity measure K(s) can be used to determine which is the best theory within those explaining a set of observations. We introduce an application of K(s) to the selection of the best abductive explanation, in the context of dynamic epistemic logic (DEL).","bibtype":"inbook","author":"Soler-Toscano, Fernando","editor":"Freund, Max A. and Ruffino, Marco and Fernandez de Castro, Max","chapter":"Which is the least complex explanation? Abduction and complexity","title":"Logic and Philosophy of Logic. Recent Trends in Latin America and Spain","bibtex":"@inbook{\n type = {inbook},\n year = {2018},\n identifiers = {[object Object]},\n pages = {100-116},\n websites = {http://arxiv.org/abs/1902.05479},\n publisher = {College Publicacions},\n id = {53a5a8b7-3615-31b1-ad93-1d12450eec6c},\n created = {2020-11-24T19:22:39.186Z},\n file_attached = {true},\n profile_id = {b90fa0f0-b835-3487-8645-24bb43c8aba5},\n group_id = {a91e2012-a2d1-3475-84d1-ff2f8b2ca743},\n last_modified = {2020-11-24T20:24:36.890Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Soler-Toscano2019},\n folder_uuids = {cb689628-8825-4be3-9526-cd1da4d0adff},\n private_publication = {false},\n abstract = {It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of abductive hypotheses. Are there criteria that can help us to select the simplest explanation in a broad spectrum of abductive problems? To give an (affirmative) answer to this question we will move to a field in theoretical computer science: Algorithmic Information Theory (AIT). The algorithmic complexity measure K(s) can be used to determine which is the best theory within those explaining a set of observations. We introduce an application of K(s) to the selection of the best abductive explanation, in the context of dynamic epistemic logic (DEL).},\n bibtype = {inbook},\n author = {Soler-Toscano, Fernando},\n editor = {Freund, Max A. and Ruffino, Marco and Fernandez de Castro, Max},\n chapter = {Which is the least complex explanation? Abduction and complexity},\n title = {Logic and Philosophy of Logic. Recent Trends in Latin America and Spain}\n}","author_short":["Soler-Toscano, F."],"editor_short":["Freund, M., A.","Ruffino, M.","Fernandez de Castro, M."],"urls":{"Paper":"https://bibbase.org/service/mendeley/b90fa0f0-b835-3487-8645-24bb43c8aba5/file/0bd0dd64-f738-51e5-5161-246c814f43a6/2018_Soler_Toscano__WhichIsTheLeastComplexExplanation.pdf.pdf","Website":"http://arxiv.org/abs/1902.05479"},"bibbaseid":"solertoscano-logicandphilosophyoflogicrecenttrendsinlatinamericaandspain-2018","role":"author","downloads":0},"bibtype":"inbook","creationDate":"2020-11-24T19:13:20.288Z","downloads":0,"keywords":[],"search_terms":["logic","philosophy","logic","recent","trends","latin","america","spain","soler-toscano"],"title":"Logic and Philosophy of Logic. Recent Trends in Latin America and Spain","year":2018}