BibSLEIGH — Stefan

Travelled to:

1 × Australia
1 × Austria
1 × Denmark
1 × France
1 × Hungary
1 × Portugal
1 × Spain
2 × Canada
2 × USA
3 × Italy

Collaborated with:

H.Tompits R.Pichler M.Truszczynski W.Dvorák W.Faber U.Egly M.Morak T.Schaub T.Eiter M.Fink S.A.Gaggl G.Brewka E.Oikarinen J.P.Delgrande J.P.Wallner J.K.Fichte B.Bliem J.Pührer T.Linke P.E.Dunne T.Linsbichler N.Creignou O.Papini M.Järvisalo S.Rümmele S.Szeider G.Gottlob N.Manthey A.Ronca P.Traxler G.Pfeifer M.Seidl M.Zolda D.Pearce V.Sarsakov

Talks about:

program (20) answer (11) set (11) logic (10) argument (6) disjunct (4) abstract (4) equival (4) framework (3) problem (3)

Person: Stefan Woltran

DBLP: Woltran:Stefan

Contributed to:

2015

2014

2012

2010

2009

2008

2006

2005

2004

2003

2002

Wrote 27 papers:

ICLP-J-2015-FichteTW #logic programming #source code: Dual-normal logic programs — the forgotten class (JKF, MT, SW), pp. 495–510.
ICLP-J-2015-GagglMRWW #encoding #programming: Improved answer-set programming encodings for abstract argumentation (SAG, NM, AR, JPW, SW), pp. 434–448.
KR-2014-DunneDLW #multi: Characteristics of Multiple Viewpoints in Abstract Argumentation (PED, WD, TL, SW).
ICLP-2012-MorakW #preprocessor #programming #set: Preprocessing of Complex Non-Ground Rules in Answer Set Programming (MM, SW), pp. 247–258.
ICLP-J-2012-BliemMW #declarative #named #problem #programming #using: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (BB, MM, SW), pp. 445–464.
KR-2012-CreignouPPW #logic: Belief Revision within Fragments of Propositional Logic (NC, OP, RP, SW).
KR-2012-DvorakJWW: Complexity-Sensitive Decision Procedures for Abstract Argumentation (WD, MJ, JPW, SW).
KR-2012-FaberTW #equivalence #optimisation #problem: Strong Equivalence of Qualitative Optimization Problems (WF, MT, SW).
KR-2010-BrewkaW #framework: Abstract Dialectical Frameworks (GB, SW).
KR-2010-DvorakPW #algorithm #parametricity #towards: Towards Fixed-Parameter Tractable Algorithms for Argumentation (WD, RP, SW).
KR-2010-OikarinenW #equivalence #framework: Characterizing Strong Equivalence for Argumentation Frameworks (EO, SW).
KR-2010-PichlerRSW #bound #constraints #programming: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).
ICLP-2009-DelgrandeSTW #logic programming #semantics #set #source code: Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
PPDP-2009-DvorakGPW #paradigm #programming: Alternation as a programming paradigm (WD, GG, RP, SW), pp. 61–72.
ICLP-2008-EglyGW #framework #implementation #named #programming #using: ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming (UE, SAG, SW), pp. 734–738.
ICLP-2008-PuhrerTW #source code: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.
ICLP-2008-TruszczynskiW #composition #logic programming #source code: Relativized Hyperequivalence of Logic Programs for Modular Programming (MT, SW), pp. 576–590.
KR-2008-DelgrandeSTW #logic programming #semantics #set #source code: Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KR-2008-FaberTW #equivalence #logic programming #order #source code: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
KR-2006-EiterFTTW #programming: Replacements in Non-Ground Answer-Set Programming (TE, MF, HT, PT, SW), pp. 340–351.
ICLP-2005-TompitsW #equivalence #implementation #programming #towards: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming (HT, SW), pp. 189–203.
ICLP-2004-LinkeTW #logic programming #on the #source code: On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.
KR-2004-EiterFFPW #bound #complexity #model checking #programming #set: Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.
KR-2004-EiterFTW #logic programming #on the: On Eliminating Disjunctions in Stable Logic Programming (TE, MF, HT, SW), pp. 447–458.
SAT-2003-EglySTWZ #quantifier: Comparing Different Prenexing Strategies for Quantified Boolean Formulas (UE, MS, HT, SW, MZ), pp. 214–228.
ICLP-2002-PearceSSTW #logic programming #polynomial #source code: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report (DP, VS, TS, HT, SW), pp. 405–420.
SAT-2002-EglyWP #on the #problem: On deciding subsumption problems (UE, SW, RP), p. 36.