Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Hans Tompits
2010 – today
- 2012
[j18]Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits: Annotating answer-set programs in Lana. TPLP 12(4-5): 619-637 (2012)- [c88]Johannes Oetsch, Jörg Pührer, Hans Tompits: Stepwise Debugging of Description-Logic Programs. Correct Reasoning 2012: 492-508
- [c87]Johannes Oetsch, Jörg Pührer, Hans Tompits: An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. ICLP (Technical Communications) 2012: 222-234
- [c86]Johannes Oetsch, Michael Prischink, Jörg Pührer, Martin Schwengerer, Hans Tompits: On the Small-Scope Hypothesis for Testing Answer-Set Programs. KR 2012
- [c85]Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits: Guided Merging of Sequence Diagrams. SLE 2012: 164-183
- [c84]Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer: Towards Scenario-Based Testing of UML Diagrams. TAP 2012: 149-155
- [i18]Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits: Annotating Answer-Set Programs in LANA? CoRR abs/1210.2195 (2012)
- 2011
- [j17]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. ACM Trans. Comput. Log. 12(3): 20 (2011)
- [c83]Johannes Oetsch, Jörg Pührer, Hans Tompits: Stepping through an Answer-Set Program. LPNMR 2011: 134-147
- [c82]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits: Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. LPNMR 2011: 242-247
- [c81]Johannes Oetsch, Hans Tompits: Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. LPNMR 2011: 254-259
- [c80]Johannes Oetsch, Jörg Pührer, Martina Seidl, Hans Tompits, Patrick Zwickl: VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology. LPNMR 2011: 382-387
- [c79]Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer: Towards Semantics-Aware Merge Support in Optimistic Model Versioning. MoDELS Workshops 2011: 246-256
- [i17]Johannes Oetsch, Jörg Pührer, Hans Tompits: The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary Report. CoRR abs/1109.3989 (2011)
- [i16]Christian Kloimüllner, Johannes Oetsch, Jörg Pührer, Hans Tompits: Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. CoRR abs/1109.4095 (2011)
- [i15]Johannes Oetsch, Jörg Pührer, Hans Tompits: Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming. CoRR abs/1112.0922 (2011)
- 2010
- [j16]Johannes Oetsch, Jörg Pührer, Hans Tompits: Catching the Ouroboros: On debugging non-ground answer-set programs. TPLP 10(4-6): 513-529 (2010)
- [j15]Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits: The system Kato: Detecting cases of plagiarism for answer-set programs. TPLP 10(4-6): 759-775 (2010)
- [c78]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits: On Testing Answer-Set Programs. ECAI 2010: 951-956
- [c77]Johannes Oetsch, Jörg Pührer, Hans Tompits: Methods and Methodologies for Developing Answer-Set Programs - Project Description. ICLP (Technical Communications) 2010: 154-161
- [i14]Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits: The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs. CoRR abs/1007.4971 (2010)
- [i13]Johannes Oetsch, Jörg Pührer, Hans Tompits: Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs. CoRR abs/1007.4986 (2010)
2000 – 2009
- 2009
- [j14]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. (JAIR) 35: 813-857 (2009)
- [j13]David Pearce, Hans Tompits, Stefan Woltran: Characterising equilibrium logic and nested logic programs: Reductions and complexity, . TPLP 9(5): 565-616 (2009)
- [c76]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Merging Logic Programs under Answer Set Semantics. ICLP 2009: 160-174
- [c75]Jörg Pührer, Hans Tompits: Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. LPNMR 2009: 264-276
- [c74]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. LPNMR 2009: 382-395
- [i12]David Pearce, Hans Tompits, Stefan Woltran: Characterising equilibrium logic and nested logic programs: Reductions and complexity. CoRR abs/0906.2228 (2009)
- [i11]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: A general approach to belief change in answer set programming. CoRR abs/0912.5511 (2009)
- 2008
- [j12]Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits: Combining answer set programming with description logics for the Semantic Web. Artif. Intell. 172(12-13): 1495-1539 (2008)
- [c73]Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits: A Meta-Programming Technique for Debugging Answer-Set Programs. AAAI 2008: 448-453
- [c72]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. FoIKS 2008: 24-41
- [c71]Jörg Pührer, Hans Tompits, Stefan Woltran: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. ICLP 2008: 561-575
- [c70]Johannes Oetsch, Hans Tompits: Program Correspondence under the Answer-Set Semantics: The Non-ground Case. ICLP 2008: 591-605
- [c69]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Belief Revision of Logic Programs under Answer Set Semantics. KR 2008: 411-421
- [c68]Wolfgang Faber, Hans Tompits, Stefan Woltran: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443
- [c67]Jos de Bruijn, Thomas Eiter, Hans Tompits: Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. KR 2008: 485-495
- [i10]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination. CoRR abs/0811.0359 (2008)
- 2007
- [j11]James P. Delgrande, Torsten Schaub, Hans Tompits: A General Framework for Expressing Preferences in Causal Reasoning and Planning. J. Log. Comput. 17(5): 871-907 (2007)
- [j10]Thomas Eiter, Michael Fink, Hans Tompits: A knowledge-based approach for selecting information sources. TPLP 7(3): 249-300 (2007)
- [c66]Johannes Oetsch, Hans Tompits, Stefan Woltran: Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. AAAI 2007: 458-464
- [c65]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. IJCAI 2007: 304-309
- [c64]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Complexity Results for Checking Equivalence of Stratified Logic Programs. IJCAI 2007: 330-335
- [c63]Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran: Debugging ASP Programs by Means of ASP. LPNMR 2007: 31-43
- [c62]James P. Delgrande, Torsten Schaub, Hans Tompits: A Preference-Based Framework for Updating Logic Programs. LPNMR 2007: 71-83
- [c61]Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran: Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135
- [c60]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT 2007
- [c59]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187
- [c58]David Pearce, Hans Tompits, Stefan Woltran: Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. CENT 2007
- [c57]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. INAP/WLP 2007: 241-246
- [c56]Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran: spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. INAP/WLP 2007: 247-252
- 2006
- [c55]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. ESWC 2006: 273-287
- [c54]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. JELIA 2006: 502-505
- [c53]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. KR 2006: 340-351
- [c52]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. KSEM 2006: 1-22
- [c51]Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits: Reasoning with Rules and Ontologies. Reasoning Web 2006: 93-127
- [c50]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang: Forgetting in Managing Rules and Ontologies. Web Intelligence 2006: 411-419
- [c49]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. Web Intelligence 2006: 1073-1074
- [c48]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. WLP 2006: 145-153
- [c47]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. WLP 2006: 200-205
- [c46]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. WLP 2006: 206-210
- [e1]Michael Fink, Hans Tompits, Stefan Woltran (Eds.): 20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006. INFSYS Research Report 1843-06-02, Technische Universität Wien, Austria 2006
- [i9]Thomas Eiter, Michael Fink, Hans Tompits: A Knowledge-Based Approach for Selecting Information Sources. CoRR abs/cs/0604086 (2006)
- 2005
- [j9]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about evolving nonmonotonic knowledge bases. ACM Trans. Comput. Log. 6(2): 389-440 (2005)
- [c45]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. AAAI 2005: 695-700
- [c44]Hans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. Answer Set Programming 2005
- [c43]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance 2005: 84-118
- [c42]Hans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. ICLP 2005: 189-203
- [c41]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. IJCAI 2005: 90-96
- [c40]Thomas Eiter, Hans Tompits, Stefan Woltran: On Solution Correspondences in Answer-Set Programming. IJCAI 2005: 97-102
- 2004
- [j8]James P. 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)
- [j7]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: On Computing Belief Change Operations using Quantified Boolean Formulas. J. Log. Comput. 14(6): 801-826 (2004)
- [c39]James P. Delgrande, Torsten Schaub, Hans Tompits: Domain-Specific Preferences for Causal Reasoning and Planning. ICAPS 2004: 63-72
- [c38]Thomas Linke, Hans Tompits, Stefan Woltran: On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP 2004: 225-239
- [c37]Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits: Combining Answer Set Programming with Description Logics for the Semantic Web. KR 2004: 141-151
- [c36]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: On Eliminating Disjunctions in Stable Logic Programming. KR 2004: 447-458
- [c35]James P. Delgrande, Torsten Schaub, Hans Tompits: Domain-Specific Preferences for Causal Reasoning and Planning. KR 2004: 673-682
- [c34]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: Nonmonotonic Description Logic Programs: Implementation and Experiments. LPAR 2004: 511-527
- [c33]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004: 87-99
- [c32]Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: nlp: A Compiler for Nested Logic Programming. LPNMR 2004: 361-364
- [c31]Thomas Linke, Hans Tompits, Stefan Woltran: On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275
- [c30]Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits: Well-Founded Semantics for Description Logic Programs in the Semantic Web. RuleML 2004: 81-97
- 2003
- [j6]Hans Tompits: Expressing default abduction problems as quantified Boolean formulas. AI Commun. 16(2): 89-105 (2003)
- [j5]Uwe Egly, Hans Tompits: On Different Proof-Search Strategies for Orthologic. Studia Logica 73(1): 131-152 (2003)
- [j4]James P. Delgrande, Torsten Schaub, Hans Tompits: A Framework for Compiling Preferences in Logic Programs. TPLP 3(2): 129-187 (2003)
- [c29]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003
- [c28]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Declarative Update Policies for Nonmonotonic Knowledge Bases. Logics for Emerging Applications of Databases 2003: 85-129
- [c27]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. ECSQARU 2003: 528-539
- [c26]Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228
- 2002
- [j3]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Using Methods of Declarative Logic Programming for Intelligent Information Agents. TPLP 2(6): 645-709 (2002)
- [j2]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: On Properties of Update Sequences Based on Causal Rejection. TPLP 2(6): 711-767 (2002)
- [c25]David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. ICLP 2002: 405-420
- [c24]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. JELIA 2002: 320-331
- [c23]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: A Generic Approach for Knowledge-Based Information-Site Selection. KR 2002: 459-469
- [c22]David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. NMR 2002: 57-66
- [c21]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. Paraconsistent Computational Logic 2002: 1-15
- [c20]Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002: 100-114
- [i8]James P. Delgrande, Torsten Schaub, Hans Tompits: A Framework for Compiling Preferences in Logic Programs. CoRR cs.AI/0203005 (2002)
- [i7]David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. CoRR cs.AI/0207071 (2002)
- [i6]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about Evolving Nonmonotonic Knowledge Bases. CoRR cs.AI/0209019 (2002)
- 2001
- [j1]Uwe Egly, Hans Tompits: Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2(3): 340-387 (2001)
- [c19]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001
- [c18]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: On Computing Solutions to Belief Change Scenarios. ECSQARU 2001: 510-521
- [c17]David Pearce, Hans Tompits, Stefan Woltran: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. EPIA 2001: 306-320
- [c16]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: A Framework for Declarative Update Specifications in Logic Programs. IJCAI 2001: 649-654
- [c15]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about Evolving Nonmonotonic Knowledge Bases. LPAR 2001: 407-421
- [c14]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: An Update Front-End for Extended Logic Programs. LPNMR 2001: 397-401
- [c13]James P. Delgrande, Torsten Schaub, Hans Tompits: plp: A Generic Compiler for Ordered Logic Programs. LPNMR 2001: 411-415
- [i5]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: On Properties of Update Sequences Based on Causal Rejection. CoRR cs.AI/0109006 (2001)
- [i4]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Using Methods of Declarative Logic Programming for Intelligent Information Agents. CoRR cs.MA/0108008 (2001)
- 2000
- [c12]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000: 417-422
- [c11]Uwe Egly, Hans Tompits: Some Strengths of Nonmonotonic Reasoning. Intellectics and Computational Logic 2000: 125-141
- [c10]James P. Delgrande, Torsten Schaub, Hans Tompits: Logic Programs with Compiled Preferences. ECAI 2000: 464-468
- [c9]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Considerations on Updates of Logic Programs. JELIA 2000: 2-20
- [c8]James P. Delgrande, Torsten Schaub, Hans Tompits: A Compilation of Brewka and Eiter's Approach to Prioritization. JELIA 2000: 376-390
- [c7]Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. 15. WLP 2000: 113-122
- [c6]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000: 223-228
- [i3]James P. Delgrande, Torsten Schaub, Hans Tompits: A Compiler for Ordered Logic Programs. CoRR cs.AI/0003024 (2000)
- [i2]James P. Delgrande, Torsten Schaub, Hans Tompits: Logic Programs with Compiled Preferences. CoRR cs.AI/0003028 (2000)
- [i1]Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks. CoRR cs.AI/0003037 (2000)
1990 – 1999
- 1999
- [c5]Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits: A Web-based Tutoring Tool for Calculating Default Logic Extensions. WebNet 1999: 1251-1252
- 1998
- [c4]
- 1997
- [c3]
- [c2]
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:48 CEST by the dblp team