default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
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
- 2024
[j97]Michael Bernreiter, Wolfgang Dvorák, Stefan Woltran:
Abstract argumentation with conditional preferences. Argument Comput. 15(2): 161-189 (2024)- [j96]Wolfgang Dvorák
, Matthias König, Markus Ulbricht, Stefan Woltran:
Principles and their Computational Consequences for Argumentation Frameworks with Collective Attacks. J. Artif. Intell. Res. 79: 69-136 (2024) - [j95]Michael Bernreiter, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. J. Artif. Intell. Res. 81: 203-262 (2024) - [j94]Michael Bernreiter, Anela Lolic, Jan Maly, Stefan Woltran:
Sequent Calculi for Choice Logics. J. Autom. Reason. 68(2): 8 (2024) - [c215]Yannis Dimopoulos, Wolfgang Dvorák, Matthias König, Anna Rapberger, Markus Ulbricht, Stefan Woltran:
Redefining ABA+ Semantics via Abstract Set-to-Set Attacks. AAAI 2024: 10493-10500 - [c214]Zeynep G. Saribatur, Stefan Woltran:
A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. AAAI 2024: 10687-10695 - [c213]Michael Bernreiter, Jan Maly, Oliviero Nardi, Stefan Woltran:
Combining Voting and Abstract Argumentation to Understand Online Discussions. AAMAS 2024: 170-179 - [c212]Giovanni Buraglio, Wolfgang Dvorák, Matthias König, Stefan Woltran:
Splitting Argumentation Frameworks with Collective Attacks. SAFA@COMMA 2024: 41-55 - [c211]Alexander Greßler, Wolfgang Dvorák, Stefan Woltran:
The GSAF Solver and Verifier. COMMA 2024: 353-354 - [c210]Giovanni Buraglio, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
Constrained Derivation in Assumption-Based Argumentation. FoIKS 2024: 340-359 - [c209]Alexander Beiser, Markus Hecher, Kaan Unalan, Stefan Woltran:
Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. IJCAI 2024: 3250-3258 - [c208]Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran:
Epistemic Logic Programs: Non-Ground and Counting Complexity. IJCAI 2024: 3333-3341 - [c207]Wolfgang Dvorák, Alexander Greßler, Stefan Woltran:
Equipping Abstract Argumentation Solvers for Verifying Negative Results. SAC 2024: 762-769 - [d1]Michael Bernreiter, Jan Maly, Oliviero Nardi, Stefan Woltran:
Supplementary Material for "Combining Voting and Abstract Argumentation to Understand Online Discussions". Zenodo, 2024
- [i51]Michael Bernreiter, Jan Maly, Oliviero Nardi, Stefan Woltran:
Combining Voting and Abstract Argumentation to Understand Online Discussions. CoRR abs/2402.05895 (2024) - [i50]Martin Nöllenburg, Christian Pirker, Anna Rapberger, Stefan Woltran, Jules Wulms:
Visualizing Extensions of Argumentation Frameworks as Layered Graphs. CoRR abs/2409.05457 (2024) - 2023
- [j93]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artif. Intell. 314: 103810 (2023) - [j92]Wolfgang Dvorák, Alexander Greßler, Anna Rapberger, Stefan Woltran:
The complexity landscape of claim-augmented argumentation frameworks. Artif. Intell. 317: 103873 (2023) - [j91]Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness. Artif. Intell. 324: 104011 (2023) - [j90]Wolfgang Dvorák, Atefeh Keshavarzi Zafarghandi, Stefan Woltran:
Expressiveness of SETAFs and support-free ADFs under 3-valued semantics. J. Appl. Non Class. Logics 33(3-4): 298-327 (2023) - [c206]Michael Bernreiter, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. AAAI 2023: 6253-6261 - [c205]Giovanni Buraglio, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
Constrained Derivation in Assumption-Based Argumentation. AI³@AI*IA 2023 - [c204]Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran:
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS 2023: 100-108 - [c203]Viktor Besin, Markus Hecher, Stefan Woltran:
On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. ECAI 2023: 247-254 - [c202]Zeynep G. Saribatur, Stefan Woltran:
Foundations for Projecting Away the Irrelevant in ASP Programs. KR 2023: 614-624 - [c201]Yannis Dimopoulos, Wolfgang Dvorák, Matthias König, Anna Rapberger, Markus Ulbricht, Stefan Woltran:
Sets Attacking Sets in Abstract Argumentation. NMR 2023: 22-31 - [c200]Erich Prem, Julia Neidhardt, Peter Knees, Stefan Woltran, Hannes Werthner:
Digital Humanism and Norms in Recommender Systems. NORMalize@RecSys 2023 - [i49]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. CoRR abs/2305.19212 (2023) - [i48]Zeynep G. Saribatur, Stefan Woltran:
A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. CoRR abs/2312.07993 (2023) - 2022
- [j89]Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes Peter Wallner, Stefan Woltran:
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. Artif. Intell. 307: 103697 (2022) - [j88]Michael Bernreiter, Jan Maly, Stefan Woltran:
Choice logics and their computational properties. Artif. Intell. 311: 103755 (2022) - [j87]Jorge Fandinno, David Pearce, Concepción Vidal, Stefan Woltran:
Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. Algorithms 15(6): 201 (2022) - [j86]Wolfgang Dvorák, Markus Ulbricht, Stefan Woltran:
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. J. Artif. Intell. Res. 74: 1403-1447 (2022) - [j85]Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran:
Exploiting Database Management Systems and Treewidth for Counting. Theory Pract. Log. Program. 22(1): 128-157 (2022) - [c199]Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran:
Tractable Abstract Argumentation via Backdoor-Treewidth. AAAI 2022: 5608-5615 - [c198]Michael Bernreiter, Anela Lolic, Jan Maly, Stefan Woltran:
Sequent Calculi for Choice Logics. IJCAR 2022: 331-349 - [c197]Michael Bernreiter, Wolfgang Dvorák, Stefan Woltran:
Abstract Argumentation with Conditional Preferences. COMMA 2022: 92-103 - [c196]Wolfgang Dvorák, Matthias König, Stefan Woltran:
Deletion-Backdoors for Argumentation Frameworks with Collective Attacks. SAFA@COMMA 2022: 98-110 - [c195]Wolfgang Dvorák, Tjitze Rienstra, Leendert van der Torre, Stefan Woltran:
Non-Admissibility in Abstract Argumentation. COMMA 2022: 128-139 - [c194]Wolfgang Dvorák, Matthias König, Stefan Woltran:
Treewidth for Argumentation Frameworks with Collective Attacks. COMMA 2022: 140-151 - [c193]Viktor Besin, Markus Hecher, Stefan Woltran:
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. IJCAI 2022: 2546-2552 - [c192]Viktor Besin, Markus Hecher, Stefan Woltran:
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). IJCAI 2022: 5264-5268 - [c191]Wolfgang Dvorák, Matthias König, Markus Ulbricht, Stefan Woltran:
Rediscovering Argumentation Principles Utilizing Collective Attacks. KR 2022 - [c190]Michael Bernreiter, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View. NMR 2022: 27-38 - [p1]Julia Neidhardt, Hannes Werthner, Stefan Woltran:
It Is Simple, It Is Complicated. Perspectives on Digital Humanism 2022: 335-342 - [i47]Michael Bernreiter, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View. CoRR abs/2204.13305 (2022) - [i46]Wolfgang Dvorák, Matthias König, Markus Ulbricht, Stefan Woltran:
Rediscovering Argumentation Principles Utilizing Collective Attacks. CoRR abs/2205.03151 (2022) - 2021
- [j84]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms 14(3): 81 (2021) - [j83]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) - [j82]Marcello Balduccini, Yuliya Lierler, Stefan Woltran:
Preface. Theory Pract. Log. Program. 21(3): 293-295 (2021) - [j81]Viktor Besin, Markus Hecher, Stefan Woltran:
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. Theory Pract. Log. Program. 21(5): 575-592 (2021) - [c189]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 - [c188]Wolfgang Dvorák, Alexander Greßler, Anna Rapberger, Stefan Woltran:
The Complexity Landscape of Claim-Augmented Argumentation Frameworks. AAAI 2021: 6296-6303 - [c187]Michael Bernreiter, Jan Maly, Stefan Woltran:
Choice Logics and Their Computational Properties. IJCAI 2021: 1794-1800 - [c186]Wolfgang Dvorák, Matthias König, Stefan Woltran:
Graph-Classes of Argumentation Frameworks with Collective Attacks. JELIA 2021: 3-17 - [c185]Wolfgang Dvorák, Matthias König, Stefan Woltran:
On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. KR 2021: 671-675 - [i45]Michael Bernreiter, Jan Maly, Stefan Woltran:
Choice Logics and Their Computational Properties. CoRR abs/2106.05052 (2021) - [i44]Viktor Besin, Markus Hecher, Stefan Woltran:
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. CoRR abs/2108.03022 (2021) - [i43]Wolfgang Dvorák, Matthias König, Johannes Peter Wallner, Stefan Woltran:
Aspartix-V21. CoRR abs/2109.03166 (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 G. 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 (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]Günther Charwat, Wolfgang Dvorák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran:
Methods for solving reasoning problems in abstract argumentation - A survey. Artif. Intell. 220: 28-63 (2015) - [j36]Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
Characteristics of multiple viewpoints in abstract argumentation. Artif. Intell. 228: 153-178 (2015) - [j35]João Leite, Tran Cao Son, Paolo Torroni, Stefan Woltran:
Applications of logical approaches to argumentation. Argument Comput. 6(1): 1-2 (2015) - [j34]Martin Diller, Johannes Peter Wallner, Stefan Woltran:
Reasoning in abstract dialectical frameworks using quantified Boolean formulas. Argument Comput. 6(2): 149-177 (2015) - [j33]Andreas Pfandler, Reinhard Pichler, Stefan Woltran:
The complexity of handling minimal solutions in logic-based abduction. J. Log. Comput. 25(3): 805-825 (2015) - [j32]Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, Stefan Woltran:
Improved answer-set programming encodings for abstract argumentation. Theory Pract. Log. Program. 15(4-5): 434-448 (2015) - [j31]Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran:
Dual-normal logic programs - the forgotten class. Theory Pract. Log. Program. 15(4-5): 495-510 (2015) - [c122]Thomas Eiter, Hannes Strass, Miroslaw Truszczynski, Stefan Woltran:
A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 1-16 - [c121]Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran:
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. IJCAI 2015: 275-282 - [c120]Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, Stefan Woltran:
An Extension-Based Approach to Belief Revision in Abstract Argumentation. IJCAI 2015: 2926-2932 - [c119]Adrian Haret, Stefan Rümmele, Stefan Woltran:
Merging in the Horn Fragment. IJCAI 2015: 3041-3047 - [c118]Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner, Stefan Woltran:
On the Parameterized Complexity of Belief Revision. IJCAI 2015: 3149-3155 - [c117]Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran:
Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). IJCAI 2015: 4173-4177 - [c116]Massimiliano Giacomin, Thomas Linsbichler, Stefan Woltran:
On the Functional Completeness of Argumentation Semantics. DKB/KIK@KI 2015: 43-54 - [c115]Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran:
Shift Design with Answer Set Programming. LPNMR 2015: 32-39 - [c114]Günther Charwat, Stefan Woltran:
Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams. LPNMR 2015: 213-227 - [c113]Stefan Woltran:
Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned. SYNASC 2015: 22 - [c112]Rémi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes Peter Wallner, Stefan Woltran:
Abstract Solvers for Dung's Argumentation Frameworks. TAFA 2015: 40-58 - [c111]Thomas Linsbichler, Christof Spanring, Stefan Woltran:
The Hidden Power of Abstract Argumentation Semantics. TAFA 2015: 146-162 - [c110]Bernhard Bliem, Stefan Woltran:
Complexity of Secure Sets. WG 2015: 64-77 - [e6]Thomas Eiter, Hannes Strass, Miroslaw Truszczynski, Stefan Woltran:
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation - Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 9060, Springer 2015, ISBN 978-3-319-14725-3 [contents] - [i21]Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran:
Dual-normal Logic Programs - the Forgotten Class. CoRR abs/1507.05388 (2015) - [i20]Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, Stefan Woltran:
Improved Answer-Set Programming Encodings for Abstract Argumentation. CoRR abs/1507.06689 (2015) - 2014
- [j30]Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran:
Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206: 53-78 (2014) - [j29]Gerhard Brewka, Sylwia Polberg, Stefan Woltran:
Generalizations of Dung Frameworks and Their Role in Formal Argumentation. IEEE Intell. Syst. 29(1): 30-38 (2014) - [j28]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran:
Belief revision within fragments of propositional logic. J. Comput. Syst. Sci. 80(2): 427-449 (2014) - [j27]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program. 14(2): 141-164 (2014) - [j26]Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of super-coherence problems in ASP. Theory Pract. Log. Program. 14(3): 339-361 (2014) - [c109]Martin Diller, Johannes Peter Wallner, Stefan Woltran:
Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas. COMMA 2014: 241-252 - [c108]Wolfgang Dvorák, Thomas Linsbichler, Emilia Oikarinen, Stefan Woltran:
Resolution-Based Grounded Semantics Revisited. COMMA 2014: 269-280 - [c107]Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Hannes Strass, Stefan Woltran:
Compact Argumentation Frameworks. ECAI 2014: 69-74 - [c106]Gerhard Brewka, Stefan Woltran:
GRAPPA: A Semantical Framework for Graph-Based Argument Processing. ECAI 2014: 153-158 - [c105]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief merging within fragments of propositional logic. ECAI 2014: 231-236 - [c104]Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran:
The D-FLAT System for Dynamic Programming on Tree Decompositions. JELIA 2014: 558-572 - [c103]Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran:
Characteristics of Multiple Viewpoints in Abstract Argumentation. KR 2014 - [c102]Dragan Doder, Stefan Woltran:
Probabilistic Argumentation Frameworks - A Logical Approach. SUM 2014: 134-147 - [e5]Madalina Croitoru, Sebastian Rudolph, Stefan Woltran, Christophe Gonzales:
Graph Structures for Knowledge Representation and Reasoning - Third International Workshop, GKR 2013, Beijing, China, August 3, 2013. Revised Selected Papers. Lecture Notes in Computer Science 8323, Springer 2014, ISBN 978-3-319-04533-7 [contents] - [i19]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. CoRR abs/1401.3484 (2014) - [i18]Wolfgang Dvorák, Stefan Woltran:
On the Intertranslatability of Argumentation Semantics. CoRR abs/1401.3895 (2014) - [i17]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief merging within fragments of propositional logic. CoRR abs/1404.6445 (2014) - [i16]Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Hannes Strass, Stefan Woltran:
Compact Argumentation Frameworks. CoRR abs/1404.7734 (2014) - [i15]Bernhard Bliem, Stefan Woltran:
Complexity of Secure Sets. CoRR abs/1411.6549 (2014) - 2013
- [j25]Paul E. Dunne, Wolfgang Dvorák, Stefan Woltran:
Parametric properties of ideal semantics. Artif. Intell. 202: 1-28 (2013) - [j24]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. J. Artif. Intell. Res. 47: 351-391 (2013) - [j23]Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits, Stefan Woltran:
Model-based recasting in answer-set programming. J. Appl. Non Class. Logics 23(1-2): 75-104 (2013) - [j22]Sarah Alice Gaggl, Stefan Woltran:
The cf2 argumentation semantics revisited. J. Log. Comput. 23(5): 925-949 (2013) - [j21]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran:
Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. Semantic Web 4(4): 351-393 (2013) - [j20]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Trans. Comput. Log. 14(2): 14:1-14:46 (2013) - [c101]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. AAAI 2013: 297-303 - [c100]Sylwia Polberg, Johannes Peter Wallner, Stefan Woltran:
Admissibility in the Abstract Dialectical Framework. CLIMA 2013: 102-118 - [c99]Johannes Peter Wallner, Georg Weissenbacher, Stefan Woltran:
Advanced SAT Techniques for Abstract Argumentation. CLIMA 2013: 138-154 - [c98]Anthony Hunter, Stefan Woltran:
Structural Properties for Deductive Argument Systems. ECSQARU 2013: 278-289 - [c97]Gerhard Brewka, Hannes Strass, Stefan Ellmauthaler, Johannes Peter Wallner, Stefan Woltran:
Abstract Dialectical Frameworks Revisited. IJCAI 2013: 803-809 - [c96]Nadia Creignou, Reinhard Pichler, Stefan Woltran:
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? IJCAI 2013: 824-831 - [c95]Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. IPEC 2013: 28-40 - [c94]Thomas Ambroz, Günther Charwat, Andreas Jusits, Johannes Peter Wallner, Stefan Woltran:
ARVis: Visualizing Relations between Answer Sets. LPNMR 2013: 73-78 - [c93]James P. Delgrande, Pavlos Peppas, Stefan Woltran:
AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. LPNMR 2013: 264-276 - [e4]João Leite, Tran Cao Son, Paolo Torroni, Leon van der Torre, Stefan Woltran:
Computational Logic in Multi-Agent Systems - 14th International Workshop, CLIMA XIV, Corunna, Spain, September 16-18, 2013. Proceedings. Lecture Notes in Computer Science 8143, Springer 2013, ISBN 978-3-642-40623-2 [contents] - [i14]Günther Charwat, Johannes Peter Wallner, Stefan Woltran:
Utilizing ASP for Generating and Visualizing Argumentation Frameworks. CoRR abs/1301.1388 (2013) - 2012
- [j19]Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran:
Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186: 1-37 (2012) - [j18]Bernhard Bliem, Michael Morak, Stefan Woltran:
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. Theory Pract. Log. Program. 12(4-5): 445-464 (2012) - [c92]Ringo Baumann, Gerhard Brewka, Wolfgang Dvorák, Stefan Woltran:
Parameterized Splitting: A Simple Modification-Based Approach. Correct Reasoning 2012: 57-71 - [c91]Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126 - [c90]Michael Morak, Stefan Woltran:
Preprocessing of Complex Non-Ground Rules in Answer Set Programming. ICLP (Technical Communications) 2012: 247-258 - [c89]Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran:
Belief Revision within Fragments of Propositional Logic. KR 2012 - [c88]Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran:
Complexity-Sensitive Decision Procedures for Abstract Argumentation. KR 2012 - [c87]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. KR 2012 - [c86]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144 - [c85]Wolfgang Dvorák, Stefan Szeider, Stefan Woltran:
Abstract Argumentation via Monadic Second Order Logic. SUM 2012: 85-98 - [e3]Bart Verheij, Stefan Szeider, Stefan Woltran:
Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012. Frontiers in Artificial Intelligence and Applications 245, IOS Press 2012, ISBN 978-1-61499-110-6 [contents] - [i13]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012) - [i12]Bernhard Bliem, Michael Morak, Stefan Woltran:
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming. CoRR abs/1210.1931 (2012) - [i11]Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of super-coherence problems in ASP. CoRR abs/1212.5895 (2012) - 2011
- [j17]Emilia Oikarinen, Stefan Woltran:
Characterizing strong equivalence for argumentation frameworks. Artif. Intell. 175(14-15): 1985-2009 (2011) - [j16]Marcello Balduccini, Stefan Woltran:
Special issue on answer set programming. AI Commun. 24(2): 105-106 (2011) - [j15]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2(2-3): 107-129 (2011) - [j14]Wolfgang Dvorák, Stefan Woltran:
On the Intertranslatability of Argumentation Semantics. J. Artif. Intell. Res. 41: 445-475 (2011) - [c84]Wolfgang Faber, Stefan Woltran:
Manifold Answer-Set Programs and Their Applications. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 44-63 - [c83]Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of Super-Coherence Problems in Answer Set Programming. CILC 2011: 131-145 - [c82]Sarah Alice Gaggl, Stefan Woltran:
Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. ECSQARU 2011: 38-49 - [c81]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918 - [c80]Gerhard Brewka, Paul E. Dunne, Stefan Woltran:
Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. IJCAI 2011: 780-785 - [c79]Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran:
Parametric Properties of Ideal Semantics. IJCAI 2011: 851-856 - [c78]Wolfgang Dvorák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran:
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. INAP/WLP 2011: 114-133 - [c77]Wolfgang Dvorák, Michael Morak, Clemens Nopp, Stefan Woltran:
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. INAP/WLP 2011: 259-268 - [i10]Wolfgang Dvorák, Michael Morak, Clemens Nopp, Stefan Woltran:
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. CoRR abs/1108.4804 (2011) - [i9]Wolfgang Dvorák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran:
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. CoRR abs/1108.4942 (2011) - [i8]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. CoRR abs/1112.0791 (2011) - 2010
- [j13]Uwe Egly, Sarah Alice Gaggl, Stefan Woltran:
Answer-set programming encodings for argumentation frameworks. Argument Comput. 1(2): 147-177 (2010) - [j12]Wolfgang Dvorák, Stefan Woltran:
Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11): 425-430 (2010) - [c76]Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran:
Representing Preferences Among Sets. AAAI 2010: 273-278 - [c75]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran:
Minimising RDF Graphs under Rules and Constraints Revisited. AMW 2010 - [c74]Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut Algorithms via Tree Decompositions. CIAC 2010: 167-179 - [c73]Stefan Woltran:
Strong Equivalence in Argumentation. CLIMA 2010: 14 - [c72]Wolfgang Dvorák, Stefan Szeider, Stefan Woltran:
Reasoning in Argumentation Frameworks of Bounded Clique-Width. COMMA 2010: 219-230 - [c71]Sarah Alice Gaggl, Stefan Woltran:
cf2 Semantics Revisited. COMMA 2010: 243-254 - [c70]Stefan Woltran:
Equivalence between Extended Datalog Programs - A Brief Survey. Datalog 2010: 106-119 - [c69]Reinhard Pichler, Stefan Woltran:
The Complexity of Handling Minimal Solutions in Logic-Based Abduction. ECAI 2010: 895-900 - [c68]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129 - [c67]Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A Dynamic-Programming Based ASP-Solver. JELIA 2010: 369-372 - [c66]Gerhard Brewka, Stefan Woltran:
Abstract Dialectical Frameworks. KR 2010 - [c65]Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran:
Towards Fixed-Parameter Tractable Algorithms for Argumentation. KR 2010 - [c64]Emilia Oikarinen, Stefan Woltran:
Characterizing Strong Equivalence for Argumentation Frameworks. KR 2010 - [c63]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010 - [c62]Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) 2010: 387-404 - [c61]Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran:
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. RR 2010: 133-148
2000 – 2009
- 2009
- [j11]Philippe Besnard, Anthony Hunter, Stefan Woltran:
Encoding deductive argumentation in quantified Boolean formulae. Artif. Intell. 173(15): 1406-1423 (2009) - [j10]Uwe Egly, Martina Seidl, Stefan Woltran:
A solver for QBFs in negation normal form. Constraints An Int. J. 14(1): 38-79 (2009) - [j9]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. 35: 813-857 (2009) - [j8]David Pearce, Hans Tompits, Stefan Woltran:
Characterising equilibrium logic and nested logic programs: Reductions and complexity, . Theory Pract. Log. Program. 9(5): 565-616 (2009) - [j7]Miroslaw Truszczynski, Stefan Woltran:
Relativized hyperequivalence of logic programs for modular programming. Theory Pract. Log. Program. 9(6): 781-819 (2009) - [c60]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
Merging Logic Programs under Answer Set Semantics. ICLP 2009: 160-174 - [c59]Michael Jakl, Reinhard Pichler, Stefan Woltran:
Answer-Set Programming with Bounded Treewidth. IJCAI 2009: 816-822 - [c58]Wolfgang Faber, Stefan Woltran:
Manifold Answer-Set Programs for Meta-reasoning. LPNMR 2009: 115-128 - [c57]Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Belief Revision with Bounded Treewidth. LPNMR 2009: 250-263 - [c56]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. LPNMR 2009: 382-395 - [c55]Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran:
Alternation as a programming paradigm. PPDP 2009: 61-72 - [i7]David Pearce, Hans Tompits, Stefan Woltran:
Characterising equilibrium logic and nested logic programs: Reductions and complexity. CoRR abs/0906.2228 (2009) - [i6]Miroslaw Truszczynski, Stefan Woltran:
Relativized hyperequivalence of logic programs for modular programming. CoRR abs/0907.4128 (2009) - [i5]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
A general approach to belief change in answer set programming. CoRR abs/0912.5511 (2009) - 2008
- [j6]Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of logic programs with respect to supported models. Ann. Math. Artif. Intell. 53(1-4): 331-365 (2008) - [j5]Stefan Woltran:
A common view on strong, uniform, and other notions of equivalence in answer-set programming. Theory Pract. Log. Program. 8(2): 217-234 (2008) - [c54]Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of Logic Programs with Respect to Supported Models. AAAI 2008: 560-565 - [c53]Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran:
dRDF: Entailment for Domain-Restricted RDF. ESWC 2008: 200-214 - [c52]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran:
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. FoIKS 2008: 24-41 - [c51]Jörg Pührer, Hans Tompits, Stefan Woltran:
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. ICLP 2008: 561-575 - [c50]Miroslaw Truszczynski, Stefan Woltran:
Relativized Hyperequivalence of Logic Programs for Modular Programming. ICLP 2008: 576-590 - [c49]Uwe Egly, Sarah Alice Gaggl, Stefan Woltran:
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. ICLP 2008: 734-738 - [c48]Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of Programs and Operators. ISAIM 2008 - [c47]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
Belief Revision of Logic Programs under Answer Set Semantics. KR 2008: 411-421 - [c46]Wolfgang Faber, Hans Tompits, Stefan Woltran:
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443 - [c45]Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Fast Counting with Bounded Treewidth. LPAR 2008: 436-450 - 2007
- [j4]Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran:
Complexity results for answer set programming with bounded predicate arities and implications. Ann. Math. Artif. Intell. 51(2-4): 123-165 (2007) - [j3]Thomas Eiter, Michael Fink, Stefan Woltran:
Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. Comput. Log. 8(3): 17 (2007) - [c44]Johannes Oetsch, Hans Tompits, Stefan Woltran:
Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. AAAI 2007: 458-464 - [c43]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Complexity Results for Checking Equivalence of Stratified Logic Programs. IJCAI 2007: 330-335 - [c42]Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran:
Debugging ASP Programs by Means of ASP. LPNMR 2007: 31-43 - [c41]Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran:
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135 - [c40]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran:
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT 2007 - [c39]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187 - [c38]David Pearce, Hans Tompits, Stefan Woltran:
Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. CENT 2007 - [c37]Stefan Woltran:
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. CENT 2007 - [c36]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. INAP/WLP 2007: 241-246 - [c35]Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran:
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. INAP/WLP 2007: 247-252 - [e2]David Pearce, Axel Polleres, Agustín Valverde, Stefan Woltran:
Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), Tempe, AZ, USA, May 14, 2007. CEUR Workshop Proceedings 265, CEUR-WS.org 2007 [contents] - [i4]Stefan Woltran:
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. CoRR abs/0712.0948 (2007) - 2006
- [c34]Uwe Egly, Stefan Woltran:
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. COMMA 2006: 133-144 - [c33]Uwe Egly, Martina Seidl, Stefan Woltran:
A Solver for QBFs in Nonprenex Form. ECAI 2006: 477-481 - [c32]Thomas Eiter, Patrick Traxler, Stefan Woltran:
An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. JELIA 2006: 477-480 - [c31]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. JELIA 2006: 502-505 - [c30]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming. KR 2006: 340-351 - [c29]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming. WLP 2006: 145-153 - [c28]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. WLP 2006: 200-205 - [e1]Michael Fink, Hans Tompits, Stefan Woltran:
20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006. INFSYS Research Report 1843-06-02, Technische Universität Wien, Austria 2006 [contents] - 2005
- [j2]Uwe Egly, Reinhard Pichler, Stefan Woltran:
On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005) - [c27]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. AAAI 2005: 695-700 - [c26]Hans Tompits, Stefan Woltran:
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. Answer Set Programming 2005 - [c25]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance 2005: 84-118 - [c24]Hans Tompits, Stefan Woltran:
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. ICLP 2005: 189-203 - [c23]Thomas Eiter, Hans Tompits, Stefan Woltran:
On Solution Correspondences in Answer-Set Programming. IJCAI 2005: 97-102 - [i3]Thomas Eiter, Michael Fink, Stefan Woltran:
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. CoRR abs/cs/0502078 (2005) - 2004
- [j1]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
On Computing Belief Change Operations using Quantified Boolean Formulas. J. Log. Comput. 14(6): 801-826 (2004) - [c22]Thomas Linke, Hans Tompits, Stefan Woltran:
On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP 2004: 225-239 - [c21]Stefan Woltran:
Characterizations for Relativized Notions of Equivalence in Answer Set Programming. JELIA 2004: 161-173 - [c20]Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran:
Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. KR 2004: 377-387 - [c19]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
On Eliminating Disjunctions in Stable Logic Programming. KR 2004: 447-458 - [c18]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004: 87-99 - [c17]Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
nlp: A Compiler for Nested Logic Programming. LPNMR 2004: 361-364 - [c16]Thomas Linke, Hans Tompits, Stefan Woltran:
On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275 - 2003
- [c15]Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran:
Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. Answer Set Programming 2003 - [c14]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003 - [c13]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. ECSQARU 2003: 528-539 - [c12]Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda:
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228 - 2002
- [c11]David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. ICLP 2002: 405-420 - [c10]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. JELIA 2002: 320-331 - [c9]David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. NMR 2002: 57-66 - [c8]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. Paraconsistent Computational Logic 2002: 1-15 - [c7]Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran:
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002: 100-114 - [i2]David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. CoRR cs.AI/0207071 (2002) - 2001
- [c6]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran:
Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001 - [c5]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
On Computing Solutions to Belief Change Scenarios. ECSQARU 2001: 510-521 - [c4]David Pearce, Hans Tompits, Stefan Woltran:
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. EPIA 2001: 306-320 - 2000
- [c3]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran:
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000: 417-422 - [c2]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran:
Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. WLP 2000: 113-122 - [c1]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran:
Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000: 223-228 - [i1]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran:
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks. CoRR cs.AI/0003037 (2000)
Coauthor Index
[j97] [j96] [j95] [c215] [c212] [c211] [c210] [c207] [j92] [j91] [j90] [c206] [c205] [c201] [j86] [c199] [c197] [c196] [c195] [c194] [c191] [c190] [i47] [i46] [c189] [c188] [c186] [c185] [i43] [j79] [j73] [c182] [c181] [c180] [c179] [c177] [c174] [i39] [j70] [j67] [c171] [c166] [c165] [c162] [c161] [c147] [j43] [j37] [j36] [c117] [j30] [c108] [c107] [c103] [i18] [i16] [j25] [j19] [c92] [c88] [c85] [j14] [c79] [c78] [c77] [i10] [i9] [j12] [c72] [c65] [c55]
[j83] [i19] [j23] [j20] [j9] [j8] [c60] [c56] [i7] [i5] [c52] [c51] [c47] [c46] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c36] [c35] [c31] [c30] [c29] [c28] [e1] [c27] [c26] [c25] [c24] [c23] [j1] [c22] [c19] [c18] [c17] [c16] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [i2] [c6] [c5] [c4] [c3] [c2] [c1] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
