publicat

Wissensverarbeitung und Informationssysteme, Publikationen


Below is a list of our selected publications. You can also check our papers listed in DBLP by clicking the names of (former) group members:

Christian Anger      Philippe Besnard      Steve Dworschak      André Flöter      Martin Gebser      Mona Gharib      Roland Kaminski      Benjamin Kaufmann      Kathrin Konczak      Thomas Linke      Max Ostrowski      Torsten Schaub      Sven Thiele      Philippe Veber      Kewen Wang


2011

  1. Martin Gebser, Roland Kaminski and Torsten Schaub. Complex Optimization in Answer Set Programming. In Theory and Practice of Logic Programming, vol. 11, nr. 4-5, S. 821-839, 2011. [BibTeX] [PDF]

  2. Markus Durzinsky, Wolfgang Marwan, Max Ostrowski, Torsten Schaub and Annegret Wagler. Automatic Network Reconstruction using ASP. In Theory and Practice of Logic Programming, vol. 11, nr. 4-5, S. 749-766, 2011. [BibTeX] [PDF]

  3. Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Multi-Criteria Optimization in ASP and its Application to Linux Package Configuration. Unpublished draft, 2011. [BibTeX] [PDF]

  4. Grigoris Antoniou, Giorgos Flouris, Max Ostrowski and Torsten Schaub. Evolution of Ontologies using ASP. In J. Gallagher and M. Gelfond. Technical Communications of the Twenty-seventh International Conference on Logic Programming (ICLP'11), vol. 11, S. 16-27, Leibniz International Proceedings in Informatics (LIPIcs), 2011. [BibTeX]

  5. Grigoris Antoniou, Giorgos Flouris, Max Ostrowski and Torsten Schaub. Evolution of Ontologies using ASP. In FORTH-ICS, TR-415, 2011. [BibTeX] [PDF]

  6. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub and Bettina Schnor. Cluster-based ASP Solving with claspar. In J. Delgrande and W. Faber. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), LNAI 6645, S. 364-369, Springer Verlag, 2011. [BibTeX] [PDF]

  7. Martin Gebser, Roland Kaminski, Murat Knecht and Torsten Schaub. plasp: A Prototype for PDDL-Based Planning in ASP. In J. Delgrande and W. Faber. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), LNAI 6645, S. 358-363, Springer Verlag, 2011. [BibTeX] [PDF]

  8. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Schneider and Stefan Ziller. A Portfolio Solver for Answer Set Programming: Preliminary Report. In J. Delgrande and W. Faber. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), LNAI 6645, S. 352-357, Springer Verlag, 2011. [BibTeX] [PDF]

  9. Martin Gebser, Roland Kaminski, Arne König and Torsten Schaub. Advances in gringo Series 3. In J. Delgrande and W. Faber. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), LNAI 6645, S. 345-351, Springer Verlag, 2011. [BibTeX] [PDF]

  10. Martin Gebser, Torsten Grote, Roland Kaminski and Torsten Schaub. Reactive Answer Set Programming. In J. Delgrande and W. Faber. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), LNAI 6645, S. 54-66, Springer Verlag, 2011. [BibTeX] [PDF]

  11. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub and Marius Schneider. Potassco: The Potsdam Answer Set Solving Collection. In AI Communications, vol. 24, nr. 2, S. 105-124, 2011. [BibTeX] [PDF]

  12. Martin Gebser, Orkunt Sabuncu and Torsten Schaub. An Incremental Answer Set Programming Based System for Finite Model Computation. In AI Communications, vol. 24, nr. 2, S. 195-212, 2011. [BibTeX] [PDF]

  13. Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Challenges in Answer Set Solving. In M. Balduccini and T. Son. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays in Honor of Michael Gelfond, vol. 6565, S. 74-90, Springer Verlag, 2011. [BibTeX] [PDF]

  14. Maximilian Möller, Torsten Schaub, Marius Schneider and Martin Wegner. Centurio, a General Game Player: Parallel, Java- and ASP-based. In Künstliche Intelligenz, vol. 25, nr. 1, S. 17-24, 2011. [BibTeX] [PDF]

  15. Martin Gebser, Joohyung Lee and Yuliya Lierler. On Elementary Loops of Logic Programs. In Theory and Practice of Logic Programming, 2011. [BibTeX] [PDF]

  16. Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Challenges in Answer Set Solving. In M. Balduccini and T. Son. Proceedings of the Symposium on Constructive Mathematics in Computer Science (MG-65), LNCS, Springer-Verlag, 2011. [BibTeX]

  17. Martin Gebser, Torsten Schaub, Sven Thiele and Philippe Veber. Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. In Theory and Practice of Logic Programming, vol. 11, nr. 2, S. 1-38, 2011. [BibTeX] [PDF]

2010

  1. Sylvain Blachon, S. Jozefczuk, S. Klie, Joachim Selbig and Sven Thiele. Combinatorial analysis of transcription regulation of response to oxidative stresses in E. coli . In 9th European Conference on Computational Biology, 2010. [BibTeX] [PDF]

  2. Martin Gebser, Orkunt Sabuncu and Torsten Schaub. An Incremental Answer Set Programming Based System for Finite Model Computation. In T. Janhunen and I. Niemela. Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), LNCS 6341, S. 169-181, Springer-Verlag, 2010. [BibTeX] [PDF]

  3. Martin Gebser, Arne König, Torsten Schaub, Sven Thiele and Philippe Veber. The BioASP Library: ASP Solutions for Systems Biology . In E. Grégoire. Proceedings of the Twenty-second IEEE International Conference on Tools with Artificial Intelligence (ICTAI'10), S. 383-389, IEEE Computer Society, 2010. [BibTeX] [PDF]

  4. Martin Gebser, Torsten Grote and Torsten Schaub. Coala: A Compiler from Action Languages to ASP. In T. Janhunen and I. Niemela. Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), volume 6341, S. 360-364, Springer-Verlag, 2010. [BibTeX] [PDF]

  5. Torsten Schaub and Anne Siegel. Testing, Diagnosing, Repairing, and Predicting from Regulatory Networks and Datasets. In ERCIM News, Special Theme: Computational Biology, volume 82, S. 30-31, 2010. [BibTeX] [PDF]

  6. Roberto Bisiani, Davide Merico, Alessandra Mileo and Torsten Schaub. Knowledge-Based Multi-Criteria Optimization to Support Indoor Positioning. In M. Gavanelli and T. Mancini. Proceedings of Seventh International Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion (RCRA'10), CEUR Workshop Proceedings (CEUR-WS.org), 2010. [BibTeX] [PDF]

  7. Martin Gebser, Carito Guziolowski, Mihail Ivanchev, Torsten Schaub, Anne Siegel, Sven Thiele and Philippe Veber. Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming. In F. Lin and U. Sattler. Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10), S. 497-507, AAAI Press, 2010. [BibTeX] [PDF]

2009

  1. Christoph Bobda, Martin Gebser, H. Ishebabi, P. Mahr and Torsten Schaub. Answer Set vs Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems From Real-Time Parallel Programs. In Journal of Reconfigurable Computing, , 2009. [BibTeX] [PDF]

  2. Martin Gebser, H. Hinrichs, Torsten Schaub and Sven Thiele. xpanda: A (Simple) Preprocessor for Adding Multi-Valued Propositions to ASP. In U. Geske and A. Wolf. Proceedings of the Twenty-third Workshop on (Constraint)Logic Programming (WLP'09) , 2009. [BibTeX] [PDF]

  3. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Lars Schneidenbach and Bettina Schnor. Experiences Running a Parallel Answer Set Solver on Blue Gene. In M. Ropo, J. Westerholm and J. Dongarra. Proceedings of the Sixteenth European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (PVM/MPI'09), LNCS, volume 5759, S. 64-72, Springer Verlag, 2009. [BibTeX] [PDF]

  4. Torsten Schaub. Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode. In E. Erdem, F. Lin and T. Schaub. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), LNAI, volume 5753, S. 631-633, Springer Verlag, 2009. [BibTeX] [PDF]

  5. Christoph Bobda, Martin Gebser, H. Ishebabi, P. Mahr and Torsten Schaub. Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs. In E. Erdem, F. Lin and T. Schaub. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), LNAI, volume 5753, S. 598-603, Springer Verlag, 2009. [BibTeX] [PDF]

  6. Martin Gebser, Benjamin Kaufmann and Torsten Schaub. The Conflict-Driven Answer Set Solver clasp: Progress Report. In E. Erdem, F. Lin and T. Schaub. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), LNAI, volume 5753, S. 509-514, Springer Verlag, 2009. [BibTeX] [PDF]

  7. Martin Gebser, Roland Kaminski, Max Ostrowski, Torsten Schaub and Sven Thiele. On the Input Language of ASP Grounder Gringo. In E. Erdem, F. Lin and T. Schaub. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), LNAI, volume 5753, S. 502-508, Springer Verlag, 2009. [BibTeX] [PDF]

  8. Enrico Ellguth, Martin Gebser, Michael Gusowski, Roland Kaminski, Benjamin Kaufmann, Stefan Liske, Torsten Schaub, Lars Schneidenbach and Bettina Schnor. A Simple Distributed Conflict-Driven Answer Set Solver. In E. Erdem, F. Lin and T. Schaub. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), LNAI, volume 5753, S. 490-495, Springer Verlag, 2009. [BibTeX] [PDF]

  9. S. Bond, M. Denecker, Martin Gebser, Mirosław Truszczyński and J. Vennekens. The Second Answer Set Programming Competition. In E. Erdem, F. Lin and T. Schaub. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), LNAI, volume 5753, S. 637-654, Springer Verlag, 2009. [BibTeX] [PDF]

  10. T. Henin and Torsten Schaub. A Transport Reaction Language: Preliminary Report. In A. Herzig and B. Johnston. Proceedings of the Eighth Workshop on Nonmonotonic Reasoning, Action and Change, S. 41-46, University of Technology, Sydney, Australia, 2009. [BibTeX] [PDF]

  11. Martin Gebser, Max Ostrowski and Torsten Schaub. Constraint Answer Set Solving. In P. Hill and D. Warren. Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), LNCS, volume 5649, S. 235-249, Springer Verlag, 2009. [BibTeX] [PDF]

  12. Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers. In P. Hill and D. Warren. Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), LNCS, volume 5649, S. 250-264, Springer Verlag, 2009. [BibTeX] [PDF]

  13. Torsten Schaub and Sven Thiele. Metabolic Network Expansion with ASP. In P. Hill and D. Warren. Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), LNCS, volume 5649, S. 312-326, Springer Verlag, 2009. [BibTeX] [PDF]

  14. James Delgrande, Torsten Schaub, Hans Tompits and Stefan Woltran. Merging Logic Programs under Answer Set Semantics. In P. Hill and D. Warren. Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), LNCS, volume 5649, S. 160-174, Springer Verlag, 2009. [BibTeX] [PDF]

  15. Martin Gebser, Benjamin Kaufmann and Torsten Schaub. Solution Enumeration for Projected Boolean Search Problems. In J. Hooker and W. van Hoeve. Proceedings of the Sixth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), LNCS, volume 5547, S. 71-86, Springer Verlag, 2009. [BibTeX] [PDF]

  16. Martin Gebser, Mona Gharib, Robert Mercer and Torsten Schaub. Monotonic Answer Set Programming. Journal of Logic and Computation, volume 19, nr 4, S. 539-564, 2009. [BibTeX] [PDF]

2008

  1. Steve Dworschak, Torsten Grote, Arne König, Torsten Schaub and Philippe Veber. The System BioC for Reasoning about Biological Models in Action Language C. In Proceedings of the Twentieth International Conference on Tools with Artificial Intelligence (ICTAI 08), volume 1, S. 11-18, IEEE Computer Society Press, 2008. [BibTeX] [PDF]

  2. Torsten Schaub. Here's the beef: Answer Set Programming !. In A. Dovier and M. Garcia de la Banda and E. Pontelli. Proceedings of the Twenty-fourth International Conference on Logic Programming (ICLP'08), LNCS, volume 5366, Springer Verlag, 2008. [BibTeX] [PDF]

  3. Martin Gebser, Tomi Janhunen, Max Ostrowski, Torsten Schaub and Sven Thiele. A Versatile Intermediate Language for Answer Set Programming: Syntax Proposal. Unpublished draft, 2008. [BibTeX] [PDF]

  4. Martin Gebser, Torsten Schaub, Sven Thiele, Björn Usadel and Philippe Veber. Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. In M. Garcia de la Banda and E. Pontelli. Proceedings of the Twenty-fourth International Conference on Logic Programming (ICLP'08), LNCS, volume 5366, S. 130-144, Springer Verlag, 2008. [BibTeX] [PDF]

  5. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub and Sven Thiele. Engineering an Incremental ASP Solver. In M. Garcia de la Banda and E. Pontelli. Proceedings of the Twenty-fourth International Conference on Logic Programming (ICLP'08), LNCS, volume 5366, S. 190-205, Springer Verlag, 2008. [BibTeX] [PDF]

  6. Christian Drescher, Martin Gebser, Torsten Grote, Benjamin Kaufmann, Arne König, Max Ostrowski and Torsten Schaub. Conflict-Driven Disjunctive Answer Set Solving. In G. Brewka and J. Lang. Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR'08), S. 422-432, AAAI Press, 2008. [BibTeX] [PDF]

  7. James Delgrande, Torsten Schaub, Hans Tompits and Stefan Woltran. Belief Revision of Logic Programs under Answer Set Semantics. In G. Brewka and J. Lang. Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR'08), S. 411-421, AAAI Press, 2008. [BibTeX] [PDF]

  8. Martin Gebser, Tomi Janhunen, Max Ostrowski, Torsten Schaub and Sven Thiele. A Versatile Intermediate Language for Answer Set Programming. In M. Pagnucco and M. Thielscher. Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (NMR'08), School of Computer Science and Engineering, The University of New South Wales, Technical Report Series, Nr. UNSW-CSE-TR-0819, S. 150-159, 2008. [BibTeX] [PDF]

  9. Christian Drescher, Martin Gebser, Benjamin Kaufmann and Torsten Schaub. Heuristics in Conflict Resolution. In M. Pagnucco and M. Thielscher. Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (NMR'08), School of Computer Science and Engineering, The University of New South Wales, Technical Report Series, Nr. UNSW-CSE-TR-0819, S. 141-149, 2008. [BibTeX] [PDF]

  10. Steve Dworschak, Torsten Grote, Arne König, Torsten Schaub and Philippe Veber. Tools for Representing and Reasoning about Biological Models in Action Language C. In M. Pagnucco and M. Thielscher. Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (NMR'08), School of Computer Science and Engineering, The University of New South Wales, Technical Report Series, Nr. UNSW-CSE-TR-0819, S. 94-102, 2008. [BibTeX] [PDF]

  11. Martin Gebser, Benjamin Kaufmann, André Neumann and Torsten Schaub. Advanced Preprocessing for Answer Set Solving. In M. Ghallab and C. Spyropoulos and N. Fakotakis and N. Avouris. Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI'08), S. 15-19, IOS Press, 2008. [BibTeX] [PDF]

  12. Martin Gebser, Jörg Pührer, Torsten Schaub and Hans Tompits. A Meta-Programming Technique for Debugging Answer-Set Programs. In D. Fox and C. Gomes. Proceedings of the Twenty-third National Conference on Artificial Intelligence (AAAI'08), S. 448-453, AAAI Press, 2008. [BibTeX] [PDF]

  13. Martin Gebser, Torsten Schaub, Hans Tompits and Stefan Woltran. Alternative Characterizations for Program Equivalence under Answer-Set Semantics based on Unfounded Sets. In S. Hartmann and G. Kern-Isberner. Proceedings of the Fifth International Symposium on Foundations of Information and Knowledge Systems (FoIKS'08), LNCS, volume 4932, S. 24-41, Springer Verlag, 2008. [BibTeX] [PDF]

  14. Steve Dworschak, Susanne Grell, Victoria Nikiforova, Torsten Schaub and Joachim Selbig. Modelling biological networks by action languages via answer set programming. Constraints Journal, Vol. 13, Nr. 1-2, S. 21-65, 2008. [BibTeX] [PDF]

2007

  1. Mona Gharib, Robert Mercer and Torsten Schaub. Incremental Answer Set Programming: A Preliminary Report. In S. Costantini and R. Watson, Proceedings of the Fourth International Workshop on Answer Set Programming (ASP'07), S. 149-160, 2007. [BibTeX] [PDF]

  2. James Delgrande, Jérôme Lang and Torsten Schaub. Belief change based on global minimisation. In M. Veloso (Hrsg.), Proceedings of the Twentieth International Conference on Artificial Intelligence (IJCAI'07), S. 2468-2473, AAAI Press/The MIT Press, 2007. [BibTeX] [PDF]

  3. James Delgrande, Torsten Schaub and Hans Tompits. A General Framework for Expressing Preferences in Causal Reasoning an Planning. Journal of Logic and Computation, Vol. 17, S. 871-907, 2007. [BibTeX] [PDF]

  4. James Delgrande and Torsten Schaub. A Consistency-Based Framework for Merging Knowledge Bases. Journal of Applied Logics, Vol. 5, Nr. 3, S. 459-477, 2007. [BibTeX] [PDF]

  5. James Delgrande, Daphne Liu, Torsten Schaub and Sven Thiele. COBA 2.0: A Consistency-Based Belief Change System. K. Mellouli, Proceedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'07), S. 78-90, Springer Verlag, 2007. [BibTeX] [PDF]

  6. Alessandra Mileo and Torsten Schaub. Qualitative constraint enforcement in advanced policy specification. K. Mellouli, Proceedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'07), S. 695-706, Springer Verlag, 2007. [BibTeX] [PDF]

  7. Martin Gebser, Mona Gharib and Torsten Schaub. Incremental Answer Sets and Their Computation. S. Costantini and R. Watson, Proceedings of the Fourth International Workshop on Answer Set Programming (ASP'07), S. 161-174, 2007. [BibTeX] [PDF]

  8. Martin Gebser and Torsten Schaub. Generic Tableaux for Answer Set Programming. In V. Dahl and I. Niemelä, Proceedings of the Twenty-third International Conference on Logic Programming (ICLP'07), LNCS, volume 4670, S. 119-133, Springer Verlag, 2007. [BibTeX] [PDF]

  9. Martin Brain, Wolfgang Faber, Marco Maratea, Axel Polleres, Torsten Schaub and Roman Schindlauer. What should an ASP Solver output? A Multiple Position Paper. In M. de Vos, T. Schaub, Proceedings of the International Workshop on Software Engineering for Answer Set Programming (SEA'07), S. 26-37, 2007. [BibTeX] [PDF]

  10. Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits and Stefan Woltran. "That is Illogical Captain!" - The Debugging Support Tool spock for Answer-Set Programs: System Description. In M. De Vos and T. Schaub, Proceedings of the Workshop on Software Engineering for Answer Set Programming (SEA'07), S. 71-85, 2007. [BibTeX] [PDF]

  11. Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub and Mirosław Truszczyński. The First Answer Set Programming System Competition. In C. Baral, G. Brewka, J. Schlipf (Hrsg.), Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), S. 3-17, Springer Verlag, 2007. [BibTeX] [PDF]

  12. Martin Gebser, Torsten Schaub, Hans Tompits and Stefan Woltran. Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. In D. Pearce, A. Polleres, A. Valverde and S. Woltran, Proceedings of the Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT'07), S. 37-48, 2007. [BibTeX] [PDF]

  13. Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits and Stefan Woltran. Debugging ASP Programs by Means of ASP. In C. Baral and G. Brewka and J. Schlipf, Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), LNCS, volume 4483, S. 31-43, Springer Verlag, 2007. [BibTeX] [PDF]

  14. James Delgrande, Torsten Schaub and Hans Tompits. A Preference-Based Framework for Updating Logic Programs. In C. Baral and G. Brewka and J. Schlipf, Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), LNCS, volume 4483, S. 71-83, Springer Verlag, 2007. [BibTeX] [PDF]

  15. Martin Gebser, Benjamin Kaufmann, André Neumann and Torsten Schaub. clasp: A Conflict-Driven Answer Set Solver. In C. Baral, G. Brewka and J. Schlipf, Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), LNAI, volume 4483, S. 260-265, Springer Verlag, 2007. [BibTeX] [PDF]

  16. Martin Gebser, Benjamin Kaufmann, André Neumann and Torsten Schaub. Conflict-Driven Answer Set Enumeration. In C. Baral and G. Brewka and J. Schlipf, Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), LNCS, volume 4483, S. 136-148, Springer Verlag, 2007. [BibTeX] [PDF]

  17. Martin Gebser, Benjamin Kaufmann, André Neumann and Torsten Schaub. Conflict-Driven Answer Set Solving. In M. Veloso, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), S. 386-392, AAAI Press/The MIT Press, 2007. [BibTeX] [PDF]

  18. Martin Gebser, Joohyung Lee and Yuliya Lierler. Head-Elementary-Set-Free Logic Programs. In C. Baral, G. Brewka and J. Schlipf, Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), LNAI, volume 4483, S. 149-161, Springer Verlag, 2007. [BibTeX] [PDF]

  19. Martin Gebser, Torsten Schaub and Sven Thiele. GrinGo: A New Grounder for Answer Set Programming. In C. Baral, G. Brewka and J. Schlipf, Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), LNAI, volume 4483, S. 266-271, Springer Verlag, 2007. [BibTeX] [PDF]

2006

  1. G. Braban, André Flöter, M. Möhlig, A. F. H. Pfeiffer, T. Schill, H. W. Schlösser, C. Schöfl, Joachim Selbig and J. Spranger. A screening procedure for daily use to detect abnomal glucose metabolism in women with polycystic ovary. Diabetoligia 49, S. 2572-2579, 2006.

  2. Christian Anger, Martin Gebser, Tomi Janhunen and Torsten Schaub. What's a head without a body?. In G. Brewka, S. Coradeschi, A. Perini, P. Traverso (Hrsg.), Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'06), S. 769-770. IOS Press, 2006. [BibTeX] [PDF]

  3. Christian Anger, Martin Gebser and Torsten Schaub. Approaching the Core of Unfounded Sets. In J. Dix and A. Hunter, Proceedings of the International Workshop on Nonmonotonic Reasoning (NMR'06), IFI-06-04, Technical Report Series, S. 58-66, 2006. [BibTeX] [PDF]

  4. James Delgrande, Daphne Liu, Torsten Schaub and Sven Thiele. COBA 2.0: A Consistency-Based Belief Change System. In J. Dix and A. Hunter, Proceedings of the International Workshop on Nonmonotonic Reasoning (NMR'06), IFI-06-04, Technical Report Series, S. 267-273, 2006. [BibTeX]

  5. James Delgrande, Torsten Schaub and Hans Tompits. A Preference-Based Framework for Updating Logic Programs: Preliminary Report. In E. Pontelli and T. Son, Proceedings of the International Workshop on Preferences in Logic Programming Systems (PREFS'06), S. 31-44, 2006. [BibTeX]

  6. James Delgrande, Torsten Schaub and Hans Tompits. An Extended Query Language for Action Languages (and its Application to Aggregates and Preferences). In J. Dix and A. Hunter, Proceedings of the International Workshop on Nonmonotonic Reasoning (NMR'06), IFI-06-04, Technical Report Series, S. 362-370, 2006. [BibTeX] [PDF]

  7. Martin Gebser, Joohyung Lee and Yuliya Lierler. Elementary Sets for Logic Programs. In Proceedings of the National Conference on Artificial Intelligence (AAAI'06), AAAI Press/The MIT Press, 2006. [BibTeX] [PDF]

  8. Martin Gebser and Torsten Schaub. Characterizing ASP Inferences by Unit Propagation. In E. Giunchiglia, V. Marek, D. Mitchell and E. Ternovska, Proceedings of the International Workshop on Search and Logic: Answer Set Programming and SAT, S. 41-56 , 2006. [BibTeX] [PDF]

  9. Martin Gebser and Torsten Schaub. Tableau Calculi for Answer Set Programming. In S. Etalle, M. Truszczynski. Proceedings of the International Conference on Logic Programming (ICLP'06), LNCS, volume 4079, S. 11-25, Springer Verlag, 2006. [BibTeX] [PDF]

  10. Susanne Grell, Torsten Schaub and Joachim Selbig. Modelling biological networks by action languages via answer set programming. In S. Etalle, M. Truszczynski (Hrsg.), Proceedings of the Twenty Second International Conference on Logic Programming (ICLP'06), LNCS, volume 4079, S. 285-299. Springer Verlag, 2006. [BibTeX] [PDF]

  11. Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele and Richard Tichy. On Probing and Multi-Threading in Platypus. In G. Brewka, S. Coradeschi, A. Perini, P. Traverso (Hrsg.), Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'06), S. 392-396, IOS Press, 2006. [BibTeX] [PDF]

  12. Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele and Richard Tichy. On Probing and Multi-Threading in Platypus. In J. Dix, A. Hunter (Hrsg.), Proceedings of the Eleventh International Workshop on Non-Monotonic Reasoning (NMR'06), S. 30-38. Forschungsbericht, Institut for Informatics, Clausthal University of Technology, IFI-06-04, 2006. [BibTeX] [PDF]

  13. Kathrin Konczak. Voting Theory in Answer Set Programming. In M. Fink, H. Tompits and S. Woltran, Proceedings of the Twentieth Workshop on Logic Programmin (WLP'06), INFSYS RR-1843-06-02, Technical Report Series, S. 45-53, 2006. [BibTeX] [PDF]

  14. Kathrin Konczak. Weak Order Equivalences for Logic Programs with Preferences. In M. Fink, H. Tompits and S. Woltran, Proceedings of the Twentieth Workshop on Logic Programmin (WLP'06), INFSYS RR-1843-06-02, Technical Report Series, S. 154-163, 2006. [BibTeX] [PDF]

  15. Kathrin Konczak, Thomas Linke and Torsten Schaub. Graphs and colorings for answer set programming. Theory and Practice of Logic Programming, volume 6, number 1&2, pages 61-106, 2006. [BibTeX] [PDF]

  16. Alessandra Mileo and Torsten Schaub. Extending Ordered Disjunctions for Policy Enforcement: Preliminary report. In E. Pontelli and T. Son, Proceedings of the International Workshop on Preferences in Logic Programming Systems (PREFS'06), S. 45-59, 2006. [BibTeX]

2005

  1. James Delgrande, Torsten Schaub. Expressing Default Logic Variants in Default Logic. Journal of Logic and Computation, 15(5), pages 593-621, 2005. [BibTeX] [PDF]

  2. Christian Anger, Martin Gebser, Thomas Linke, Andre Neumann, Torsten Schaub. The nomore++ approach to answer set solving. In G. Sutcliffe and A. Voronkov, editors, Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05), pages 95-109, Springer Verlag, 2005. [BibTeX] [PDF]

  3. Kathrin Konczak, Jerome Lang. Voting procedures with incomplete preferences. IJCAI-05 Workshop on Advances in Preference Handling, pages 124-129, 2005. [BibTeX] [PDF]

  4. Kathrin Konczak, Ralf Vogel. Abduction and Preferences in Linguistics. Answer Set Programming: Advances in Theory and Implementation (ASP'05), pages 263-276, Research Press International, 2005. [BibTeX] [PDF]

  5. Kathrin Konczak, Ralf Vogel. Abduction and Preferences in Linguistics: Extended Abstract. Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005) , pages 384-388, Lecture Notes in Artificial Intelligence, volume 3662, Springer, 2005. [BibTeX] [PDF]

  6. Susanne Grell, Kathrin Konczak, Torsten Schaub. nomore< : A System for Computing Preferred Answer Sets. In C. Baral, G. Greco, N. Leone and G. Terracina, editors, Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), pages 394-398, Lecture Notes in Artificial Intelligence, volume 3662, Springer Verlag, 2005. [BibTeX] [PDF]

  7. Wolfgang Faber, Kathrin Konczak. Strong Equivalence for Logic Programs with Preferences. Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pages 430-435, 2005. [BibTeX] [PDF]

  8. Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, Richard Tichy. Platypus: A platform for distributed answer set solving. In C. Baral, G. Greco, N. Leone and G. Terracina, editors, Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), pages 227-239, Lecture Notes in Artificial Intelligence, volume 3662, Springer Verlag, 2005. [BiBTeX] [PDF]

  9. Martin Gebser, Torsten Schaub. Loops: Relevant or Redundant?. In C. Baral, G. Greco, N. Leone and G. Terracina, editors, Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), pages 53-65, Lecture Notes in Artificial Intelligence, volume 3662, Springer Verlag, 2005. [BiBTeX] [PDF]

  10. Christian Anger, Martin Gebser, Thomas Linke, Andre Neumann, Torsten Schaub. The nomore++ System. In C. Baral, G. Greco, N. Leone and G. Terracina, editors, Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), pages 422-426, Lecture Notes in Artificial Intelligence, volume 3662, Springer Verlag, 2005. [BiBTeX] [PDF]

  11. Christian Anger, Kathrin Konczak, Thomas Linke, Torsten Schaub. A Glimpse of Answer Set Programming. Künstliche Intelligenz, 1/05, pages 12-17, 2005 [BiBTeX] [PDF]

  12. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran. Representing Paraconsistent Reasoning via Quantified Propositional Logic. In L. Bertossi, A. Hunter, and T. Schaub, editors, Inconsistency Tolerance, pages 84-118, Springer Verlag, 2005. [BiBTeX] [PDF]

  13. Leopoldo Bertossi, Anthony Hunter, Torsten Schaub. Introduction to Inconsistency Tolerance. In L. Bertossi, A. Hunter, and T. Schaub, editors, Inconsistency Tolerance, pages 1-14, Springer Verlag, 2005. [BiBTeX]

2004

  1. Thomas Linke, Hans Tompits, Stefan Woltran. On Acyclic and Head-Cycle Free Nested Logic Programs. In B. Demoen and V. Lifschitz, editors, 20th International Conference on Logic Programming (ICLP04), Lecture notes in Computer Science, volume 3132, pages 225-239, 2004 [BiBTeX] [PDF]

  2. James Delgrande, Torsten Schaub. Reasoning with Sets of Defaults in Default Logic. Computational Intelligence, 20(1):56-88, 2004 [BiBTeX] [PDF]

  3. James Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang. A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence, 20(2):308-334, 2004 [BiBTeX] [PDF]

  4. James Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. On Computing Solutions to Belief Change Scenarios under Quantified Boolean Formulas. Journal of Logic and Computation, 14(6):801-826, 2004 [BiBTeX] [PDF]

  5. James Delgrande, Torsten Schaub, Hans Tompits. Domain-Specific Preferences for Causal Reasoning and Planning. In D. Dubois, Chr. A. Welty, M.-A. Williams, editors, Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR'04), Whistler, Canada, pages 673-682, AAAI Press/The MIT Press, 2004 [BiBTeX] [PDF]

  6. James Delgrande, Torsten Schaub. Two Approaches to Merging Knowledge Bases. In J. Alferes and J. Leite,editors, Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA'04), 2004 [BiBTeX] [PDF]

  7. James Delgrande, Torsten Schaub. Consistency-Based Approaches to Merging Knowledge Bases. In J. Delgrande and T. Schaub, editors, Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning NMR'04, Whistler, Canada, pages 126-133, 2004 [BiBTeX] [PDF]

  8. Thomas Linke, Hans Tompits, Stefan Woltran. On Acyclic and Head-Cycle Free Nested Logic Programs. In J. Delgrande and T. Schaub, editors, Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning NMR'04, Whistler, Canada, pages 267-275, 2004 [BiBTeX] [PDF]

  9. Andreas Bösel, Thomas Linke, Torsten Schaub. Profiling Answer Set Programming: The Visualization Component of the noMoRe System.. In J. Alferes and J. Leite,editors, Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA'04), 2004 [BiBTeX] [PDF]

  10. André Flöter, Jacques Nicolas,  Torsten Schaub and Joachim Selbig. Threshold extraction in metabolite concentration data. Bioinformatics, volume 20, number 10, pages 1491-1494, 2004 [BiBTeX] [PDF]

  11. André Flöter, Torsten Schaub, Joachim Selbig. Finding Metabolic Pathways in Decision Forests. Proceedings of the 27th Annual Conference of the GfKl, German Society of Classification, 2004 [BiBTeX] [PDF]

  12. Paul Borchert, Christian Anger, Torsten Schaub and M. Truszczynski. Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. In V. Lifschitz and I. Niemelä, editors, Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), volume 2923, pages 3-7, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2004 [BiBTeX] [PDF]

  13. Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran. nlp: A compiler for nested logic programming. In V. Lifschitz and I. Niemelä, editors, Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), volume 2923, pages 361 - 364, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2004 [BiBTeX] [PDF]

  14. Kathrin Konczak, Thomas Linke, Torsten Schaub. Graphs and colorings for answer set programming: Abridged report. In V. Lifschitz and I. Niemelä, editors, Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), volume 2923, pages 127 - 140, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 2004 [BiBTeX] [PDF]

2003

  1. Kathrin Konczak, Torsten Schaub, Thomas Linke. Graphs and colorings for answer set programming with preferences. Fundamenta Informaticae, volume 57, number 2-4, pages 393-421, 2003 [BiBTeX] [PDF]

  2. James Delgrande, Mona Gharib, Robert Mercer, Vincent Risch, Torsten Schaub. Lukaszewicz-style Answer Set Programming: A Preliminary Report. In M. De Vos and A. Provetti, editors, Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), volume 78, CEUR Workshop Proceedings, 2003 [BiBTeX] [PDF]

  3. Kathrin Konczak, Thomas Linke, Torsten Schaub. Graphs and colorings for answer set programming: Abridged report. In M. De Voss and A. Provetti , editors, Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), CEUR Workshop Proceedings, volume 78, pages 137-150, 2003 [BiBTeX] [PDF]

  4. Kathrin Konczak, Torsten Schaub, Thomas Linke. Graphs and colorings for answer set programming with preferences: Preliminary Report. In M. De Voss and A. Provetti , editors, Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), CEUR Workshop Proceedings, volume 78, pages 43-56, 2003 [BiBTeX] [PDF]

  5. Thomas Linke. Using Nested Logic Programs for Answer Set Programming. In M. De Voss and A. Provetti , editors, Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), CEUR Workshop Proceedings, volume 78, pages 181-194, 2003 [BiBTeX] [PDF]

  6. Thomas Linke. Suitable Graphs for Answer Set Programming. In M. De Voss and A. Provetti , editors, Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), CEUR Workshop Proceedings, volume 78, pages 15-28, 2003 [BiBTeX] [PDF]

  7. Philippe Besnard, Robert Mercer, Torsten Schaub. Optimality Theory through Default Logic. KI'03: Advances in Artificial Intelligence, Proceedings of the Twenty-sixth Annual German Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2821, pages 93-104, 2003 [BiBTeX]

  8. André Flöter, Jacques Nicolas, Torsten Schaub, Joachim Selbig. Threshold extraction in metabolite concentration data. Proceedings of the German Conference on Bioinformatics, pages 33-39, October, 2003 [BiBTeX] [PDF]

  9. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran. Paraconsistent Reasoning via Quantified Boolean Formulas, Part II: Circumscribing Inconsistent Theories. Proceedings of the Seventh European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2711, pages 528-539, 2003 [BiBTeX] [PDF]

  10. James Delgrande, Torsten Schaub. On the Relation between Reiter's Default Logic and its (major) Variants. Proceedings of the Seventh European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2711, pages 452-463, 2003 [BiBTeX] [PDF]

  11. Torsten Schaub. Antwortmengenprogrammierung. LOG IN: Informatische Bildung und Computer in der Schule, volume 122/123, pages 104-106, 2003 [BiBTeX] [PDF]

  12. James Delgrande, Torsten Schaub, Hans Tompits. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming, volume 3, number 2, pages 129-187, 2003 [BiBTeX] [PDF]

  13. Philippe Besnard, Gisbert Fanselow, Torsten Schaub. Optimality theory as a family of cumulative logics. Journal of Logic, Language and Information, volume 12, number 2, pages 153-182, 2003 [BiBTeX] [PDF]

  14. Torsten Schaub, Kewen Wang. A semantic framework for preference handling in answer set programming. Theory and Practice of Logic Programming, volume 3, number 4-5, pages 569-607, 2003 [BiBTeX] [PDF]

  15. James Delgrande, Torsten Schaub. A Consistency-Based Paradigm for Belief Change. Artificial Intelligence, volume 151, number 1-2, pages 1-41, 2003 [BiBTeX] [PDF]

2002

  1. Christian Anger, Kathrin Konczak, Thomas Linke. NoMoRe: Non-monotonic reasoning with logic programs. In S. Flesca and S. Greco and N. Leone and G.Ianni, editors, Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2424, pages 521-524, 2002 [BiBTeX] [PDF]

  2. Philippe Besnard, Robert Mercer, Torsten Schaub. Optimality theory via default logic. In S. Benferhat, E. Giunchiglia, editors, Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning (NMR'02), pages 77-83, 2002 [BiBTeX] [PDF]

  3. Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran. Paraconsistent reasoning via quantified boolean formulas. In S. Flesca and S. Greco and N. Leone and G.Ianni, editors, Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2424, pages 320-331, 2002 [BiBTeX] [PDF]

  4. James Delgrande, A. Hunter, Torsten Schaub. Coba: A consistency-based belief revision system. In S. Flesca and S. Greco and N. Leone and G.Ianni, editors, Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2424, pages 509-512, 2002 [BiBTeX]

  5. James Delgrande, Torsten Schaub. Reasoning credulously and skeptically within a single extension. Journal of Applied Non-Classical Logics, volume 12, number 2, pages 259-285, 2002. [BiBTeX] [PDF]

  6. James Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang. Towards a classification of preference handling approaches in nonmonotonic reasoning. In U. Junker, editor, Proceedings of the Workshop on Preferences in Artificial Intelligence and Constraint Programming: Symbolic Approaches, pages 16-24, 2002 [BiBTeX] [PDF]

  7. Thomas Linke, Christian Anger, Kathrin Konczak. More on nomore. In S. Flesca and S. Greco and N. Leone and G.Ianni, editors, Proceedings of the Eighth European Conference on Logics in Artificial Intelligence (JELIA'02), Lecture Notes in Artificial Intelligence, Springer-Verlag, volume 2424, pages 468-480, 2002 [BiBTeX] [PDF]

  8. Thomas Linke, Christian Anger, Kathrin Konczak. More on nomore. In S. Benferhat and E. Giunchiglia, editors, Proceedings of the 9th International Workshop on Nonmonotonic Reasoning, pages 210-218, Toulouse,2002 [BiBTeX] [PDF]

  9. D. Pearce, V. Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran. A polynomial translation of logic programs with nested expressions into disjunctive logic programs. In P. Stuckey, editor, Proceedings of the International Conference on Logic Programming, Lecture Notes in Computer Science 2401, pages 405-420, Springer-Verlag, 2002 [BiBTeX] [PDF]

  10. Torsten Schaub, Kewen Wang. Preferred well-founded semantics for logic programming by alternating fixpoints. In S. Benferhat, E. Giunchiglia, editors, Proceedings of the Ninth International Workshop on Non-Monotonic Reasoning (NMR'02), pages 238-246, 2002 [BiBTeX] [PDF]

2001

  1. Christian Anger, Kathrin Konczak, Thomas Linke. NoMoRe : A system for non-monotonic reasoning with logic programs under answer set semantics. In T. Eiter, W. Faber, and M. Truszczynski, editors, Proceedings of the Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), pages 406-410, Springer Verlag, 2001 [BiBTeX]

  2. Christian Anger, Kathrin Konczak, Thomas Linke. NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics. In R. Goré, A. Leitsch and T. Nipkow, editors, Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR'01), Lecture Notes in Artificial Intelligence 2083, pages 325-330, Springer Verlag, 2001 [BiBTeX]

  3. S. Benferhat and Philippe Besnard. Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Springer-Verlag, 2001 [BiBTeX]

  4. Philippe Besnard, Anthony Hunter. A logic-based theory of deductive arguments. Artificial Intelligence, 128(1-2): 203-235, 2001 [BiBTeX]

  5. James Delgrande, Torsten Schaub. How to reason credulously and skeptically within a single extension. In S. Benferhat and P. Besnard, editors, Proceedings of the Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'01), pages 592-603, Springer Verlag, 2001 [BiBTeX] [PDF]

  6. James Delgrande, Torsten Schauband Hans Tompits. plp: A generic compiler for ordered logic programs. In T. Eiter and W. Faber and M. Truszczynski, editors, Proceedings of the Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), Lecture Notes in Artificial Intelligence 2173, pages 411-415, Springer Verlag, 2001 [BiBTeX] [PDF]

  7. James Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. On computing solutions to belief change scenarios. In S. Benferhat and P. Besnard, editor, Proceedings of the Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'01), pages 510-521, Springer, 2001 [BiBTeX]

  8. Thomas Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), pages 641-645, 2001 [BiBTeX] [PDF]

  9. U. Roessner, A. Luedemann, D. Brust, O. Fiehn, Thomas Linke, L. Willmitzer, A.R. Fernie. Metabolic profiling allows comprehensive phenotyping of genetically or environmentally modified plant systems. Plant Cell, 13: 11-29, 2001 [BiBTeX]

  10. Torsten Schaub, Kewen Wang. A comparative study of logic programming with preference. In B. Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), pages 597-604, Morgan Kaufmann, 2001 [BiBTeX] [PDF]

  11. Kewen Wang. A top-down procedure for disjunctive well-founded semantics. In R. Goré, A. Leitsch and T. Nipkow, editors, Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR'01), Lecture Notes in Artificial Intelligence 2083, pages 305-317, Springer Verlag, 2001 [BiBTeX] [PDF]

  12. Kewen Wang. A comparative study of disjunctive well-founded semantics. In Eiter, W. Faber, and M. Truszczynski, editors, Proceedings of the Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), Lecture Notes in Artificial Intelligence 2173, pages 133-146, Springer Verlag, 2001 [BiBTeX] [PDF]

  13. Kewen Wang, Lizhu Zhou. An extension to GCWA and query evaluation for disjunctive deductive databases. Journal of Intelligent Information Systems, 16(3): 229-253, 2001 [BiBTeX] [PDF]

  14. Kewen Wang, Lizhu Zhou, and Fangzhen Lin. Alternating fixpoint theory for logic programs with priority. In J. Lloyd et al, editors, Proceedings of the First International Conference on Computational Logic, Lecture Notes in Computer Science 1861, pages 164-178. Springer-Verlag, 2001 [BiBTeX]

  15. F. Kose, W. Weckwerth, Thomas Linkeand O. Fiehn. Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics, volume 17, number 1-3, pages 1190-1208, 2001 [BiBTeX]

2000

  1. T. Altmann, B. Essigmann, A. Flöter, S. Kloska, Torsten Schaub, Peter Uwe Zettier. Ein Verteiltes Informationssystem zur Verwaltung und Analyse von grossen mRNA-Expressionsdatenmengen. In Proceedings of the Workshop on Informationsystems in Biotechnology, pages 13-16, Forschungsbericht Otto-von-Guericke-Universität Magdeburg, 2000 [BiBTeX]

  2. Philippe Besnard, Anthony Hunter. Towards a logic-based theory of argumentation. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI00), pages 411-416, AAAI Press/The MIT Press, 2000 [BiBTeX]

  3. Philippe Besnard, Jerome Lang. Graded paraconsistency. In Frontiers in Paraconsistent Logic, pages 75-94, Research Studies Press, Baldock, Hertfordshire, England, 2000 [BiBTeX]

  4. Philippe Besnard, Torsten Schaub. Significant inferences. In Proceedings of the Seventh International Conference on Knowledge Representation (KR'2000), 401-410, Morgan Kaufmann Publishers, 2000, 2000 [BiBTeX] [PDF]

  5. Philippe Besnard, Torsten Schaub. What is a (non-constructive) non-monotone logical system?. Theoretical Computer Science, 238(1-2): 489-494, 2000 [BiBTeX]

  6. James Delgrande, Torsten Schaub. A consistency-based model for belief change: Preliminary report. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence (AAAI/IAAI00), pages 392-398, AAAI Press / The MIT Press, 2000 [BiBTeX]

  7. James Delgrande, Torsten Schaub. Expressing preferences in default logic. Artificial Intelligence, 123(1-2): 41-87, 2000 [BiBTeX] [PDF]

  8. James Delgrande, Torsten Schaub. The Role of Default Logic in Knowledge Representation. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 107-126, Kluwer Press, 2000 [BiBTeX] [PDF]

  9. James Delgrande, Torsten Schaub, Hans Tompits. A compilation of Brewka and Eiter's approach to prioritization. In M. Ojeda-Aciego, I. Guzmán, G. Brewka and L. Pereira, editors, Proceedings of the European Conference on Logics in Artificial Intelligence (JELIA'00), pages 376-390, Springer Verlag, 2000 [BiBTeX] [PDF]

  10. James Delgrande, Torsten Schaub, Hans Tompits. A compiler for ordered logic programs. In C. Baral and M. Truszczynski, editor, Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning (NMR'00) , arXiv.org e-Print archive, 2000 [BiBTeX]

  11. James Delgrande, Torsten Schaub, Hans Tompits. Logic programs with compiled preferences. In W. Horn, editor, Proceedings of the European Conference on Artificial Intelligence (ECAI'01), pages 464-468, IOS Press, 2000 [BiBTeX] [PDF]

  12. Thomas Linke. New Foundations for Automation of Default Reasoning. DISKI 237, 2000 [BiBTeX]

  13. Thomas Linke, Torsten Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124(1): 31-86, 2000 [BiBTeX] [PDF]

  14. Kewen Wang. Argumentation-based abduction in disjunctive logic programming. Journal of Logic Programming, 45(1-3): 105-141, 2000 [BiBTeX]
  15. P. Wang and Philippe Besnard. Paraconsistent reasoning as an analytical tool. In Proceedings of the Fourth Conference on Formal and Applied Practical Reasoning, London, 2001 [BiBTeX]

1999

  1. Farid Benhammadi, Pascal Nicolas, Torsten Schaub. Query-answering in prioritized default logic. In A. Hunter and S. Parsons, editors, Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ESCQARU'99), pages 32-42, Springer Verlag, 1999 [BiBTeX]

  2. Stefan Brüning, Torsten Schaub. Avoiding non-ground variables. In A. Hunter and S. Parsons, editors, Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ESCQARU'99), pages 92-103, Springer Verlag, 1999 [BiBTeX]

  3. Thomas Linke, Torsten Schaub. On bottom-up pre-processing techniques for automated default reasoning. In A. Hunter and S. Parsons, editors, Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ESCQARU'99), pages 268-278, Springer Verlag, 1999 [BiBTeX]

  4. Thomas Linke, Torsten Schaub. Default reasoning via blocking sets. In M. Gelfond, N. Leone and G. Pfeifer, editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), pages 247-261, Springer Verlag, 1999 [BiBTeX]

  5. Torsten Schaub. The Automation of Reasoning with Incomplete Information: From Semantic Foundations to Efficient Computation. Lecture Notes in Artificial Intelligence 1409, Springer Verlag, 1999 [BiBTeX]

1998

  1. Farid Benhammadi, Pascal Nicolas, Torsten Schaub. Extension calculus and query answering in prioritized default logic. In Proceedings of the Eighth International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA'98), pages 76-87, Springer Verlag, 1998 [BiBTeX]

  2. Philippe Besnard, Torsten Schaub. Signed systems for paraconsistent reasoning. Journal of Automated Reasoning, 20(1): 191-213, 1998 [BiBTeX]

  3. Philippe Besnard, Torsten Schaub. Characterization of non-monotone non-constructive systems. In E. Boros, R. Greiner, editors, Electronic Proceedings of the Fifth International Symposium on Artificial Intelligence and Mathematics (AMAI'98), 1998 [BiBTeX]

  4. WolfgangBibel, Stefen Brüning, Jens Otten, Thomas Rath, Torsten Schaub. Compression and extensions. Chapter 5 in W. Bibel, P. H. Schmitt. editors, Automated Deduction--A Basis for Applications, Volume 1, pages 133-179, Kluwer Academic Publishers, 1998 [BiBTeX]

  5. James Delgrande, Torsten Schaub. Reasoning with sets of preferences in default logic. In H.-Y. Lee and H. Motoda, editors, Proceedings of the Fifth Pacific Rim International Conference on Artificial Intelligence (PRICAI'98), pages 134-145, Springer Verlag, 1998 [BiBTeX]

  6. Thomas Linke, Torsten Schaub. An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem. In J. Dix, L. Fariñas del Cerro and U. Furbach, editors, Logics in Artificial Intelligence, Proceedings of the Sixth European Conference on Logics in Artificial Intelligence, Lecture Notes in Computer Science 1489, pages 233-247, Springer Verlag, 1998 [BiBTeX]

  7. Pascal Nicolas, Torsten Schaub. The XRay system: An implementation platform for local query-answering in default logics. In A. Hunter and S. Parsons, editors, Applications of Uncertainty Formalisms in Information Systems, Lecture Notes in Computer Science 1455, pages 354-378, Springer Verlag, 1998 [BiBTeX]

  8. Pascal Nicolas, Torsten Schaub. Un cadre général pour l'interrogation automatique en logiques des défauts. Reconnaissance des formes et intelligence artificielle Clermont-Ferrand, France, Pages 381-390, Afcet Afia, 1998 [BiBTeX]

  9. Torsten Schaub. The family of default logics. Chapter 4 in D. Gabbay, P. Smets, editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 2, pages 77-133, Kluwer Academic Publishers, 1998 [BiBTeX]

  10. Volkmann, Thomas Linke, T. Waschulzik, R. Ohmes, Torsten Schaub, M. Wischnewsky. HExProSA -- Ein hybrides Expertensystem zur Prozeßkontrolle und Störfallanalyse von Abwasserbehandlungsanlagen: Erfahrungen bei der Evaluierung eines Prototypen. In A. Fick, H. Keller, editors, Proceedings of the Workshop Intelligente/Wissensbasierte Systeme in der Umwelttechnik, Bericht, Forschungszentrum Karlsruhle, 1998 [BiBTeX]

1997

  1. Philippe Besnard, Torsten Schaub. Circumscribing inconsistency. In M. E. Pollack, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'97), pages 150-155, Morgan Kaufmann Publishers, 1997 [BiBTeX]

  2. James Delgrande, Torsten Schaub. Compiling reasoning with and about preferences into default logic. In M. E. Pollack, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'97), pages 168-175, Morgan Kaufmann Publishers, 1997 [BiBTeX]

  3. James Delgrande, Torsten Schaub. Compiling specificity into approaches to nonmonotonic reasoning. Artificial Intelligence, 90(1-2): 301-348, 1997 [BiBTeX]

  4. Thomas Linke, Torsten Schaub. Towards a classification of default logic. Journal of Applied Non-Classical Logics, 7(4): 397-451, 1997 [BiBTeX]

  5. Torsten Schaub, Pascal Nicolas. An implementation platform for query-answering in default logics: Theoretical underpinnings. In Z. Ras, A. Skowron, editors, Proceedings of the Tenth International Symposium on Methodologies for Intelligent Systems (ISMIS'97), pages 197-206, Springer Verlag, 1997 [BiBTeX]

  6. Torsten Schaub, Pascal Nicolas. An implementation platform for query-answering in default logics: X-RAY system, its implementation and evaluation. In J. Dix, U. Furbach, A. Nerode, editors, Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Computer Science 1265, pages 442-453, Springer Verlag, 1997 [BiBTeX]

Selected Publications Before 1997

  1. Philippe Besnard, Torsten Schaub. A simple signed system for paraconsistent reasoning. In J. Alferes, L. Pereira, E. Orlowska, editors, Logics in Artificial Intelligence, Proceedings of the Fifth European Conference on Logics in Artificial Intelligence (JELIA'96), Lecture Notes in Computer Science 1126, pages 404-416, Springer, 1996 [BiBTeX]

  2. Stefan Brüning, Torsten Schaub. A model-based approach to consistency-checking. In Z. Ras, M. Michalewicz, editors, Proceedings of the Ninth International Symposium on Foundations of Intelligent Systems (ISMIS'96), Lecture Notes in Computer Science 1079, pages 315-324, Springer Verlag, 1996 [BiBTeX]

  3. Philippe Lamarre, Laurent Siklóssy, Torsten Schaub. Actes des Troisiémes Rencontres Nationales de Jeunes Chercheurs en Intelligence Artificielle. AFIA, 1996

  4. Thomas Linke, Torsten Schaub. Putting default logics in perspective. In G. Görz, S. Hölldobler, editors, Advances in Artificial Intelligence, Proceedings of the Twentieth Annual German Conference on Artificial Intelligence (KI'96), Lecture Notes in Computer Science 1137, pages 285-292, Springer Verlag, 1996 [BiBTeX]

  5. Thomas Linke, Torsten Schaub. Lemma handling in default logic theorem provers. In C. Froidevaux, J. Kohlas, editors, Proceedings of the European Conference Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU'95), Lecture Notes in Computer Science 946, pages 285-292, Springer Verlag, 1995 [BiBTeX]

  6. Torsten Schaub, Stefan Brüning. Prolog technology for default reasoning (An abridged report). In Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI'96), pages 105-109, John Wiley and Sons, 1996 [BiBTeX]

  7. Torsten Schaub, Stefan Brüning, Pascal Nicolas. XRay: A Prolog technology theorem prover for default reasoning: A system description. In M. McRobbie, J. Slaney, editors, Proceedings of Thirteenth International Conference on Automated Deduction (CADE'96), Lecture Notes in Computer Science 1104, pages 293-297, Springer Verlag, 1996 [BiBTeX]

  8. Torsten Schaub, Michael Thielscher. Skeptical query-answering in constrained default logic. In D. Gabbay, H. Ohlbach, editors, Proceedings of the International Conference on Formal and Applied Practical Reasoning (FAPR'96), Lecture Notes in Computer Science 1085, pages 567-581, Springer Verlag, 1996 [BiBTeX]

  9. Philippe Besnard, Torsten Schaub. An approach to context-based default reasoning. Fundamenta Informaticae, 23(2/3/4): 175-223, 1995 [BiBTeX]

  10. Gerhard Brewka, Torsten Schaub. Zur Verwendung Nichtmonotoner Inferenztechniken bei der Konfiguration. Chapter 3 in F. di Primio, editor, Methoden der Künstlichen Intelligenz für Gradfikanwendungen, pages 45-60, Addison-Wesley, 1995 [BiBTeX]

  11. Michael Thielscher, Torsten Schaub. Default reasoning by deductive planning. Journal of Automated Reasoning, 15(1): 1-40, 1995 [BiBTeX]

  12. Ulrich Furbach, Hans-Jürgen Bürckert, Joachim Hertzberg, Bernhard Nebel, Gerhard Brewka, Gerhard Lakemeyer, Torsten Schaub, Frank Puppe. Ist die Wissensrepräsentation tot?. Künstliche Intelligenz, 9(5): 18-26, 1995

  13. Torsten Schaub. Computing queries from prioritized default theories. In Z. Ras, M. Zemankova, editors, Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems (ISMIS'94), Lecture Notes in Computer Science 869, pages 584-593, Springer Verlag, 1994 [BiBTeX]

  14. James Delgrande, Torsten Schaub. Incorporating specificity into circumscriptive theories. In B. Nebel, L. Dreschler-Fischer, editors, Advances in Artificial Intelligence, Proceedings of the Eighteenth Annual German Conference on Artificial Intelligence (KI'94), Lecture Notes in Computer Science 861, pages 272-283, Springer Verlag, 1994 [BiBTeX]

  15. James Delgrande, Torsten Schaub. A general approach to specificity in default reasoning. In J. Doyle, E. Sandewall, P. Torasso, editors, Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR'94), pages 146-157, Morgan Kaufmann Publishers, 1994 [BiBTeX]

  16. James Delgrande, Torsten Schaub, W. Ken Jackson. Alternative approaches to default logic. Artificial Intelligence, 70(1-2): 167-237, 1994 [BiBTeX]

  17. Philippe Besnard, Torsten Schaub. Possible worlds semantics for default logics. Fundamenta Informaticae, 21(1/2): 39-66, 1994 [BiBTeX]

  18. Philippe Besnard, Torsten Schaub. A context-based framework for default logics. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI'93), pages 406-411, The AAAI Press/The MIT Press, 1994 [BiBTeX]

  19. W. Bibel and S. Hölldobler and Torsten Schaub. Wissensrepräsentation und Inferenz: Eine grundlegende Einführung. Vieweg Verlag, Braunschweig, 1993 [BiBTeX]

  20. Torsten Schaub. Variations of constrained default logic. In M. Clarke, R. Kruse, S. Moral, editors, Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU'93), Lecture Notes in Computer Science 747, pages 304-308, Springer Verlag, 1993 [BiBTeX]

  21. Torsten Schaub. On constrained default theories. In B. Neumann, editor, Proceedings of the Tenth European Conference on Artificial Intelligence ECAI'92, pages 304-308, John Wiley and Sons, 1992 [BiBTeX]

  22. Torsten Schaub. On commitment and cumulativity in default logics. In R. Kruse, P. Siegel, editors, Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, European Conference ECSQAU'91, Lecture Notes in Computer Science 548, pages 305-309, Springer Verlag, 1991 [BiBTeX]

  23. Torsten Schaub. Assertional default theories: A semantical view. In J. Allen, R. Fikes, E. Sandewall, editors, Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR'91), pages 496-506, Morgan Kaufmann Publishers, 1991 [BiBTeX]
  Valid XHTML 1.1!   Valid CSS! Letzte Änderung: kaminski@cs.uni-potsdam.de, 25.01.2012