Stefan Woltran

Orcid: 0000-0003-1594-8972

Affiliations:
  • TU Wien, Vienna, Autria


According to our database1, Stefan Woltran authored at least 268 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sequent Calculi for Choice Logics.
J. Autom. Reason., June, 2024

Principles and their Computational Consequences for Argumentation Frameworks with Collective Attacks.
J. Artif. Intell. Res., 2024

Combining Voting and Abstract Argumentation to Understand Online Discussions.
CoRR, 2024

A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Redefining ABA+ Semantics via Abstract Set-to-Set Attacks.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness.
Artif. Intell., November, 2023

Expressiveness of SETAFs and support-free ADFs under 3-valued semantics.
J. Appl. Non Class. Logics, October, 2023

The complexity landscape of claim-augmented argumentation frameworks.
Artif. Intell., April, 2023

Solving Projected Model Counting by Utilizing Treewidth and its Limits.
Artif. Intell., 2023

Digital Humanism and Norms in Recommender Systems.
Proceedings of the First Workshop on the Normative Design and Evaluation of Recommender Systems (NORMalize 2023) co-located with the 17th ACM Conference on Recommender Systems (RecSys 2023), 2023

Sets Attacking Sets in Abstract Argumentation.
Proceedings of the 21st International Workshop on Non-Monotonic Reasoning co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023) and co-located with the 36th International Workshop on Description Logics (DL 2023), 2023

Foundations for Projecting Away the Irrelevant in ASP Programs.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Constrained Derivation in Assumption-Based Argumentation.
Proceedings of the 7th Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2023) co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), 2023

2022
Exploiting Database Management Systems and Treewidth for Counting.
Theory Pract. Log. Program., 2022

Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility.
J. Artif. Intell. Res., 2022

Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs.
Algorithms, 2022

Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.
Artif. Intell., 2022

Choice logics and their computational properties.
Artif. Intell., 2022

The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View.
Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, 2022

Rediscovering Argumentation Principles Utilizing Collective Attacks.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Non-Admissibility in Abstract Argumentation.
Proceedings of the Computational Models of Argument, 2022

Deletion-Backdoors for Argumentation Frameworks with Collective Attacks.
Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 9th International Conference on Computational Models of Argument (COMMA 2022), 2022

Treewidth for Argumentation Frameworks with Collective Attacks.
Proceedings of the Computational Models of Argument, 2022

Abstract Argumentation with Conditional Preferences.
Proceedings of the Computational Models of Argument, 2022

Tractable Abstract Argumentation via Backdoor-Treewidth.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

It Is Simple, It Is Complicated.
Perspectives on Digital Humanism, 2022

2021
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs.
Theory Pract. Log. Program., 2021

Preface.
Theory Pract. Log. Program., 2021

Beyond Uniform Equivalence between Answer-set Programs.
ACM Trans. Comput. Log., 2021

Aspartix-V21.
CoRR, 2021

DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
Algorithms, 2021

On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Graph-Classes of Argumentation Frameworks with Collective Attacks.
Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

2020
Solving Advanced Argumentation Problems with Answer Set Programming.
Theory Pract. Log. Program., 2020

selp: A Single-Shot Epistemic Logic Program Solver.
Theory Pract. Log. Program., 2020

On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs.
J. Log. Comput., 2020

Computing secure sets in graphs using answer set programming.
J. Log. Comput., 2020

The Impact of Treewidth on Grounding and Solving of Answer Set Programs.
J. Artif. Intell. Res., 2020

lpopt: A Rule Optimization Tool for Answer Set Programming.
Fundam. Informaticae, 2020

Investigating subclasses of abstract dialectical frameworks.
Argument Comput., 2020

On the limits of forgetting in Answer Set Programming.
Artif. Intell., 2020

Design and results of the Second International Competition on Computational Models of Argumentation.
Artif. Intell., 2020

Complexity of abstract argumentation under a claim-centric view.
Artif. Intell., 2020

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Structural Decompositions of Epistemic Logic Programs.
Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

Encoding Choice Logics in ASP.
Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation.
Proceedings of the Foundations of Information and Knowledge Systems, 2020

Explaining Non-Acceptability in Abstract Argumentation.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

The ASPARTIX System Suite.
Proceedings of the Computational Models of Argument, 2020

Ranking-Based Semantics from the Perspective of Claims.
Proceedings of the Computational Models of Argument, 2020

Computational Argumentation - Formal Models and Complexity Results (invited talk).
Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019
On Uniform Equivalence of Epistemic Logic Programs.
Theory Pract. Log. Program., 2019

Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided?
J. Artif. Intell. Res., 2019

Expansion-based QBF Solving on Tree Decompositions.
Fundam. Informaticae, 2019

On the expressive power of collective attacks.
Argument Comput., 2019

A multiparametric view on answer set programming.
Ann. Math. Artif. Intell., 2019

Preface.
Ann. Math. Artif. Intell., 2019

A general notion of equivalence for abstract argumentation.
Artif. Intell., 2019

Strong Equivalence for Argumentation Frameworks with Collective Attacks.
Proceedings of the KI 2019: Advances in Artificial Intelligence, 2019

Preprocessing Argumentation Frameworks via Replacement Patterns.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Multi-valued GRAPPA.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Belief Revision Operators with Varying Attitudes Towards Initial Beliefs.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Strong Equivalence for Epistemic Logic Programs Made Easy.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Forgetting in Modular Answer Set Programming.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Preface to the Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV).
J. Log. Comput., 2018

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Log. Methods Comput. Sci., 2018

Answer set programming unleashed!
Künstliche Intell., 2018

Special Issue on Answer Set Programming.
Künstliche Intell., 2018

Interview with Vladimir Lifschitz.
Künstliche Intell., 2018

Interview with Gerhard Brewka.
Künstliche Intell., 2018

Dynamic Programming on Tree Decompositions with D-FLAT.
Künstliche Intell., 2018

General Belief Revision.
J. ACM, 2018

An extension-based approach to belief revision in abstract argumentation.
Int. J. Approx. Reason., 2018

Defensive alliances in graphs of bounded treewidth.
Discret. Appl. Math., 2018

Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version).
CoRR, 2018

Weighted Abstract Dialectical Frameworks: Extended and Revised Report.
CoRR, 2018

Abstract solvers for Dung's argumentation frameworks.
Argument Comput., 2018

Equivalence between answer-set programs under (partially) fixed input.
Ann. Math. Artif. Intell., 2018

Complexity of Secure Sets.
Algorithmica, 2018

Summary Report of the Second International Competition on Computational Models of Argumentation.
AI Mag., 2018

Exploiting Treewidth for Projected Model Counting and Its Limits.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Variable Elimination for DLP-Functions.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Two Sides of the Same Coin: Belief Revision and Enforcing Arguments.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Belief Update in the Horn Fragment.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Single-Shot Epistemic Logic Program Solving.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Weighted Model Counting on the GPU by Exploiting Small Treewidth.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Evaluating SETAFs via Answer-Set Programming
Proceedings of the Second International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2018) co-located with the 7th International Conference on Computational Models of Argument (COMMA 2018), 2018

A New Logic for Jointly Representing Hard and Soft Constraints.
Proceedings of the Second Workshop on Logics for Reasoning about Preferences, 2018

Weighted Abstract Dialectical Frameworks.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
When you must forget: Beyond strong persistence when forgetting in answer set programming.
Theory Pract. Log. Program., 2017

Merging in the Horn Fragment.
ACM Trans. Comput. Log., 2017

Implementing Courcelle's Theorem in a declarative framework for dynamic programming.
J. Log. Comput., 2017

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.
J. Artif. Intell. Res., 2017

Abstract Dialectical Frameworks. An Overview.
FLAP, 2017

Ranking Specific Sets of Objects.
Datenbank-Spektrum, 2017

Answer Set Solving with Bounded Treewidth Revisited.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

Deviation in Belief Change on Fragments of Propositional Logic.
Proceedings of the 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and the 5th Workshop KI & Kognition (KIK-2017) co-located with 40th German Conference on Artificial Intelligence (KI 2017), 2017

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Impact of Treewidth on ASP Grounding and Solving.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
The power of non-ground rules in Answer Set Programming.
Theory Pract. Log. Program., 2016

Belief Merging within Fragments of Propositional Logic.
ACM Trans. Comput. Log., 2016

The role of self-attacking arguments in characterizations of equivalence notions.
J. Log. Comput., 2016

D-FLAT<sup>2</sup>: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy.
Fundam. Informaticae, 2016

Shift Design with Answer Set Programming.
Fundam. Informaticae, 2016

Counting Answer Sets via Dynamic Programming.
CoRR, 2016

On rejected arguments and implicit conflicts: The hidden power of argumentation semantics.
Artif. Intell., 2016

Dynamic Programming-based QBF Solving.
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), 2016

Merging of Abstract Argumentation Frameworks.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Providing Built-In Counters in a Declarative Dynamic Programming Environment.
Proceedings of the KI 2016: Advances in Artificial Intelligence, 2016

Distributing Knowledge into Simple Bases.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Investigating the Relationship between Argumentation Semantics via Signatures.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

ASP for Anytime Dynamic Programming on Tree Decompositions.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Beyond IC Postulates: Classification Criteria for Merging Operators.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Translation-Based Revision and Merging for Minimal Horn Reasoning.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Clique-Width and Directed Width Measures for Answer-Set Programming.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Towards Advanced Systems for Abstract Argumentation.
Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation (SAFA) co-located with the 6th International Conference on Computational Models of Argument (COMMA 2016), 2016

GrappaVis - A System for Advanced Graph-Based Argumentation.
Proceedings of the Computational Models of Argument, 2016

Introducing the Second International Competition on Computational Models of Argumentation.
Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation (SAFA) co-located with the 6th International Conference on Computational Models of Argument (COMMA 2016), 2016

On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.
Proceedings of the Computational Models of Argument, 2016

Verifiability of Argumentation Semantics.
Proceedings of the Computational Models of Argument, 2016

Subset Minimization in Dynamic Programming on Tree Decompositions.
Proceedings of the Beyond NP, 2016

2015
Improved answer-set programming encodings for abstract argumentation.
Theory Pract. Log. Program., 2015

Dual-normal logic programs - the forgotten class.
Theory Pract. Log. Program., 2015

The complexity of handling minimal solutions in logic-based abduction.
J. Log. Comput., 2015

Applications of logical approaches to argumentation.
Argument Comput., 2015

Reasoning in abstract dialectical frameworks using quantified Boolean formulas.
Argument Comput., 2015

Characteristics of multiple viewpoints in abstract argumentation.
Artif. Intell., 2015

Methods for solving reasoning problems in abstract argumentation - A survey.
Artif. Intell., 2015

The Hidden Power of Abstract Argumentation Semantics.
Proceedings of the Theory and Applications of Formal Argumentation, 2015

Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned.
Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

On the Functional Completeness of Argumentation Semantics.
Proceedings of the 5th Workshop on Dynamics of Knowledge and Belief (DKB-2015) and the 4th Workshop KI & Kognition (KIK-2015) co-located with 38th German Conference on Artificial Intelligence (KI-2015), 2015

On the Parameterized Complexity of Belief Revision.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence.
Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

2014
Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
Theory Pract. Log. Program., 2014

Complexity of super-coherence problems in ASP.
Theory Pract. Log. Program., 2014

Belief revision within fragments of propositional logic.
J. Comput. Syst. Sci., 2014

Generalizations of Dung Frameworks and Their Role in Formal Argumentation.
IEEE Intell. Syst., 2014

Complexity-sensitive decision procedures for abstract argumentation.
Artif. Intell., 2014

Probabilistic Argumentation Frameworks - A Logical Approach.
Proceedings of the Scalable Uncertainty Management - 8th International Conference, 2014

The D-FLAT System for Dynamic Programming on Tree Decompositions.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

GRAPPA: A Semantical Framework for Graph-Based Argument Processing.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Compact Argumentation Frameworks.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Resolution-Based Grounded Semantics Revisited.
Proceedings of the Computational Models of Argument, 2014

2013
A Model-Theoretic Approach to Belief Change in Answer Set Programming.
ACM Trans. Comput. Log., 2013

Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries.
Semantic Web, 2013

The cf2 argumentation semantics revisited.
J. Log. Comput., 2013

Model-based recasting in answer-set programming.
J. Appl. Non Class. Logics, 2013

Strong Equivalence of Qualitative Optimization Problems.
J. Artif. Intell. Res., 2013

Utilizing ASP for Generating and Visualizing Argumentation Frameworks
CoRR, 2013

Parametric properties of ideal semantics.
Artif. Intell., 2013

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

ARVis: Visualizing Relations between Answer Sets.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Abstract Dialectical Frameworks Revisited.
Proceedings of the IJCAI 2013, 2013

Structural Properties for Deductive Argument Systems.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013

Advanced SAT Techniques for Abstract Argumentation.
Proceedings of the Computational Logic in Multi-Agent Systems, 2013

Admissibility in the Abstract Dialectical Framework.
Proceedings of the Computational Logic in Multi-Agent Systems, 2013

Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming.
Theory Pract. Log. Program., 2012

Towards fixed-parameter tractable algorithms for abstract argumentation.
Artif. Intell., 2012

Abstract Argumentation via Monadic Second Order Logic.
Proceedings of the Scalable Uncertainty Management - 6th International Conference, 2012

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Preprocessing of Complex Non-Ground Rules in Answer Set Programming.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

Multicut on Graphs of Bounded Clique-Width.
Proceedings of the Combinatorial Optimization and Applications, 2012

Parameterized Splitting: A Simple Modification-Based Approach.
Proceedings of the Correct Reasoning, 2012

2011
On the Intertranslatability of Argumentation Semantics.
J. Artif. Intell. Res., 2011

Complexity of logic-based argumentation in Post's framework.
Argument Comput., 2011

Special issue on answer set programming.
AI Commun., 2011

Characterizing strong equivalence for argumentation frameworks.
Artif. Intell., 2011

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs.
Proceedings of the IJCAI 2011, 2011

A New Tree-Decomposition Based Algorithm for Answer Set Programming.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2011

Complexity of Super-Coherence Problems in Answer Set Programming.
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011

Manifold Answer-Set Programs and Their Applications.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2010
Complexity of semi-stable and stage semantics in argumentation frameworks.
Inf. Process. Lett., 2010

Answer-set programming encodings for argumentation frameworks.
Argument Comput., 2010

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries.
Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

Counting and Enumeration Problems with Bounded Treewidth.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Towards Fixed-Parameter Tractable Algorithms for Argumentation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Abstract Dialectical Frameworks.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

A Dynamic-Programming Based ASP-Solver.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Sets of Boolean Connectives That Make Argumentation Easier.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

The Complexity of Handling Minimal Solutions in Logic-Based Abduction.
Proceedings of the ECAI 2010, 2010

Equivalence between Extended Datalog Programs - A Brief Survey.
Proceedings of the Datalog Reloaded - First International Workshop, 2010

cf2 Semantics Revisited.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

Reasoning in Argumentation Frameworks of Bounded Clique-Width.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

Strong Equivalence in Argumentation.
Proceedings of the Computational Logic in Multi-Agent Systems, 11th International Workshop, 2010

Multicut Algorithms via Tree Decompositions.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Minimising RDF Graphs under Rules and Constraints Revisited.
Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

Representing Preferences Among Sets.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Relativized hyperequivalence of logic programs for modular programming.
Theory Pract. Log. Program., 2009

Characterising equilibrium logic and nested logic programs: Reductions and complexity<sup>, </sup>.
Theory Pract. Log. Program., 2009

Modularity Aspects of Disjunctive Stable Models.
J. Artif. Intell. Res., 2009

A general approach to belief change in answer set programming
CoRR, 2009

Characterising equilibrium logic and nested logic programs: Reductions and complexity
CoRR, 2009

A solver for QBFs in negation normal form.
Constraints An Int. J., 2009

Encoding deductive argumentation in quantified Boolean formulae.
Artif. Intell., 2009

Alternation as a programming paradigm.
Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Belief Revision with Bounded Treewidth.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Manifold Answer-Set Programs for Meta-reasoning.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Answer-Set Programming with Bounded Treewidth.
Proceedings of the IJCAI 2009, 2009

Merging Logic Programs under Answer Set Semantics.
Proceedings of the Logic Programming, 25th International Conference, 2009

2008
A common view on strong, uniform, and other notions of equivalence in answer-set programming.
Theory Pract. Log. Program., 2008

Hyperequivalence of logic programs with respect to supported models.
Ann. Math. Artif. Intell., 2008

Fast Counting with Bounded Treewidth.
Proceedings of the Logic for Programming, 2008

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Belief Revision of Logic Programs under Answer Set Semantics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Hyperequivalence of Programs and Operators.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence.
Proceedings of the Logic Programming, 24th International Conference, 2008

ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming.
Proceedings of the Logic Programming, 24th International Conference, 2008

Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

dRDF: Entailment for Domain-Restricted RDF.
Proceedings of the Semantic Web: Research and Applications, 2008

2007
Semantical characterizations and complexity of equivalences in answer set programming.
ACM Trans. Comput. Log., 2007

Complexity results for answer set programming with bounded predicate arities and implications.
Ann. Math. Artif. Intell., 2007

Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2007

spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2007

Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report.
Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), 2007

Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report.
Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), 2007

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Debugging ASP Programs by Means of ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Complexity Results for Checking Equivalence of Stratified Logic Programs.
Proceedings of the IJCAI 2007, 2007

Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results.
Proceedings of the 20th Workshop on Logic Programming, 2006

Replacements in Non-Ground Answer-Set Programming.
Proceedings of the 20th Workshop on Logic Programming, 2006

ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

A Solver for QBFs in Nonprenex Form.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2006, 2006

2005
On deciding subsumption problems.
Ann. Math. Artif. Intell., 2005

On Solution Correspondences in Answer-Set Programming.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming.
Proceedings of the Logic Programming, 21st International Conference, 2005

Representing Paraconsistent Reasoning via Quantified Propositional Logic.
Proceedings of the Inconsistency Tolerance [result from a Dagstuhl seminar], 2005

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case.
Proceedings of the Proceedings, 2005

2004
On Computing Belief Change Operations using Quantified Boolean Formulas.
J. Log. Comput., 2004

On acyclic and head-cycle free nested logic programs.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

nlp: A Compiler for Nested Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Simplifying Logic Programs Under Uniform and Strong Equivalence.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

On Eliminating Disjunctions in Stable Logic Programming.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Characterizations for Relativized Notions of Equivalence in Answer Set Programming.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

2003
Comparing Different Prenexing Strategies for Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2003

Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation.
Proceedings of the Answer Set Programming, 2003

Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming.
Proceedings of the Answer Set Programming, 2003

2002
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
Proceedings of the Paraconsistent Computational Logic, 2002

A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

2001
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions.
Proceedings of the Progress in Artificial Intelligence, 2001

On Computing Solutions to Belief Change Scenarios.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2001

Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results.
Proceedings of the Answer Set Programming, 2001

2000
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
CoRR, 2000

Implementing Default Reasoning Using Quantified Boolean Formulae.
Proceedings of the 14. Workshop Logische Programmierung, 2000

Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP.
Proceedings of the WLP 2000, 2000

Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000


  Loading...