Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDStefan Woltran
Person information
- affiliation: TU Wien, Vienna, Autria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j82]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms 14(3): 81 (2021)- [j81]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Beyond Uniform Equivalence between Answer-set Programs. ACM Trans. Comput. Log. 22(1): 2:1-2:46 (2021) - [c187]Wolfgang Dvorák, Markus Ulbricht, Stefan Woltran:
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. AAAI 2021: 6288-6295 - [c186]Wolfgang Dvorák, Alexander Greßler, Anna Rapberger, Stefan Woltran:
The Complexity Landscape of Claim-Augmented Argumentation Frameworks. AAAI 2021: 6296-6303 - [c185]Wolfgang Dvorák, Matthias König, Stefan Woltran:
Graph-Classes of Argumentation Frameworks with Collective Attacks. JELIA 2021: 3-17 - [i43]Michael Bernreiter, Jan Maly, Stefan Woltran:
Choice Logics and Their Computational Properties. CoRR abs/2106.05052 (2021) - 2020
- [j80]Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, Stefan Woltran:
Design and results of the Second International Competition on Computational Models of Argumentation. Artif. Intell. 279 (2020) - [j79]Wolfgang Dvorák, Stefan Woltran:
Complexity of abstract argumentation under a claim-centric view. Artif. Intell. 285: 103290 (2020) - [j78]Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran:
On the limits of forgetting in Answer Set Programming. Artif. Intell. 286: 103307 (2020) - [j77]Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler, Stefan Woltran:
Investigating subclasses of abstract dialectical frameworks. Argument Comput. 11(1-2): 191-219 (2020) - [j76]Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. Fundam. Informaticae 177(3-4): 275-296 (2020) - [j75]Bernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran:
The Impact of Treewidth on Grounding and Solving of Answer Set Programs. J. Artif. Intell. Res. 67: 35-80 (2020) - [j74]Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran:
Computing secure sets in graphs using answer set programming. J. Log. Comput. 30(4): 837-862 (2020) - [j73]Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs. J. Log. Comput. 30(5): 1063-1107 (2020) - [j72]Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran:
Solving Advanced Argumentation Problems with Answer Set Programming. Theory Pract. Log. Program. 20(3): 391-431 (2020) - [j71]Manuel Bichler, Michael Morak, Stefan Woltran:
selp: A Single-Shot Epistemic Logic Program Solver. Theory Pract. Log. Program. 20(4): 435-455 (2020) - [c184]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. AAAI 2020: 2830-2837 - [c183]Stefan Woltran:
Computational Argumentation - Formal Models and Complexity Results (invited talk). CILC 2020: 2 - [c182]Stefano Bistarelli, Wolfgang Dvorák, Carlo Taticchi, Stefan Woltran:
Ranking-Based Semantics from the Perspective of Claims. COMMA 2020: 111-122 - [c181]Wolfgang Dvorák, Atefeh Keshavarzi Zafarghandi, Stefan Woltran:
Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics. COMMA 2020: 191-202 - [c180]Wolfgang Dvorák, Sarah Alice Gaggl, Anna Rapberger, Johannes Peter Wallner, Stefan Woltran:
The ASPARTIX System Suite. COMMA 2020: 461-462 - [c179]Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks. ECAI 2020: 721-728 - [c178]Zeynep Gozen Saribatur, Johannes Peter Wallner, Stefan Woltran:
Explaining Non-Acceptability in Abstract Argumentation. ECAI 2020: 881-888 - [c177]Wolfgang Dvorák, Anna Rapberger, Johannes Peter Wallner, Stefan Woltran:
ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation. FoIKS 2020: 79-89 - [c176]Michael Bernreiter, Jan Maly, Stefan Woltran:
Encoding Choice Logics in ASP. ICLP Workshops 2020 - [c175]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. ICLP Workshops 2020 - [c174]Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. KR 2020: 341-350 - [c173]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. PADL 2020: 151-167 - [c172]Markus Hecher, Patrick Thier, Stefan Woltran:
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. SAT 2020: 343-360 - [i42]Manuel Bichler, Michael Morak, Stefan Woltran:
selp: A Single-Shot Epistemic Logic Program Solver. CoRR abs/2001.01089 (2020) - [i41]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. CoRR abs/2001.04191 (2020) - [i40]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. CoRR abs/2001.04219 (2020) - [i39]Wolfgang Dvorák, Atefeh Keshavarzi Zafarghandi, Stefan Woltran:
Expressiveness of SETAFs and Support-Free ADFs under 3-valued Semantics. CoRR abs/2007.03581 (2020)
2010 – 2019
- 2019
- [j70]Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
A general notion of equivalence for abstract argumentation. Artif. Intell. 275: 379-410 (2019) - [j69]Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran:
A multiparametric view on answer set programming. Ann. Math. Artif. Intell. 86(1-3): 121-147 (2019) - [j68]Flavio Ferrarotti, Stefan Woltran:
Preface. Ann. Math. Artif. Intell. 87(1-2): 1-4 (2019) - [j67]Wolfgang Dvorák, Jorge Fandinno, Stefan Woltran:
On the expressive power of collective attacks. Argument Comput. 10(2): 191-230 (2019) - [j66]Günther Charwat, Stefan Woltran:
Expansion-based QBF Solving on Tree Decompositions. Fundam. Informaticae 167(1-2): 59-92 (2019) - [j65]Jan Maly, Miroslaw Truszczynski, Stefan Woltran:
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? J. Artif. Intell. Res. 66: 1147-1197 (2019) - [j64]Wolfgang Faber, Michael Morak, Stefan Woltran:
On Uniform Equivalence of Epistemic Logic Programs. Theory Pract. Log. Program. 19(5-6): 826-840 (2019) - [c171]Wolfgang Dvorák, Stefan Woltran:
Complexity of Abstract Argumentation under a Claim-Centric View. AAAI 2019: 2801-2808 - [c170]Wolfgang Faber, Michael Morak, Stefan Woltran:
Strong Equivalence for Epistemic Logic Programs Made Easy. AAAI 2019: 2809-2816 - [c169]Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran:
Forgetting in Modular Answer Set Programming. AAAI 2019: 2843-2850 - [c168]Adrian Haret, Stefan Woltran:
Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. IJCAI 2019: 1726-1733 - [c167]Gerhard Brewka, Jörg Pührer, Stefan Woltran:
Multi-valued GRAPPA. JELIA 2019: 85-101 - [c166]Wolfgang Dvorák, Matti Järvisalo, Thomas Linsbichler, Andreas Niskanen, Stefan Woltran:
Preprocessing Argumentation Frameworks via Replacement Patterns. JELIA 2019: 116-132 - [c165]Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
Strong Equivalence for Argumentation Frameworks with Collective Attacks. KI 2019: 131-145 - [e8]Marcello Balduccini, Yuliya Lierler, Stefan Woltran:
Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings. Lecture Notes in Computer Science 11481, Springer 2019, ISBN 978-3-030-20527-0 [contents] - [i38]Wolfgang Faber, Michael Morak, Stefan Woltran:
On Uniform Equivalence of Epistemic Logic Programs. CoRR abs/1907.10925 (2019) - [i37]Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, Stefan Woltran:
Design and Results of the Second International Competition on Computational Models of Argumentation. CoRR abs/1909.00621 (2019) - [i36]Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran:
Solving Advanced Argumentation Problems with Answer Set Programming. CoRR abs/1912.02734 (2019) - 2018
- [j63]Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, Stefan Woltran:
Summary Report of the Second International Competition on Computational Models of Argumentation. AI Mag. 39(4): 77-79 (2018) - [j62]Bernhard Bliem, Stefan Woltran:
Complexity of Secure Sets. Algorithmica 80(10): 2909-2940 (2018) - [j61]Bernhard Bliem, Stefan Woltran:
Equivalence between answer-set programs under (partially) fixed input. Ann. Math. Artif. Intell. 83(3-4): 277-295 (2018) - [j60]Rémi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes Peter Wallner, Stefan Woltran:
Abstract solvers for Dung's argumentation frameworks. Argument Comput. 9(1): 41-72 (2018) - [j59]Bernhard Bliem, Stefan Woltran:
Defensive alliances in graphs of bounded treewidth. Discret. Appl. Math. 251: 334-339 (2018) - [j58]Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, Stefan Woltran:
An extension-based approach to belief revision in abstract argumentation. Int. J. Approx. Reason. 93: 395-423 (2018) - [j57]James P. Delgrande, Pavlos Peppas, Stefan Woltran:
General Belief Revision. J. ACM 65(5): 29:1-29:34 (2018) - [j56]Torsten Schaub, Stefan Woltran:
Special Issue on Answer Set Programming. Künstliche Intell. 32(2-3): 101-103 (2018) - [j55]Torsten Schaub, Stefan Woltran:
Answer set programming unleashed! Künstliche Intell. 32(2-3): 105-108 (2018) - [j54]Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran:
Dynamic Programming on Tree Decompositions with D-FLAT. Künstliche Intell. 32(2-3): 191-192 (2018) - [j53]Vladimir Lifschitz, Torsten Schaub, Stefan Woltran:
Interview with Vladimir Lifschitz. Künstliche Intell. 32(2-3): 213-218 (2018) - [j52]Gerhard Brewka, Torsten Schaub, Stefan Woltran:
Interview with Gerhard Brewka. Künstliche Intell. 32(2-3): 219-221 (2018) - [j51]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Log. Methods Comput. Sci. 14(4) (2018) - [j50]João Leite, Tran Cao Son, Paolo Torroni, Stefan Woltran:
Preface to the Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV). J. Log. Comput. 28(3): 475-476 (2018) - [c164]Gerhard Brewka, Hannes Strass, Johannes Peter Wallner, Stefan Woltran:
Weighted Abstract Dialectical Frameworks. AAAI 2018: 1779-1786 - [c163]Jan Maly, Stefan Woltran:
A New Logic for Jointly Representing Hard and Soft Constraints. PRUV@IJCAR 2018 - [c162]Wolfgang Dvorák, Alexander Greßler, Stefan Woltran:
Evaluating SETAFs via Answer-Set Programming. SAFA@COMMA 2018: 10-21 - [c161]Wolfgang Dvorák, Jorge Fandinno, Stefan Woltran:
On the Expressive Power of Collective Attacks. COMMA 2018: 49-60 - [c160]Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler, Stefan Woltran:
Investigating Subclasses of Abstract Dialectical Frameworks. COMMA 2018: 61-72 - [c159]Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser:
Weighted Model Counting on the GPU by Exploiting Small Treewidth. ESA 2018: 28:1-28:16 - [c158]Jan Maly, Miroslaw Truszczynski, Stefan Woltran:
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? IJCAI 2018: 433-439 - [c157]Manuel Bichler, Michael Morak, Stefan Woltran:
Single-Shot Epistemic Logic Program Solving. IJCAI 2018: 1714-1720 - [c156]Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran:
Belief Update in the Horn Fragment. IJCAI 2018: 1781-1787 - [c155]Adrian Haret, Johannes Peter Wallner, Stefan Woltran:
Two Sides of the Same Coin: Belief Revision and Enforcing Arguments. IJCAI 2018: 1854-1860 - [c154]Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes Peter Wallner, Stefan Woltran:
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. IJCAI 2018: 1905-1911 - [c153]Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran:
Variable Elimination for DLP-Functions. KR 2018: 643-644 - [c152]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and Its Limits. SAT 2018: 165-184 - [e7]Flavio Ferrarotti, Stefan Woltran:
Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings. Lecture Notes in Computer Science 10833, Springer 2018, ISBN 978-3-319-90049-0 [contents] - [i35]Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and its Limits. CoRR abs/1805.05445 (2018) - [i34]Gerhard Brewka, Jörg Pührer, Hannes Strass, Johannes Peter Wallner, Stefan Woltran:
Weighted Abstract Dialectical Frameworks: Extended and Revised Report. CoRR abs/1806.07717 (2018) - [i33]Wolfgang Faber, Michael Morak, Stefan Woltran:
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version). CoRR abs/1811.04800 (2018) - 2017
- [j49]Jan Maly, Stefan Woltran:
Ranking Specific Sets of Objects. Datenbank-Spektrum 17(3): 255-265 (2017) - [j48]Gerhard Brewka, Stefan Ellmauthaler, Hannes Strass, Johannes Peter Wallner, Stefan Woltran:
Abstract Dialectical Frameworks. An Overview. FLAP 4(8) (2017) - [j47]Michael Abseher, Nysret Musliu, Stefan Woltran:
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. J. Artif. Intell. Res. 58: 829-858 (2017) - [j46]Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Implementing Courcelle's Theorem in a declarative framework for dynamic programming. J. Log. Comput. 27(4): 1067-1094 (2017) - [j45]Adrian Haret, Stefan Rümmele, Stefan Woltran:
Merging in the Horn Fragment. ACM Trans. Comput. Log. 18(1): 6:1-6:32 (2017) - [j44]Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran:
When you must forget: Beyond strong persistence when forgetting in answer set programming. Theory Pract. Log. Program. 17(5-6): 837-854 (2017) - [c151]Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran:
Solving Advanced Argumentation Problems with Answer-Set Programming. AAAI 2017: 1077-1083 - [c150]Günther Charwat, Stefan Woltran:
Expansion-based QBF Solving on Tree Decompositions. RCRA@AI*IA 2017: 16-26 - [c149]Jan Maly, Stefan Woltran:
Ranking Specific Sets of Objects. BTW (Workshops) 2017: 193-201 - [c148]Michael Abseher, Nysret Musliu, Stefan Woltran:
htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. CPAIOR 2017: 376-386 - [c147]Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
A General Notion of Equivalence for Abstract Argumentation. IJCAI 2017: 800-806 - [c146]Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran:
The Impact of Treewidth on ASP Grounding and Solving. IJCAI 2017: 852-858 - [c145]Markus Kröll, Reinhard Pichler, Stefan Woltran:
On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. IJCAI 2017: 1145-1152 - [c144]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC 2017: 17:1-17:13 - [c143]Adrian Haret, Stefan Woltran:
Deviation in Belief Change on Fragments of Propositional Logic. DKB/KIK@KI 2017: 64-76 - [c142]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. LPNMR 2017: 132-145 - [c141]Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran:
A Multiparametric View on Answer Set Programming. ASPOCP@LPNMR 2017 - [i32]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. CoRR abs/1702.02890 (2017) - [i31]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. CoRR abs/1706.09370 (2017) - [i30]Bernhard Bliem, Stefan Woltran:
Defensive Alliances in Graphs of Bounded Treewidth. CoRR abs/1707.04251 (2017) - [i29]Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran:
When You Must Forget: beyond strong persistence when forgetting in answer set programming. CoRR abs/1707.05152 (2017) - [i28]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? CoRR abs/1711.07786 (2017) - 2016
- [j43]Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Christof Spanring, Hannes Strass, Stefan Woltran:
On rejected arguments and implicit conflicts: The hidden power of argumentation semantics. Artif. Intell. 241: 244-284 (2016) - [j42]Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran:
Shift Design with Answer Set Programming. Fundam. Informaticae 147(1): 1-25 (2016) - [j41]Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundam. Informaticae 147(1): 27-61 (2016) - [j40]Ringo Baumann, Stefan Woltran:
The role of self-attacking arguments in characterizations of equivalence notions. J. Log. Comput. 26(4): 1293-1313 (2016) - [j39]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief Merging within Fragments of Propositional Logic. ACM Trans. Comput. Log. 17(3): 20:1-20:28 (2016) - [j38]Manuel Bichler, Michael Morak, Stefan Woltran:
The power of non-ground rules in Answer Set Programming. Theory Pract. Log. Program. 16(5-6): 552-569 (2016) - [c140]Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
Subset Minimization in Dynamic Programming on Tree Decompositions. AAAI Workshop: Beyond NP 2016 - [c139]Stefan Woltran:
Towards Advanced Systems for Abstract Argumentation. SAFA@COMMA 2016: 1-3 - [c138]Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, Stefan Woltran:
Introducing the Second International Competition on Computational Models of Argumentation. SAFA@COMMA 2016: 4-9 - [c137]Ringo Baumann, Thomas Linsbichler, Stefan Woltran:
Verifiability of Argumentation Semantics. COMMA 2016: 83-94 - [c136]Bernhard Bliem, Markus Hecher, Stefan Woltran:
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. COMMA 2016: 107-118 - [c135]Georg Heissenberger, Stefan Woltran:
GrappaVis - A System for Advanced Graph-Based Argumentation. COMMA 2016: 473-474 - [c134]Adrian Haret, Andreas Pfandler, Stefan Woltran:
Beyond IC Postulates: Classification Criteria for Merging Operators. ECAI 2016: 372-380 - [c133]Gerhard Brewka, Jean-Guy Mailly, Stefan Woltran:
Translation-Based Revision and Merging for Minimal Horn Reasoning. ECAI 2016: 734-742 - [c132]Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran:
Clique-Width and Directed Width Measures for Answer-Set Programming. ECAI 2016: 1105-1113 - [c131]Bernhard Bliem, Stefan Woltran:
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. FoIKS 2016: 95-111 - [c130]Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran:
ASP for Anytime Dynamic Programming on Tree Decompositions. IJCAI 2016: 979-986 - [c129]Paul E. Dunne, Christof Spanring, Thomas Linsbichler, Stefan Woltran:
Investigating the Relationship between Argumentation Semantics via Signatures. IJCAI 2016: 1051-1057 - [c128]Adrian Haret, Jean-Guy Mailly, Stefan Woltran:
Distributing Knowledge into Simple Bases. IJCAI 2016: 1109-1115 - [c127]Michael Abseher, Marius Moldovan, Stefan Woltran:
Providing Built-In Counters in a Declarative Dynamic Programming Environment. KI 2016: 3-16 - [c126]Jérôme Delobelle, Adrian Haret, Sébastien Konieczny, Jean-Guy Mailly, Julien Rossit, Stefan Woltran:
Merging of Abstract Argumentation Frameworks. KR 2016: 33-42 - [c125]Massimiliano Giacomin, Thomas Linsbichler, Stefan Woltran:
On the Functional Completeness of Argumentation Semantics. KR 2016: 43-52 - [c124]Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. LOPSTR 2016: 114-130 - [c123]Günther Charwat, Stefan Woltran:
Dynamic Programming-based QBF Solving. QBF@SAT 2016: 27-40 - [i27]Ringo Baumann, Thomas Linsbichler, Stefan Woltran:
Verifiability of Argumentation Semantics. CoRR abs/1603.09502 (2016) - [i26]Adrian Haret, Jean-Guy Mailly, Stefan Woltran:
Distributing Knowledge into Simple Bases. CoRR abs/1603.09511 (2016) - [i25]Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran:
Clique-Width and Directed Width Measures for Answer-Set Programming. CoRR abs/1606.09449 (2016) - [i24]Manuel Bichler, Michael Morak, Stefan Woltran:
The Power of Non-Ground Rules in Answer Set Programming. CoRR abs/1608.01856 (2016) - [i23]Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. CoRR abs/1608.05675 (2016) - [i22]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Counting Answer Sets via Dynamic Programming. CoRR abs/1612.07601 (2016) - 2015
- [j37]