 | 2009 |
|---|
| 155 |       | Esra Erdem,
Fangzhen Lin,
Torsten Schaub:
Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings
Springer 2009 |
| 154 | | Martin Gebser,
Benjamin Kaufmann,
Torsten Schaub:
Solution Enumeration for Projected Boolean Search Problems.
CPAIOR 2009: 71-86 |
| 153 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Merging Logic Programs under Answer Set Semantics.
ICLP 2009: 160-174 |
| 152 | | Martin Gebser,
Max Ostrowski,
Torsten Schaub:
Constraint Answer Set Solving.
ICLP 2009: 235-249 |
| 151 | | Martin Gebser,
Roland Kaminski,
Benjamin Kaufmann,
Torsten Schaub:
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers.
ICLP 2009: 250-264 |
| 150 | | Torsten Schaub,
Sven Thiele:
Metabolic Network Expansion with Answer Set Programming.
ICLP 2009: 312-326 |
| 149 | | Enrico Ellguth,
Martin Gebser,
Markus Gusowski,
Benjamin Kaufmann,
Roland Kaminski,
Stefan Liske,
Torsten Schaub,
Lars Schneidenbach,
Bettina Schnor:
A Simple Distributed Conflict-Driven Answer Set Solver.
LPNMR 2009: 490-495 |
| 148 | | Martin Gebser,
Roland Kaminski,
Max Ostrowski,
Torsten Schaub,
Sven Thiele:
On the Input Language of ASP Grounder Gringo.
LPNMR 2009: 502-508 |
| 147 | | Martin Gebser,
Benjamin Kaufmann,
Torsten Schaub:
The Conflict-Driven Answer Set Solver clasp: Progress Report.
LPNMR 2009: 509-514 |
| 146 | | Harold Ishebabi,
Philipp Mahr,
Christophe Bobda,
Martin Gebser,
Torsten Schaub:
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs.
LPNMR 2009: 598-603 |
| 145 | | Torsten Schaub:
Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode.
LPNMR 2009: 631-633 |
| 144 | | Lars Schneidenbach,
Bettina Schnor,
Martin Gebser,
Roland Kaminski,
Benjamin Kaufmann,
Torsten Schaub:
Experiences Running a Parallel Answer Set Solver on Blue Gene.
PVM/MPI 2009: 64-72 |
| 143 | | 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 |
|---|
| 142 |  | Martin Gebser,
Jörg Pührer,
Torsten Schaub,
Hans Tompits:
A Meta-Programming Technique for Debugging Answer-Set Programs.
AAAI 2008: 448-453 |
| 141 | | Martin Gebser,
Benjamin Kaufmann,
André Neumann,
Torsten Schaub:
Advanced Preprocessing for Answer Set Solving.
ECAI 2008: 15-19 |
| 140 | | Torsten Schaub:
Model-Based Knowledge Representation and Reasoning Via Answer Set Programming.
FLOPS 2008: 1-2 |
| 139 | | 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 |
| 138 | | Martin Gebser,
Torsten Schaub,
Sven Thiele,
Björn Usadel,
Philippe Veber:
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming.
ICLP 2008: 130-144 |
| 137 | | Martin Gebser,
Roland Kaminski,
Benjamin Kaufmann,
Max Ostrowski,
Torsten Schaub,
Sven Thiele:
Engineering an Incremental ASP Solver.
ICLP 2008: 190-205 |
| 136 | | Torsten Schaub:
Here's the Beef: Answer Set Programming !
ICLP 2008: 93-98 |
| 135 | | Steve Dworschak,
Torsten Grote,
Arne König,
Torsten Schaub,
Philippe Veber:
The System BioC for Reasoning about Biological Models in Action Language C.
ICTAI (1) 2008: 11-18 |
| 134 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Belief Revision of Logic Programs under Answer Set Semantics.
KR 2008: 411-421 |
| 133 | | Christian Drescher,
Martin Gebser,
Torsten Grote,
Benjamin Kaufmann,
Arne König,
Max Ostrowski,
Torsten Schaub:
Conflict-Driven Disjunctive Answer Set Solving.
KR 2008: 422-432 |
| 132 | | Steve Dworschak,
Susanne Grell,
Victoria J. Nikiforova,
Torsten Schaub,
Joachim Selbig:
Modeling Biological Networks by Action Languages via Answer Set Programming.
Constraints 13(1-2): 21-65 (2008) |
| 2007 |
|---|
| 131 | | Martin Gebser,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report.
CENT 2007 |
| 130 | | Alessandra Mileo,
Torsten Schaub:
Qualitative Constraint Enforcement in Advanced Policy Specification.
ECSQARU 2007: 695-706 |
| 129 | | James P. Delgrande,
Daphne H. Liu,
Torsten Schaub,
Sven Thiele:
COBA 2.0: A Consistency-Based Belief Change System.
ECSQARU 2007: 78-90 |
| 128 | | Martin Gebser,
Torsten Schaub:
Generic Tableaux for Answer Set Programming.
ICLP 2007: 119-133 |
| 127 | | James P. Delgrande,
Jérôme Lang,
Torsten Schaub:
Belief Change Based on Global Minimisation.
IJCAI 2007: 2468-2473 |
| 126 | | Martin Gebser,
Benjamin Kaufmann,
André Neumann,
Torsten Schaub:
Conflict-Driven Answer Set Solving.
IJCAI 2007: 386- |
| 125 | | 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 |
| 124 | | Martin Gebser,
Benjamin Kaufmann,
André Neumann,
Torsten Schaub:
Conflict-Driven Answer Set Enumeration.
LPNMR 2007: 136-148 |
| 123 | | Martin Gebser,
Benjamin Kaufmann,
André Neumann,
Torsten Schaub:
clasp : A Conflict-Driven Answer Set Solver.
LPNMR 2007: 260-265 |
| 122 | | Martin Gebser,
Torsten Schaub,
Sven Thiele:
GrinGo : A New Grounder for Answer Set Programming.
LPNMR 2007: 266-271 |
| 121 | | Martin Gebser,
Lengning Liu,
Gayathri Namasivayam,
André Neumann,
Torsten Schaub,
Miroslaw Truszczynski:
The First Answer Set Programming System Competition.
LPNMR 2007: 3-17 |
| 120 | | 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 |
| 119 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
A Preference-Based Framework for Updating Logic Programs.
LPNMR 2007: 71-83 |
| 118 | | James P. Delgrande,
Torsten Schaub:
A consistency-based framework for merging knowledge bases.
J. Applied Logic 5(3): 459-477 (2007) |
| 117 | | 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) |
| 2006 |
|---|
| 116 | | Jean Gressmann,
Tomi Janhunen,
Robert E. Mercer,
Torsten Schaub,
Sven Thiele,
Richard Tichy:
On Probing and Multi-Threading in Platypus.
ECAI 2006: 392-396 |
| 115 | | Christian Anger,
Martin Gebser,
Tomi Janhunen,
Torsten Schaub:
What's a Head Without a Body?
ECAI 2006: 769-770 |
| 114 | | Martin Gebser,
Torsten Schaub:
Tableau Calculi for Answer Set Programming.
ICLP 2006: 11-25 |
| 113 | | Susanne Grell,
Torsten Schaub,
Joachim Selbig:
Modelling Biological Networks by Action Languages Via Answer Set Programming.
ICLP 2006: 285-299 |
| 112 | | Torsten Schaub:
Tableaux Calculi for Answer Set Programming.
WLP 2006: 1-11 |
| 111 | | Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
Graphs and colorings for answer set programming.
TPLP 6(1-2): 61-106 (2006) |
| 2005 |
|---|
| 110 | | Gerhard Brewka,
Ilkka Niemelä,
Torsten Schaub,
Miroslaw Truszczynski:
Nonmonotonic Reasoning, Answer Set Programming and Constraints, 24.-29. April 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 |
| 109 | | Leopoldo E. Bertossi,
Anthony Hunter,
Torsten Schaub:
Inconsistency Tolerance [result from a Dagstuhl seminar]
Springer 2005 |
| 108 | | Christian Anger,
Martin Gebser,
Thomas Linke,
André Neumann,
Torsten Schaub:
The nomore++ Approach to Answer Set Solving.
Answer Set Programming 2005 |
| 107 | | Leopoldo E. Bertossi,
Anthony Hunter,
Torsten Schaub:
Introduction to Inconsistency Tolerance.
Inconsistency Tolerance 2005: 1-14 |
| 106 | | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Representing Paraconsistent Reasoning via Quantified Propositional Logic.
Inconsistency Tolerance 2005: 84-118 |
| 105 | | Christian Anger,
Martin Gebser,
Thomas Linke,
André Neumann,
Torsten Schaub:
The nomore++ Approach to Answer Set Solving.
LPAR 2005: 95-109 |
| 104 | | Jean Gressmann,
Tomi Janhunen,
Robert E. Mercer,
Torsten Schaub,
Sven Thiele,
Richard Tichy:
Platypus: A Platform for Distributed Answer Set Solving.
LPNMR 2005: 227-239 |
| 103 | | Susanne Grell,
Kathrin Konczak,
Torsten Schaub:
nomore<: A System for Computing Preferred Answer Sets.
LPNMR 2005: 394-398 |
| 102 | | Christian Anger,
Martin Gebser,
Thomas Linke,
André Neumann,
Torsten Schaub:
The nomore++ System.
LPNMR 2005: 422-426 |
| 101 | | Martin Gebser,
Torsten Schaub:
Loops: Relevant or Redundant?
LPNMR 2005: 53-65 |
| 100 | | Gerhard Brewka,
Ilkka Niemelä,
Torsten Schaub,
Miroslaw Truszczynski,
Joost Vennekens:
05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints.
Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 |
| 99 | | Gerhard Brewka,
Ilkka Niemelä,
Torsten Schaub,
Miroslaw Truszczynski:
05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints.
Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 |
| 98 | | Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
Graphs and colorings for answer set programming
CoRR abs/cs/0502082: (2005) |
| 97 | | James P. Delgrande,
Torsten Schaub:
Expressing Default Logic Variants in Default Logic.
J. Log. Comput. 15(5): 593-621 (2005) |
| 96 | | Christian Anger,
Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
A Glimpse of Answer Set Programming.
KI 19(1): 12- (2005) |
| 2004 |
|---|
| 95 | | James P. Delgrande,
Torsten Schaub:
10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, Canada, June 6-8, 2004, Proceedings
NMR 2004 |
| 94 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
Domain-Specific Preferences for Causal Reasoning and Planning.
ICAPS 2004: 63-72 |
| 93 | | James P. Delgrande,
Torsten Schaub:
Two Approaches to Merging Knowledge Bases.
JELIA 2004: 426-438 |
| 92 | | Andreas Bösel,
Thomas Linke,
Torsten Schaub:
Profiling Answer Set Programming: The Visualization Component of the noMoRe System.
JELIA 2004: 702-705 |
| 91 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
Domain-Specific Preferences for Causal Reasoning and Planning.
KR 2004: 673-682 |
| 90 | | Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
Graphs and Colorings for Answer Set Programming: Abridged Report.
LPNMR 2004: 127-140 |
| 89 | | Paul Borchert,
Christian Anger,
Torsten Schaub,
Miroslaw Truszczynski:
Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative.
LPNMR 2004: 3-7 |
| 88 | | Vladimir Sarsakov,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
nlp: A Compiler for Nested Logic Programming.
LPNMR 2004: 361-364 |
| 87 | | James P. Delgrande,
Torsten Schaub:
Consistency-based approaches to merging knowledge bases: preliminary report.
NMR 2004: 126-133 |
| 86 | | André Flöter,
Jacques Nicolas,
Torsten Schaub,
Joachim Selbig:
Threshold extraction in metabolite concentration data.
Bioinformatics 20(10): 1491-1494 (2004) |
| 85 | | James P. Delgrande,
Torsten Schaub:
Reasoning with Sets of Defaults in Default Logic.
Computational Intelligence 20(1): 56-88 (2004) |
| 84 | | 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) |
| 83 | | 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) |
| 2003 |
|---|
| 82 | | Kathrin Konczak,
Torsten Schaub,
Thomas Linke:
Graphs and coloring for answer set programming: Preliminary Report.
Answer Set Programming 2003 |
| 81 | | Kathrin Konczak,
Torsten Schaub,
Thomas Linke:
Graphs and colorings for answer set programming: Abridged Report.
Answer Set Programming 2003 |
| 80 | | James P. Delgrande,
M. Gharib,
Robert E. Mercer,
Vincent Risch,
Torsten Schaub:
Lukaszewicz-style Answer Set Programming: A Preliminary Report.
Answer Set Programming 2003 |
| 79 | | James P. Delgrande,
Torsten Schaub:
On the Relation between Reiter's Default Logic and Its (Major).
ECSQARU 2003: 452-463 |
| 78 | | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories.
ECSQARU 2003: 528-539 |
| 77 | | André Flöter,
Jacques Nicolas,
Torsten Schaub,
Joachim Selbig:
Threshold extraction in metabolite concentration data.
German Conference on Bioinformatics 2003: 33-39 |
| 76 | | Philippe Besnard,
Robert E. Mercer,
Torsten Schaub:
Optimality Theory through Default Logic.
KI 2003: 93-104 |
| 75 | | James P. Delgrande,
Torsten Schaub:
A consistency-based approach for belief change.
Artif. Intell. 151(1-2): 1-41 (2003) |
| 74 | | Torsten Schaub,
Kewen Wang:
A semantic framework for preference handling in answer set programming
CoRR cs.AI/0301023: (2003) |
| 73 | | Kathrin Konczak,
Torsten Schaub,
Thomas Linke:
Graphs and Colorings for Answer Set Programming with Preferences.
Fundam. Inform. 57(2-4): 393-421 (2003) |
| 72 | | Philippe Besnard,
Gisbert Fanselow,
Torsten Schaub:
Optimality Theory as a Family of Cumulative Logics.
Journal of Logic, Language and Information 12(2): 153-182 (2003) |
| 71 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
A Framework for Compiling Preferences in Logic Programs.
TPLP 3(2): 129-187 (2003) |
| 70 | | Torsten Schaub,
Kewen Wang:
A semantic framework for preference handling in answer set programming.
TPLP 3(4-5): 569-607 (2003) |
| 2002 |
|---|
| 69 | | 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 |
| 68 | | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
JELIA 2002: 320-331 |
| 67 | | James P. Delgrande,
Aaron Hunter,
Torsten Schaub:
COBA: A Consistency-Based Belief Revision System.
JELIA 2002: 509-512 |
| 66 | | Torsten Schaub,
Kewen Wang:
Preferred well-founded semantics for logic programming by alternating fixpoints: preliminary report.
NMR 2002: 238-246 |
| 65 | | 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 |
| 64 | | Philippe Besnard,
Robert E. Mercer,
Torsten Schaub:
Optimality theory through default logic.
NMR 2002: 77-83 |
| 63 | | Philippe Besnard,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.
Paraconsistent Computational Logic 2002: 1-15 |
| 62 | | M. Brian Blake,
Karen Zita Haigh,
Henry Hexmoor,
Rino Falcone,
Leen-Kiat Soh,
Chitta Baral,
Sheila A. McIlraith,
Piotr J. Gmytrasiewicz,
Simon Parsons,
Rainer Malaka,
Antonio Krüger,
Paolo Bouquet,
Bill Smart,
Koichi Kurumantani,
Adam Pease,
Michael Brenner,
Marie desJardins,
Ulrich Junker,
James P. Delgrande,
Jon Doyle,
Francesca Rossi,
Torsten Schaub,
Carla P. Gomes,
Toby Walsh,
Haipeng Guo,
Eric Horvitz,
Nancy Ide,
Christopher A. Welty,
Frank D. Anger,
Hans W. Guesgen,
Gérard Ligozat:
AAAI 2002 Workshops.
AI Magazine 23(4): 113-121 (2002) |
| 61 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
A Framework for Compiling Preferences in Logic Programs
CoRR cs.AI/0203005: (2002) |
| 60 | | Torsten Schaub,
Kewen Wang:
Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report
CoRR cs.AI/0207060: (2002) |
| 59 | | 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) |
| 58 | | James P. Delgrande,
Torsten Schaub:
Reasoning Credulously and skeptically within a single extension.
Journal of Applied Non-Classical Logics 12(2): 259-285 (2002) |
| 2001 |
|---|
| 57 | | Torsten Schaub,
Kewen Wang:
A Comparative Study of Logic Programs with Preference: Preliminary Report.
Answer Set Programming 2001 |
| 56 | | Torsten Schaub:
What's Your Preference? And How to Express and Implement It in Logic Programming!
ECSQARU 2001: 17 |
| 55 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits,
Stefan Woltran:
On Computing Solutions to Belief Change Scenarios.
ECSQARU 2001: 510-521 |
| 54 | | James P. Delgrande,
Torsten Schaub:
How to Reason Credulously and Skeptically within a Single Extension.
ECSQARU 2001: 592-603 |
| 53 | | Torsten Schaub,
Kewen Wang:
A Comparative Study of Logic Programs with Preference.
IJCAI 2001: 597-602 |
| 52 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
plp: A Generic Compiler for Ordered Logic Programs.
LPNMR 2001: 411-415 |
| 2000 |
|---|
| 51 | | James P. Delgrande,
Torsten Schaub:
A Consistency-Based Model for Belief Change: Preliminary Report.
AAAI/IAAI 2000: 392-398 |
| 50 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
Logic Programs with Compiled Preferences.
ECAI 2000: 464-468 |
| 49 | | Stefan Brüning,
Torsten Schaub:
A Connection Calculus for Handling Incomplete Information.
Intellectics and Computational Logic 2000: 47-66 |
| 48 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
A Compilation of Brewka and Eiter's Approach to Prioritization.
JELIA 2000: 376-390 |
| 47 | | Philippe Besnard,
Torsten Schaub:
Significant Inferences : Preliminary Report.
KR 2000: 401-410 |
| 46 | | James P. Delgrande,
Torsten Schaub:
Expressing preferences in default logic.
Artif. Intell. 123(1-2): 41-87 (2000) |
| 45 | | Thomas Linke,
Torsten Schaub:
Alternative foundations for Reiter's default logic.
Artif. Intell. 124(1): 31-86 (2000) |
| 44 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
A Compiler for Ordered Logic Programs
CoRR cs.AI/0003024: (2000) |
| 43 | | James P. Delgrande,
Torsten Schaub,
Hans Tompits:
Logic Programs with Compiled Preferences
CoRR cs.AI/0003028: (2000) |
| 42 | | James P. Delgrande,
Torsten Schaub:
A Consistency-Based Model for Belief Change: Preliminary Report
CoRR cs.AI/0003052: (2000) |
| 41 | | Philippe Besnard,
Torsten Schaub:
What is a (non-constructive) non-monotone logical system?
Theor. Comput. Sci. 238(1-2): 489-494 (2000) |
| 1999 |
|---|
| 40 | | Thomas Linke,
Torsten Schaub:
On Bottom-Up Pre-processing Techniques for Automated Default Reasoning.
ESCQARU 1999: 268-278 |
| 39 | | Farid Benhammadi,
Pascal Nicolas,
Torsten Schaub:
Query-Answering in Prioritized Default Logic.
ESCQARU 1999: 32-42 |
| 38 | | Stefan Brüning,
Torsten Schaub:
Avoiding Non-ground Variables.
ESCQARU 1999: 92-103 |
| 37 | | Thomas Linke,
Torsten Schaub:
Default Reasoning via Blocking Sets.
LPNMR 1999: 247-261 |
| 1998 |
|---|
| 36 | | Torsten Schaub:
The Automation of Reasoning with Incomplete Information, From Semantic Foundations to Efficient Computation.
Springer 1998 |
| 35 | | Farid Benhammadi,
Pascal Nicolas,
Torsten Schaub:
Extension Calculus and Query Answering in Prioritized Default Logic.
AIMSA 1998: 76-87 |
| 34 | | Pascal Nicolas,
Torsten Schaub:
The XRay system: An implementation platform for local query-answering in default logics.
Applications of Uncertainty Formalisms 1998: 354-378 |
| 33 | | Thomas Linke,
Torsten Schaub:
An Approach to Query-Answering in Reiter's Default Logic and the Underlying Existence of Extensions Problem.
JELIA 1998: 233-247 |
| 32 | | James P. Delgrande,
Torsten Schaub:
Reasoning with Sets of Preferences in Default Logic.
PRICAI 1998: 134-145 |
| 31 | | Torsten Schaub,
Stefan Brüning:
Prolog Technology for Default Reasoning: Proof Theory and Compilation Techniques.
Artif. Intell. 106(1): 1-75 (1998) |
| 30 | | Philippe Besnard,
Torsten Schaub:
Signed Systems for Paraconsistent Reasoning.
J. Autom. Reasoning 20(1): 191-213 (1998) |
| 1997 |
|---|
| 29 | | Philippe Besnard,
Torsten Schaub:
Circumscribing Inconsistency.
IJCAI (1) 1997: 150-155 |
| 28 | | James P. Delgrande,
Torsten Schaub:
Compiling Reasoning with and about Preferences into Default Logic.
IJCAI (1) 1997: 168-175 |
| 27 | | Torsten Schaub,
Pascal Nicolas:
An Implementation Platform for Query-Answering in Default Logics: Theoretical Underpinnings.
ISMIS 1997: 197-206 |
| 26 | | Torsten Schaub,
Pascal Nicolas:
An Implementation Platform for Query-Answering: X-RAY.
LPNMR 1997: 442-453 |
| 25 | | James P. Delgrande,
Torsten Schaub:
Compiling Specificity Into Approaches to Nonmonotonic Reasoning.
Artif. Intell. 90(1-2): 301-348 (1997) |
| 24 | | Thomas Linke,
Torsten Schaub:
Towards a classification of Default Logics.
Journal of Applied Non-Classical Logics 7(4): (1997) |
| 1996 |
|---|
| 23 | | Torsten Schaub,
Stefan Brüning,
Pascal Nicolas:
XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description.
CADE 1996: 293-297 |
| 22 | | Torsten Schaub,
Stefan Brüning:
Prolog Technology for Default Reasoning (An Abridged Report).
ECAI 1996: 105-109 |
| 21 | | Torsten Schaub,
Michael Thielscher:
Skeptical Query-Answering in Constrained Default Logic.
FAPR 1996: 567-581 |
| 20 | | Stefan Brüning,
Torsten Schaub:
A Model-Based Approach to Consistency-Checking.
ISMIS 1996: 315-324 |
| 19 | | Philippe Besnard,
Torsten Schaub:
A Simple Signed System for Paraconsistent Reasoning.
JELIA 1996: 404-416 |
| 18 | | Thomas Linke,
Torsten Schaub:
Putting Default Logics in Perspective.
KI 1996: 241-252 |
| 1995 |
|---|
| 17 | | Thomas Linke,
Torsten Schaub:
Lemma Handling in Default Logic Theorem Provers.
ECSQARU 1995: 285-292 |
| 16 | | Philippe Besnard,
Torsten Schaub:
An Approach to Context-Based Default Reasoning.
Fundam. Inform. 23(2/3/4): 175-223 (1995) |
| 15 | | Michael Thielscher,
Torsten Schaub:
Default Reasoning by Deductive Planning.
J. Autom. Reasoning 15(1): 1-40 (1995) |
| 14 | | Torsten Schaub:
A New Methodology for Query Answering in Default Logics via Structure-Oriented Theorem Proving.
J. Autom. Reasoning 15(1): 95-165 (1995) |
| 13 | | Ulrich Furbach,
Hans-Jürgen Bürckert,
Joachim Hertzberg,
Bernhard Nebel,
Gerhard Brewka,
Gerhard Lakemeyer,
Torsten Schaub,
Frank Puppe:
Ist die Wissensrepräsentation tot?
KI 9(5): 18-26 (1995) |
| 1994 |
|---|
| 12 | | Stefan Brüning,
Torsten Schaub:
Using Classical Theorem-Proving Techniques for Approximate Reasoning: Revised Report.
IPMU 1994: 389-398 |
| 11 | | Torsten Schaub:
Computing Queries from Prioritized Default Theories.
ISMIS 1994: 584-593 |
| 10 | | James P. Delgrande,
Torsten Schaub:
Incorporating Specificity into Circumscriptive Theories.
KI 1994: 272-283 |
| 9 | | James P. Delgrande,
Torsten Schaub:
A General Approach to Specificity in Default Reasoning.
KR 1994: 146-157 |
| 8 | | James P. Delgrande,
Torsten Schaub,
W. Ken Jackson:
Alternative Approaches to Default Logic.
Artif. Intell. 70(1-2): 167-237 (1994) |
| 7 | | Philippe Besnard,
Torsten Schaub:
Possible Worlds Semantics for Default Logics.
Fundam. Inform. 21(1/2): 39-66 (1994) |
| 1993 |
|---|
| 6 | | Antje Beringer,
Torsten Schaub:
Minimal Belief and Negation as Failure: A Feasible Approach.
AAAI 1993: 400-405 |
| 5 | | Philippe Besnard,
Torsten Schaub:
A Context-Based Framework for Default Logics.
AAAI 1993: 406-411 |
| 4 | | Torsten Schaub:
Variations of Constrained Default Logic.
ECSQARU 1993: 310-317 |
| 1992 |
|---|
| 3 | | Torsten Schaub:
On Constrained Default Theories.
ECAI 1992: 304-308 |
| 1991 |
|---|
| 2 | | Torsten Schaub:
On Commitment and Cumulativity in Default Logics.
ECSQARU 1991: 305-309 |
| 1 | | Torsten Schaub:
Assertional Default Theories: A Semantical View.
KR 1991: 496-506 |
