{"componentChunkName":"component---src-templates-thesis-page-js","path":"/theses/Argumentation_solver/","result":{"data":{"mdx":{"frontmatter":{"title":"Practical Solvers for Reasoning in Abstract Argumentation","supervisor":"dice:YasirMahmood","contact":"dice:YasirMahmood","type":"Master"},"body":"var _excluded = [\"components\"];\n\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\n/* @jsxRuntime classic */\n\n/* @jsx mdx */\nvar _frontmatter = {\n  \"date\": \"2026-09-30\",\n  \"title\": \"Practical Solvers for Reasoning in Abstract Argumentation\",\n  \"type\": \"Master\",\n  \"supervisor\": \"dice:YasirMahmood\",\n  \"contact\": \"dice:YasirMahmood\"\n};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n      props = _objectWithoutProperties(_ref, _excluded);\n\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"h3\", {\n    \"id\": \"background\"\n  }, \"Background\"), mdx(\"p\", null, \"Argumentation provides a structured way to model and reason about conflicting opinions, allowing different viewpoints to be represented and evaluated in a principled manner.\\nTo solve computational problems in argumentation, existing solvers often rely on SAT (Boolean Satisfiability) or ASP (Answer Set Programming) techniques, with established reductions that provide effective ways of translating argumentation problems into SAT or ASP.\\nRecent works have introduced structure-guided reductions that take the structure of the argumentation framework into account and can be particularly effective for counting problems.\"), mdx(\"h3\", {\n    \"id\": \"your-task\"\n  }, \"Your Task\"), mdx(\"p\", null, \"In this thesis, you will implement the existing structure-guided reductions (for treewidth) for argumentation problems and systematically benchmark them against existing reductions that do not explicitly exploit the structure of the argumentation framework.\\nThe goal is to investigate whether incorporating structural information can improve solver performance, particularly for counting problems, and to identify the instances and settings where these reductions provide the greatest benefit.\\nPossible tasks include implementing the reductions, integrating them with existing SAT-solvers, designing an experimental evaluation, and analyzing the results across different benchmark instances.\"), mdx(\"h3\", {\n    \"id\": \"your-profile\"\n  }, \"Your Profile\"), mdx(\"ul\", null, mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Proficiency in Python or Java\"), mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Willingness to develop reasoning systems\"), mdx(\"li\", {\n    parentName: \"ul\"\n  }, \"Interest in symbolic AI, argumentation, SAT solving, and computational reasoning\")), mdx(\"h3\", {\n    \"id\": \"references-and-helpful-material\"\n  }, \"References and helpful material\"), mdx(\"ol\", null, mdx(\"li\", {\n    parentName: \"ol\"\n  }, \"Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Zhengjun Wang (2026): Diversity of Extensions in Abstract Argumentation. (IJCAI 2026) \", mdx(\"a\", {\n    parentName: \"li\",\n    \"href\": \"https://doi.org/10.24963/ijcai.2026/428\"\n  }, \"https://doi.org/10.24963/ijcai.2026/428\"), \".\"), mdx(\"li\", {\n    parentName: \"ol\"\n  }, \"Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier (2023): Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. (IJCAI 2023) \", mdx(\"a\", {\n    parentName: \"li\",\n    \"href\": \"https://doi.org/10.24963/ijcai.2023/358\"\n  }, \"https://doi.org/10.24963/ijcai.2023/358\"), \".\"), mdx(\"li\", {\n    parentName: \"ol\"\n  }, \"Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier (2021): Decomposition-Guided Reductions for Argumentation and Treewidth. (IJCAI 2021) \", mdx(\"a\", {\n    parentName: \"li\",\n    \"href\": \"https://doi.org/10.24963/ijcai.2021/259\"\n  }, \"https://doi.org/10.24963/ijcai.2021/259\"), \".\")));\n}\n;\nMDXContent.isMDXComponent = true;"}},"pageContext":{}},"staticQueryHashes":["2497506207","63159454","932199770"]}