2020

• Österreichische AI Strategie aus Sicht der Wissenschaft / Moser, B., Dorffner, G., Eiter, T., Faber, W., Klambauer, G., Legenstein, R., Nessler, B., Polleres, A., & Woltran, S. (2020). Österreichische AI Strategie aus Sicht der Wissenschaft. OCG Journal, 01–02, 14–17. http://hdl.handle.net/20.500.12708/141528

2019

• Strong Equivalence for Epistemic Logic Programs Made Easy / Faber, W., Morak, M., & Woltran, S. (2019). Strong Equivalence for Epistemic Logic Programs Made Easy. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2809–2816). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012809
  Project: START (2014–2022)
• On Uniform Equivalence of Epistemic Logic Programs / FABER, W., MORAK, M., & WOLTRAN, S. (2019). On Uniform Equivalence of Epistemic Logic Programs. Theory and Practice of Logic Programming, 19(5–6), 826–840. https://doi.org/10.1017/s1471068419000218

2017

• Answer Set Programming with External Source Access / Eiter, T., Kaminski, T. D., Redl, C., Schüller, P., & Weinzierl, A. (2017). Answer Set Programming with External Source Access. In G. Ianni, D. Lembo, L. Bertossi, W. Faber, B. Glimm, G. Gottlob, & S. Staab (Eds.), Reasoning Web. Semantic Interoperability on the Web : 13th International Summer School 2017, London, UK, July 7-11, 2017, Tutorial Lectures. Springer. https://doi.org/10.1007/978-3-319-61033-7_7
  Download: PDF (662 KB)

2016

• Counting Answer Sets via Dynamic Programming / Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2016). Counting Answer Sets via Dynamic Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 14). http://hdl.handle.net/20.500.12708/56808
  Project: START (2014–2022)
• Clique-Width and Directed Width Measures for Answer-Set Programming / Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 17). http://hdl.handle.net/20.500.12708/56809
  Project: START (2014–2022)

2015

• Ontology-Mediated Query Answering with Data-Tractable Description Logics / Bienvenu, M., & Ortiz, M. (2015). Ontology-Mediated Query Answering with Data-Tractable Description Logics. In W. Faber & A. Paschke (Eds.), Reasoning Web. Web Logic Rules (pp. 218–307). Springer LNCS. https://doi.org/10.1007/978-3-319-21768-0_9
  Project: SemDat (2012–2016)

2014

• Complexity of super-coherence problems in ASP / ALVIANO, M., FABER, W., & WOLTRAN, S. (2014). Complexity of super-coherence problems in ASP. Theory and Practice of Logic Programming, 14(3), 339–361. https://doi.org/10.1017/s147106841300001x

2013

• Eliminating Nonmonotonic DL-Atoms in Description Logic Programs / Wang, Y., You, J.-H., Yuan, L. Y., Shen, Y.-D., & Eiter, T. (2013). Eliminating Nonmonotonic DL-Atoms in Description Logic Programs. In D. Lembo & W. Faber (Eds.), Web Reasoning and Rule Systems (pp. 168–182). https://doi.org/10.1007/978-3-642-39666-3_13
  Project: Hybride Wissensbasen (2008–2012)
• Strong Equivalence of Qualitative Optimization Problems / Faber, W., Truszczyński, M., & Woltran, S. (2013). Strong Equivalence of Qualitative Optimization Problems. Journal of Artificial Intelligence Research, 47, 351–391. https://doi.org/10.1613/jair.3991
• Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence / Faber, W., Truszczynski, M., & Woltran, S. (2013). Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (pp. 297–303). AAAI Press. http://hdl.handle.net/20.500.12708/54899

2012

• Strong Equivalence of Qualitative Optimization Problems / Faber, W., Truszczynski, M., & Woltran, S. (2012). Strong Equivalence of Qualitative Optimization Problems. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (pp. 188–198). AAAI Press. http://hdl.handle.net/20.500.12708/54159

2011

• Manifold Answer-Set Programs and Their Applications / Faber, W., & Woltran, S. (2011). Manifold Answer-Set Programs and Their Applications. In M. Balduccini & T. C. Son (Eds.), Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. Springer-Verlag. http://hdl.handle.net/20.500.12708/27229
• Pushing Efficient Evaluation of HEX Programs by Modular Decomposition / Eiter, T., Fink, M., Ianni, G., Krennwallner, T., & Schüller, P. (2011). Pushing Efficient Evaluation of HEX Programs by Modular Decomposition. In J. P. Delgrande & W. Faber (Eds.), Logic Programming and Nonmonotonic Reasoning. 11th International Conference, LPNMR 2011 (pp. 93–106). Springer. https://doi.org/10.1007/978-3-642-20895-9_10
  Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)
• Symmetry Breaking for Distributed Multi-Context Systems / Drescher, C., Eiter, T., Fink, M., Krennwallner, T., & Walsh, T. (2011). Symmetry Breaking for Distributed Multi-Context Systems. In J. P. Delgrande & W. Faber (Eds.), Logic Programming and Nonmonotonic Reasoning. 11th International Conference, LPNMR 2011 (pp. 26–39). Springer. https://doi.org/10.1007/978-3-642-20895-9_5
  Projects: HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / IncMan (2009–2012) / Net2 (2010–2013)
• Relational Information Exchange and Aggregation in Multi-Context Systems / Fink, M., Ghionna, L., & Weinzierl, A. (2011). Relational Information Exchange and Aggregation in Multi-Context Systems. In J. P. Delgrande & W. Faber (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 120–133). Springer. https://doi.org/10.1007/978-3-642-20895-9_12
  Projects: HEX-Programme (2008–2012) / IncMan (2009–2012)
• Complexity of Super-Coherence Problems in ASP / Alviano, M., Faber, W., & Woltran, S. (2011). Complexity of Super-Coherence Problems in ASP. Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2010, Edinburgh, Non-EU. http://hdl.handle.net/20.500.12708/85143
• Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems / Eiter, T., Fink, M., & Schüller, P. (2011). Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems. In J. P. Delgrande & W. Faber (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 107–119). Springer. https://doi.org/10.1007/978-3-642-20895-9_11
  Project: IncMan (2009–2012)

2010

• Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities / Eiter, T., Mushthofa, M., & Faber, W. (2010). Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities. In M. Fox & D. Poole (Eds.), Proceedings of the 24th National Conference on Artificial Intelligence (AAAI 2010) (pp. 303–308). AAAI Press. http://hdl.handle.net/20.500.12708/53560
  Projects: Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)

2009

• Manifold Answer-Set Programs for Meta-reasoning / Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-reasoning. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 115–128). Springer. https://doi.org/10.1007/978-3-642-04238-6_12
  Projects: Argu (2009–2012) / TTPC (2008–2012)
• A Framework for Programming with Module Consequences / Faber, W., & Woltran, S. (2009). A Framework for Programming with Module Consequences. In M. De Vos & T. Schaub (Eds.), Proc. of the 2#^{nd} International Workshop on Software Engineering for Answer Set Programming (SEA’09) (pp. 34–48). http://hdl.handle.net/20.500.12708/52763
  Projects: Argu (2009–2012) / TTPC (2008–2012)
• Manifold Answer-Set Programs for Meta-Reasoning / Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-Reasoning. In A. Herzig & B. Johnston (Eds.), Proc. of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC’09) (pp. 33–40). ePress of the University of Technology, Sydney. http://hdl.handle.net/20.500.12708/52762
  Projects: Argu (2009–2012) / TTPC (2008–2012)

2008

• Notions of Strong Equivalence for Logic Programs with Ordered Disjunction / Faber, W., Tompits, H., & Woltran, S. (2008). Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. In G. Brewka & J. Lang (Eds.), Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR’08) (pp. 433–443). AAAI Press. http://hdl.handle.net/20.500.12708/52556
  Project: Formale Methoden (2005–2008)
• Answer-Set Programming Encodings for Argumentation Frameworks / Egly, U., Gaggl, S. A., & Woltran, S. (2008). Answer-Set Programming Encodings for Argumentation Frameworks. In W. Faber & J. Lee (Eds.), ICLP-Workshop Proceedings; Proceedings of the 1st International Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008 (pp. 1–15). http://hdl.handle.net/20.500.12708/52469

2007

• A Logic-Based Approach to Finding Explanations for Discrepencies in Optimistic Plan Execution / Eiter, T., Erdem, E., Faber, W., & Senko, J. (2007). A Logic-Based Approach to Finding Explanations for Discrepencies in Optimistic Plan Execution. Fundamenta Informaticae, 79(1–2), 25–69. http://hdl.handle.net/20.500.12708/169658
• What should an ASP Solver output? / Brain, M., Faber, W., Maratea, M., Polleres, A. F., Schaub, T., & Schindlauer, R. (2007). What should an ASP Solver output? In M. De Vos & T. Schaub (Eds.), First International Workshop on Software Engineering for Answer Set Programming 2007 (SEA’07) (pp. 26–37). http://hdl.handle.net/20.500.12708/51938
• Complexity results for answer set programming with bounded predicate arities and implications / Eiter, T., Faber, W., Fink, M., & Woltran, S. (2007). Complexity results for answer set programming with bounded predicate arities and implications. Annals of Mathematics and Artificial Intelligence, 51(2–4), 123–165. https://doi.org/10.1007/s10472-008-9086-5
• Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions / Faber, W., Tompits, H., & Woltran, S. (2007). Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions. In 3rd Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2007) (p. 8). http://hdl.handle.net/20.500.12708/51849
• On Reversing Actions: Algorithms and Complexity / Eiter, T., Erdem, E., & Faber, W. (2007). On Reversing Actions: Algorithms and Complexity. In M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07) (pp. 336–341). AAAI Press/IJCAI. http://hdl.handle.net/20.500.12708/51911

2006

• The DLV System for knowledge representation and reasoning / Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006). The DLV System for knowledge representation and reasoning. ACM Transactions on Computational Logic, VOL. 7(3), 499–562. http://hdl.handle.net/20.500.12708/173399

2005

• Declarative Planning and Knowledge Representation in an Action Language / Eiter, T., Faber, W., Pfeifer, G., & Polleres, A. F. (2005). Declarative Planning and Knowledge Representation in an Action Language. In I. Vlahavas & D. Vrakas (Eds.), Intelligent Techniques for Planning (pp. 1–34). Idea Group Publishing. http://hdl.handle.net/20.500.12708/25376
• Data Integration: a Challenging ASP Application / Leone, N., Eiter, T., Faber, W., & Fink, M. (2005). Data Integration: a Challenging ASP Application. In C. Baral (Ed.), Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005) (pp. 379–383). Springer. http://hdl.handle.net/20.500.12708/51271
• Testing Strong Equivalence of Datalog Programs: Implementation and Examples / Eiter, T., Faber, W., & Traxler, P. (2005). Testing Strong Equivalence of Datalog Programs: Implementation and Examples. In C. Baral (Ed.), Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005) (pp. 437–441). Springer. http://hdl.handle.net/20.500.12708/51264
• The INFOMIX System for Advanced Integration of Incomplete and Inconsistent Data / Leone, N., Eiter, T., Faber, W., & Fink, M. (2005). The INFOMIX System for Advanced Integration of Incomplete and Inconsistent Data. In Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (SIGMOD/PODS 2005 Conference) (pp. 915–917). ACM. http://hdl.handle.net/20.500.12708/51257
• Solving Hard Problems for the Second Level of the Polynomial Hierarchy: Heuristics and Benchmarks / Faber, W., Leone, N., & Ricca, F. (2005). Solving Hard Problems for the Second Level of the Polynomial Hierarchy: Heuristics and Benchmarks. http://hdl.handle.net/20.500.12708/33051
• A Backjumping Technique for Disjunctive Logic Programming / Ricca, F., Faber, W., & Leone, N. (2005). A Backjumping Technique for Disjunctive Logic Programming. http://hdl.handle.net/20.500.12708/33050
• Data Cleaning Tasks for the INFOMIX Demo Scenario / Smetannikov, A., Soloviev, E., Eiter, T., Faber, W., & Fink, M. (2005). Data Cleaning Tasks for the INFOMIX Demo Scenario. http://hdl.handle.net/20.500.12708/33057
• Optimizing Wrapper Access and Query Plan Generation for the INFOMIX System / Smetannikov, A., Soloviev, E., Eiter, T., & Faber, W. (2005). Optimizing Wrapper Access and Query Plan Generation for the INFOMIX System. http://hdl.handle.net/20.500.12708/33056

2004

• Self-assessment report for year 2 / Eiter, T., Faber, W., & Tompits, H. (2004). Self-assessment report for year 2. http://hdl.handle.net/20.500.12708/32952
• Methods and Techniques for Query Optimization / Eiter, T., Faber, W., Fink, M., Greco, G., Lembo, D., & Tompits, H. (2004). Methods and Techniques for Query Optimization. http://hdl.handle.net/20.500.12708/32951
• Undoing the Effects of Action Sequences / Eiter, T., Erdem, E., & Faber, W. (2004). Undoing the Effects of Action Sequences. http://hdl.handle.net/20.500.12708/32948
• Diagnosing Plan Execution Discrepancies in a Logic-Based Action Framework / Eiter, T., Erdem, E., & Faber, W. (2004). Diagnosing Plan Execution Discrepancies in a Logic-Based Action Framework. http://hdl.handle.net/20.500.12708/32947

2003

• Uniform Equivalence of Logic Programs under the Stable Model Semantics / Faber, W. (2003). Uniform Equivalence of Logic Programs under the Stable Model Semantics. Logic Programming, 19th International Conference, ICLP 2003, Mumbai, India, Austria. http://hdl.handle.net/20.500.12708/84239
• Efficient Evaluation of Logic Programs for Querying Data Integration Systems / Faber, W. (2003). Efficient Evaluation of Logic Programs for Querying Data Integration Systems. Logic Programming, 19th International Conference, ICLP 2003, Mumbai, India, Austria. http://hdl.handle.net/20.500.12708/84238
• Disjunctive Logic Programming - Problem-Solving Techniques, Systems, and Applications / Faber, W. (2003). Disjunctive Logic Programming - Problem-Solving Techniques, Systems, and Applications. APPIA-GULP-PRODE 2003 - 2003 Joint Conference on Declarative Programming, Reggio Calabria, Italy, Austria. http://hdl.handle.net/20.500.12708/84216
• Methods for data acquisition and transformation / Eiter, T., Faber, W., Fink, M., Woltran, S., & Zalewska, L. (2003). Methods for data acquisition and transformation. http://hdl.handle.net/20.500.12708/32954
• Complexity of Answer Set Checking and Bounded Predicate Arities for Non-Ground Answer Set Programming / Eiter, T., Faber, W., Pfeifer, G., Fink, M., & Woltran, S. (2003). Complexity of Answer Set Checking and Bounded Predicate Arities for Non-Ground Answer Set Programming. http://hdl.handle.net/20.500.12708/32930
• Semantics and Computation of Aggregate Functions in Disjunctive Logic Programming / Dell´Armi, T., Faber, W., Ielpa, G., Leone, N., & Pfeifer, G. (2003). Semantics and Computation of Aggregate Functions in Disjunctive Logic Programming. http://hdl.handle.net/20.500.12708/32912

2002

• Enhancing efficiency and expressiveness in answer set programming systems / Faber, W. (2002). Enhancing efficiency and expressiveness in answer set programming systems [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181245
• Knowledge-based Planning and ASP / Faber, W. (2002). Knowledge-based Planning and ASP. Dagstuhl Seminar Nr. 02381, Nonmonotonic Reasoning, Answer Set Programming and Constraints, Schloss Dagstuhl, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84212
• Logic-based Planning / Faber, W. (2002). Logic-based Planning. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84211
• ASP-based Planning / Faber, W. (2002). ASP-based Planning. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84210
• Answer Set Programming / Faber, W. (2002). Answer Set Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84209
• Review of Techniques and Systems for Acquisition and Tranformation of Heterogenous Data / Eiter, T., Faber, W., Fink, M., & Kurushin, D. (2002). Review of Techniques and Systems for Acquisition and Tranformation of Heterogenous Data. http://hdl.handle.net/20.500.12708/32799
• The DLV System for Knowledge Representation and Reasoning (INFSYS RR-1843-02-14) / Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., & Scarcello, F. (2002). The DLV System for Knowledge Representation and Reasoning  (INFSYS RR-1843-02-14). http://hdl.handle.net/20.500.12708/32798
• Answer Set Planning under Action Costs (INFSYS RR-1843-02-13) / Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. F. (2002). Answer Set Planning under Action Costs (INFSYS RR-1843-02-13). http://hdl.handle.net/20.500.12708/32797
• Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming / Eiter, T., Faber, W., Leone, N., & Pfeifer, G. (2002). Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming. http://hdl.handle.net/20.500.12708/32791