TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Brüning, Stefan
A1  - Nicolas, Pascal
T1  - XRay : a prolog technology theorem prover for default reasoning: a system description
Y1  - 1996
SN  - 3-540-61511-3
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Gebser, Martin
A1  - Janhunen, Tomi
A1  - Schaub, Torsten H.
T1  - What's a head without a body?
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Brain, Martin
A1  - Faber, Wolfgang
A1  - Maratea, Marco
A1  - Polleres, Axel
A1  - Schaub, Torsten H.
A1  - Schindlauer, Roman
T1  - What should an ASP solver output? : a multiple position paper
Y1  - 2007
ER  - 
TY  - JOUR
A1  - Besnard, Philippe
A1  - Schaub, Torsten H.
T1  - What is a (non-constructive) non-monotone logical system?
Y1  - 2000
SN  - 0304-3975
ER  - 
TY  - JOUR
A1  - Fandinno, Jorge
A1  - Lifschitz, Vladimir
A1  - Lühne, Patrick
A1  - Schaub, Torsten H.
T1  - Verifying tight logic programs with Anthem and Vampire
JF  - Theory and practice of logic programming
N2  - This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
Y1  - 2020
U6  - https://doi.org/10.1017/S1471068420000344
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 5
SP  - 735
EP  - 750
PB  - Cambridge Univ. Press
CY  - Cambridge [u.a.]
ER  - 
TY  - JOUR
A1  - Nicolas, Pascal
A1  - Schaub, Torsten H.
T1  - Un cadre général pour l'interrogation automatique en logiques des défauts
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
T1  - Two approaches to merging knowledge bases
Y1  - 2004
SN  - 3-540-23242-7
ER  - 
TY  - JOUR
A1  - Borchert, P.
A1  - Anger, Christian
A1  - Schaub, Torsten H.
A1  - Truszczynski, M.
T1  - Towards systematic benchmarking in answer set programming : the dagstuhl initiative
Y1  - 2004
SN  - 3-540- 20721-x
ER  - 
TY  - JOUR
A1  - Cabalar, Pedro
A1  - Dieguez, Martin
A1  - Schaub, Torsten H.
A1  - Schuhmann, Anna
T1  - Towards metric temporal answer set programming
JF  - Theory and practice of logic programming
N2  - We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.
Y1  - 2020
U6  - https://doi.org/10.1017/S1471068420000307
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 5
SP  - 783
EP  - 798
PB  - Cambridge Univ. Press
CY  - Cambridge [u.a.]
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Wang, Kewen
T1  - Towards a classification of preference handling approaches in nonmonotonic reasoning
Y1  - 2002
SN  - 1-577-35166-5
ER  -