default search action
Wolfgang Faber 0001
Person information
- affiliation: Alpen-Adria Universität Klagenfurt, Austria
- affiliation: University of Huddersfield, UK
- affiliation: University of Calabria, Rende, Italy
- affiliation: Vienna University of Technology, Austria
Other persons with the same name
- Wolfgang Faber 0002 — Wirtschaftsuniversität Wien, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j43]Haya Majid Qureshi, Wolfgang Faber:
Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL. Theory Pract. Log. Program. 24(2): 368-393 (2024) - [c94]Jakub Med, Lukás Chrpa, Michael Morak, Wolfgang Faber:
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity. ICAPS 2024: 369-377 - [c93]Wolfgang Faber:
Solving Argumentation Problems Using Answer Set Programming with Quantifiers: Preliminary Report. ICLP Workshops 2024 - [i29]Haya Majid Qureshi, Wolfgang Faber:
Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL. CoRR abs/2402.02978 (2024) - 2023
- [j42]Mario Alviano, Wolfgang Faber, Martin Gebser:
Aggregate Semantics for Propositional Answer Set Programs. Theory Pract. Log. Program. 23(1): 157-194 (2023) - [j41]Wolfgang Faber, Giuseppe Mazzotta, Francesco Ricca:
An Efficient Solver for ASP(Q). Theory Pract. Log. Program. 23(4): 948-964 (2023) - [c92]Wolfgang Faber, Michael Morak:
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers. AAAI 2023: 6322-6329 - [c91]Wolfgang Faber, Giuseppe Mazzotta, Francesco Ricca:
Enhancing ASP(Q) evaluation. DP@AI*IA 2023: 38-46 - [c90]Haya Majid Qureshi, Wolfgang Faber:
Using Hybrid Knowledge Bases for Meta-reasoning over OWL 2 QL. PADL 2023: 216-231 - [e11]Joaquín Arias, Sotiris Batsakis, Wolfgang Faber, Gopal Gupta, Francesco Pacenza, Emmanuel Papadakis, Livio Robaldo, Kilian Rückschloß, Elmer Salazar, Zeynep G. Saribatur, Ilias Tachmazidis, Felix Weitkämper, Adam Z. Wyner:
Proceedings of the International Conference on Logic Programming 2023 Workshops co-located with the 39th International Conference on Logic Programming (ICLP 2023), London, United Kingdom, July 9th and 10th, 2023. CEUR Workshop Proceedings 3437, CEUR-WS.org 2023 [contents] - [i28]Wolfgang Faber, Giuseppe Mazzotta, Francesco Ricca:
An efficient solver for ASP(Q). CoRR abs/2305.10021 (2023) - 2022
- [j40]Jorge Fandinno, Wolfgang Faber, Michael Gelfond:
Thirty years of Epistemic Specifications. Theory Pract. Log. Program. 22(6): 1043-1083 (2022) - [c89]Haya Majid Qureshi, Wolfgang Faber:
Meta-reasoning over OWL 2 QL using Datalog. Datalog 2022: 181-187 - [c88]Wolfgang Faber, Michael Morak:
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers. HYDRA/RCRA@LPNMR 2022: 78-89 - [c87]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers. PADL 2022: 42-56 - [e10]Joaquín Arias, Roberta Calegari, Luke Dickens, Wolfgang Faber, Jorge Fandinno, Gopal Gupta, Markus Hecher, Daniela Inclezan, Emily LeBlanc, Michael Morak, Elmer Salazar, Jessica Zangari:
Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, July 31st - August 1st, 2022. CEUR Workshop Proceedings 3193, CEUR-WS.org 2022 [contents] - 2021
- [j39]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Francesco Ricca:
Paracoherent answer set computation. Artif. Intell. 299: 103519 (2021) - [j38]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming. Theory Pract. Log. Program. 21(5): 646-662 (2021) - [c86]Lukás Chrpa, Wolfgang Faber, Michael Morak:
Universal and Uniform Action Reversibility. KR 2021: 651-654 - [c85]Haya Majid Qureshi, Wolfgang Faber:
An Evaluation of Meta-reasoning over OWL 2 QL. RuleML+RR 2021: 218-233 - [e9]Wolfgang Faber, Gerhard Friedrich, Martin Gebser, Michael Morak:
Logics in Artificial Intelligence - 17th European Conference, JELIA 2021, Virtual Event, May 17-20, 2021, Proceedings. Lecture Notes in Computer Science 12678, Springer 2021, ISBN 978-3-030-75774-8 [contents] - [i27]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming. CoRR abs/2108.05428 (2021) - [i26]Jorge Fandinno, Wolfgang Faber, Michael Gelfond:
Thirty years of Epistemic Specifications. CoRR abs/2108.07669 (2021) - [i25]Mario Alviano, Wolfgang Faber, Martin Gebser:
Aggregate Semantics for Propositional Answer Set Programs. CoRR abs/2109.08662 (2021) - 2020
- [j37]Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea, Francesco Ricca, Torsten Schaub:
ASP-Core-2 Input Language Format. Theory Pract. Log. Program. 20(2): 294-309 (2020) - [c84]Wolfgang Faber:
Reversibility of Actions and Plans (invited talk). CILC 2020: 1 - [c83]Wolfgang Faber, Michael Morak:
Determining Action Reversibility in STRIPS Using Epistemic Logic Programs. ICLP Workshops 2020 - [c82]Lukás Chrpa, Wolfgang Faber, Daniel Fiser, Michael Morak:
Determining Action Reversibility in STRIPS Using Answer Set Programming. ICLP Workshops 2020 - [c81]Michael Morak, Lukás Chrpa, Wolfgang Faber, Daniel Fiser:
On the Reversibility of Actions in Planning. KR 2020: 652-661 - [c80]Haya Majid Qureshi, Wolfgang Faber:
Supporting Metamodeling in Ontologies Using Rules. RuleML+RR (Supplement) 2020: 95-102 - [c79]Wolfgang Faber:
An Introduction to Answer Set Programming and Some of Its Extensions. RW 2020: 149-185 - [e8]Carmine Dodaro, George Aristidis Elder, Wolfgang Faber, Jorge Fandinno, Martin Gebser, Markus Hecher, Emily LeBlanc, Michael Morak, Jessica Zangari:
International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020. CEUR Workshop Proceedings 2678, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [j36]Wolfgang Faber, Michael Morak, Stefan Woltran:
On Uniform Equivalence of Epistemic Logic Programs. Theory Pract. Log. Program. 19(5-6): 826-840 (2019) - [c78]Wolfgang Faber, Michael Morak, Stefan Woltran:
Strong Equivalence for Epistemic Logic Programs Made Easy. AAAI 2019: 2809-2816 - [c77]Mario Alviano, Wolfgang Faber:
Chain Answer Sets for Logic Programs with Generalized Atoms. JELIA 2019: 462-478 - [c76]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Luca Pulina, Francesco Ricca:
Algorithm Selection for Paracoherent Answer Set Computation. JELIA 2019: 479-489 - [i24]Wolfgang Faber, Michael Morak, Stefan Woltran:
On Uniform Equivalence of Epistemic Logic Programs. CoRR abs/1907.10925 (2019) - [i23]Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea, Francesco Ricca, Torsten Schaub:
ASP-Core-2 Input Language Format. CoRR abs/1911.04326 (2019) - 2018
- [j35]Mario Alviano, Wolfgang Faber:
Aggregates in Answer Set Programming. Künstliche Intell. 32(2-3): 119-124 (2018) - [j34]Weronika T. Adrian, Mario Alviano, Francesco Calimeri, Bernardo Cuteri, Carmine Dodaro, Wolfgang Faber, Davide Fuscà, Nicola Leone, Marco Manna, Simona Perri, Francesco Ricca, Pierfrancesco Veltri, Jessica Zangari:
The ASP System DLV: Advancements and Applications. Künstliche Intell. 32(2-3): 177-179 (2018) - [c75]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Francesco Ricca:
Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. AAAI 2018: 1720-1727 - [c74]Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Enumerating Preferred Extensions Using ASP Domain Heuristics: The ASPrMin Solver. COMMA 2018: 459-460 - [c73]Tomás Skerík, Lukás Chrpa, Wolfgang Faber, Mauro Vallati:
Automated Training Plan Generation for Athletes. SMC 2018: 3865-3870 - [e7]Wolfgang Faber, Paul Fodor, Giovanni De Gasperis, Adrian Giurca, Kia Teymourian:
Proceedings of the Doctoral Consortium and Challenge @ RuleML+RR 2018 hosted by 2nd International Joint Conference on Rules and Reasoning (RuleML+RR 2018), Luxembourg, September 20-26, 2018. CEUR Workshop Proceedings 2204, CEUR-WS.org 2018 [contents] - [i22]Wolfgang Faber, Michael Morak, Stefan Woltran:
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version). CoRR abs/1811.04800 (2018) - 2017
- [c72]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca:
On the Computation of Paracoherent Answer Sets. AAAI 2017: 1034-1040 - [e6]Giovambattista Ianni, Domenico Lembo, Leopoldo E. Bertossi, Wolfgang Faber, Birte Glimm, Georg Gottlob, Steffen Staab:
Reasoning Web. Semantic Interoperability on the Web - 13th International Summer School 2017, London, UK, July 7-11, 2017, Tutorial Lectures. Lecture Notes in Computer Science 10370, Springer 2017, ISBN 978-3-319-61032-0 [contents] - [i21]Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca:
On the Computation of Paracoherent Answer Sets. CoRR abs/1707.06813 (2017) - 2016
- [c71]Mario Alviano, Wolfgang Faber, Hannes Strass:
Boolean Functions with Ordered Domains in Answer Set Programming. AAAI 2016: 879-885 - [c70]Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation. ECAI 2016: 966-973 - [c69]Christopher Brenton, Wolfgang Faber, Sotiris Batsakis:
Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments. ICLP (Technical Communications) 2016: 4:1-4:15 - [c68]Mario Alviano, Wolfgang Faber, Martin Gebser:
From Non-Convex Aggregates to Monotone Aggregates in ASP. IJCAI 2016: 4100-4194 - [c67]Tomás Skerík, Wolfgang Faber, Lukás Chrpa:
Proposing of Planning System for Sports Domain: A Tool for Professional Coaches. PlanSIG 2016 - [i20]Wolfgang Faber, Mauro Vallati, Federico Cerutti, Massimiliano Giacomin:
Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation. CoRR abs/1612.07589 (2016) - 2015
- [j33]Mario Alviano, Wolfgang Faber:
Effectively solving NP-SPEC encodings by translation to ASP. J. Exp. Theor. Artif. Intell. 27(5): 577-601 (2015) - [j32]Domenico Lembo, Wolfgang Faber:
Web reasoning and rule systems. Semantic Web 6(5): 425-426 (2015) - [j31]Mario Alviano, Wolfgang Faber, Martin Gebser:
Rewriting recursive aggregates in answer set programming: back to monotonicity. Theory Pract. Log. Program. 15(4-5): 559-573 (2015) - [c66]Mario Alviano, Wolfgang Faber:
Stable Model Semantics of Abstract Dialectical Frameworks Revisited: A Logic Programming Perspective. IJCAI 2015: 2684-2690 - [c65]Mario Alviano, Wolfgang Faber:
Supportedly Stable Answer Sets for Logic Programs with Generalized Atoms. RR 2015: 30-44 - [e5]Wolfgang Faber, Adrian Paschke:
Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin, Germany, July 31 - August 4, 2015, Tutorial Lectures. Lecture Notes in Computer Science 9203, Springer 2015, ISBN 978-3-319-21767-3 [contents] - [i19]Mario Alviano, Wolfgang Faber, Martin Gebser:
Rewriting recursive aggregates in answer set programming: back to monotonicity. CoRR abs/1507.03923 (2015) - 2014
- [j30]Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of super-coherence problems in ASP. Theory Pract. Log. Program. 14(3): 339-361 (2014) - [j29]Ilias Tachmazidis, Grigoris Antoniou, Wolfgang Faber:
Efficient Computation of the Well-Founded Semantics over Big Data. Theory Pract. Log. Program. 14(4-5): 445-459 (2014) - [i18]Mario Alviano, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri:
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates. CoRR abs/1401.4596 (2014) - [i17]Mario Alviano, Wolfgang Faber:
Semantics and Compilation of Answer Set Programming with Generalized Atoms. CoRR abs/1405.1287 (2014) - [i16]Ilias Tachmazidis, Grigoris Antoniou, Wolfgang Faber:
Efficient Computation of the Well-Founded Semantics over Big Data. CoRR abs/1405.2590 (2014) - 2013
- [j28]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. J. Artif. Intell. Res. 47: 351-391 (2013) - [j27]Wolfgang Faber, Nicola Leone:
Introduction to the special issue on the 25th annual GULP conference. Theory Pract. Log. Program. 13(2): 147-148 (2013) - [c64]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. AAAI 2013: 297-303 - [c63]Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca:
WASP: A Native ASP Solver Based on Constraint Learning. LPNMR 2013: 54-66 - [c62]Mario Alviano, Wolfgang Faber:
The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics. LPNMR 2013: 67-72 - [c61]Wolfgang Faber:
Answer Set Programming. Reasoning Web 2013: 162-193 - [c60]Mario Alviano, Wolfgang Faber, Nicola Leone, Marco Manna:
Query Answering over Disjunctive Datalog with Existential Quantifiers. SEBD 2013: 393-400 - [e4]Wolfgang Faber, Domenico Lembo:
Web Reasoning and Rule Systems - 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings. Lecture Notes in Computer Science 7994, Springer 2013, ISBN 978-3-642-39665-6 [contents] - [i15]Mario Alviano, Wolfgang Faber:
Translating NP-SPEC into ASP. CoRR abs/1301.1385 (2013) - [i14]Mario Alviano, Wolfgang Faber:
Properties of Answer Set Programming with Convex Generalized Atoms. CoRR abs/1312.6096 (2013) - 2012
- [j26]Mario Alviano, Wolfgang Faber, Gianluigi Greco, Nicola Leone:
Magic Sets for disjunctive Datalog programs. Artif. Intell. 187: 156-192 (2012) - [j25]Mario Alviano, Wolfgang Faber, Nicola Leone, Marco Manna:
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues. Theory Pract. Log. Program. 12(4-5): 701-718 (2012) - [c59]Jürgen Dix, Wolfgang Faber, V. S. Subrahmanian:
Privacy Preservation Using Multi-context Systems and Default Logic. Correct Reasoning 2012: 195-210 - [c58]Wolfgang Faber, Nicola Leone, Simona Perri:
The Intelligent Grounder of DLV. Correct Reasoning 2012: 247-264 - [c57]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. KR 2012 - [c56]Wolfgang Faber:
A Polynomial Reduction from ASPDA to ASP. RR 2012: 213-216 - [i13]Mario Alviano, Wolfgang Faber, Gianluigi Greco, Nicola Leone:
Magic Sets for Disjunctive Datalog Programs. CoRR abs/1204.6346 (2012) - [i12]Mario Alviano, Wolfgang Faber, Nicola Leone, Marco Manna:
Disjunctive Datalog with Existential Quantifiers: Semantics, Decidability, and Complexity Issues. CoRR abs/1210.2316 (2012) - [i11]Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of super-coherence problems in ASP. CoRR abs/1212.5895 (2012) - 2011
- [j24]Wolfgang Faber, Gerald Pfeifer, Nicola Leone:
Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1): 278-298 (2011) - [j23]Mario Alviano, Wolfgang Faber:
Dynamic Magic Sets and super-coherent answer set programs. AI Commun. 24(2): 125-145 (2011) - [j22]Wolfgang Faber, Nicola Leone, Marco Maratea, Francesco Ricca:
Look-back Techniques for ASP Programs with Aggregates. Fundam. Informaticae 107(4): 379-413 (2011) - [j21]Mario Alviano, Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri:
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates. J. Artif. Intell. Res. 42: 487-527 (2011) - [c55]Wolfgang Faber, Stefan Woltran:
Manifold Answer-Set Programs and Their Applications. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 44-63 - [c54]Carmine Dodaro, Mario Alviano, Wolfgang Faber, Nicola Leone, Francesco Ricca, Marco Sirianni:
The Birth of a WASP: Preliminary Report on a New ASP Solver. CILC 2011: 99-113 - [c53]Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of Super-Coherence Problems in Answer Set Programming. CILC 2011: 131-145 - [c52]Wolfgang Faber:
Privacy Preservation Using Multi-Context Systems. Log-IC@LPNMR 2011: 45-51 - [c51]Francesco Calimeri, Giovambattista Ianni, Francesco Ricca, Mario Alviano, Annamaria Bria, Gelsomina Catalano, Susanna Cozza, Wolfgang Faber, Onofrio Febbraro, Nicola Leone, Marco Manna, Alessandra Martello, Claudio Panetta, Simona Perri, Kristian Reale, Maria Carmela Santoro, Marco Sirianni, Giorgio Terracina, Pierfrancesco Veltri:
The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track. LPNMR 2011: 388-403 - [e3]James P. Delgrande, Wolfgang Faber:
Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings. Lecture Notes in Computer Science 6645, Springer 2011, ISBN 978-3-642-20894-2 [contents] - [i10]Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres:
Answer Set Planning Under Action Costs. CoRR abs/1106.5257 (2011) - [i9]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. CoRR abs/1112.0791 (2011) - 2010
- [j20]Mario Alviano, Wolfgang Faber, Nicola Leone:
Disjunctive ASP with functions: Decidable queries and effective computation. Theory Pract. Log. Program. 10(4-6): 497-512 (2010) - [c50]Thomas Eiter, Wolfgang Faber, Mushthofa Mushthofa:
Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities. AAAI 2010: 303-308 - [c49]Mario Alviano, Wolfgang Faber, Nicola Leone:
Well-Founded Semantics for Logic Programs with Aggregates: Implementation and Experimentation. RCRA@CPAIOR 2010 - [c48]Mario Alviano, Wolfgang Faber, Nicola Leone, Simona Perri, Gerald Pfeifer, Giorgio Terracina:
The Disjunctive Datalog System DLV. Datalog 2010: 282-301 - [e2]Wolfgang Faber, Nicola Leone:
Proceedings of the 25th Italian Conference on Computational Logic, Rende, Italy, July 7-9, 2010. CEUR Workshop Proceedings 598, CEUR-WS.org 2010 [contents] - [i8]Mario Alviano, Wolfgang Faber, Nicola Leone:
Disjunctive ASP with Functions: Decidable Queries and Effective Computation. CoRR abs/1007.4028 (2010) - [i7]Mario Alviano, Wolfgang Faber:
Dynamic Magic Sets for Super-Consistent Answer Set Programs. CoRR abs/1011.4377 (2010)
2000 – 2009
- 2009
- [j19]Annamaria Bria, Wolfgang Faber, Nicola Leone:
Normal Form Nested Programs. Fundam. Informaticae 96(3): 271-295 (2009) - [c47]Wolfgang Faber, Stefan Woltran:
Manifold Answer-Set Programs for Meta-reasoning. LPNMR 2009: 115-128 - [c46]Annamaria Bria, Wolfgang Faber, Nicola Leone:
nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver. LPNMR 2009: 477-482 - 2008
- [j18]Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone:
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. J. Algorithms 63(1-3): 70-89 (2008) - [j17]Thomas Eiter, Esra Erdem, Wolfgang Faber:
Undoing the effects of action sequences. J. Appl. Log. 6(3): 380-415 (2008) - [j16]Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'Armi, Giuseppe Ielpa:
Design and implementation of aggregate functions in the DLV system. Theory Pract. Log. Program. 8(5-6): 545-580 (2008) - [c45]Wolfgang Faber, Gianluigi Greco, Nicola Leone:
Magic Sets for Data Integration. AAAI 2008: 1528-1531 - [c44]Nicola Leone, Wolfgang Faber:
The DLV Project: A Tour from Theory and Research to Applications and Market. ICLP 2008: 53-68 - [c43]Annamaria Bria, Wolfgang Faber, Nicola Leone:
Normal Form Nested Programs. JELIA 2008: 76-88 - [c42]Wolfgang Faber, Hans Tompits, Stefan Woltran:
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443 - [c41]Wolfgang Faber, Nicola Leone, Marco Maratea, Francesco Ricca:
Look-back Techniques for ASP Programs with Aggregates. RCRA 2008 - [p1]Wolfgang Faber, Nicola Leone, Francesco Ricca:
Answer Set Programming. Wiley Encyclopedia of Computer Science and Engineering 2008 - [i6]Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'Armi, Giuseppe Ielpa:
Design and Implementation of Aggregate Functions in the DLV System. CoRR abs/0802.3137 (2008) - 2007
- [j15]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) - [j14]