@article{SchaubBrueningNicolas1996,
  author    = {Schaub, Torsten H. and Br{\"u}ning, Stefan and Nicolas, Pascal},
  title     = {XRay : a prolog technology theorem prover for default reasoning: a system description},
  isbn      = {3-540-61511-3},
  year      = {1996},
  language  = {en}
}
@article{AngerGebserJanhunenetal.2006,
  author    = {Anger, Christian and Gebser, Martin and Janhunen, Tomi and Schaub, Torsten H.},
  title     = {What's a head without a body?},
  year      = {2006},
  language  = {en}
}
@article{BrainFaberMarateaetal.2007,
  author    = {Brain, Martin and Faber, Wolfgang and Maratea, Marco and Polleres, Axel and Schaub, Torsten H. and Schindlauer, Roman},
  title     = {What should an ASP solver output? : a multiple position paper},
  year      = {2007},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {What is a (non-constructive) non-monotone logical system?},
  issn      = {0304-3975},
  year      = {2000},
  language  = {en}
}
@article{FandinoLifschitzLuehneetal.2020,
  author    = {Fandi{\~n}o, Jorge and Lifschitz, Vladimir and L{\"u}hne, Patrick and Schaub, Torsten H.},
  title     = {Verifying tight logic programs with Anthem and Vampire},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000344},
  pages     = {735 -- 750},
  year      = {2020},
  abstract  = {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.},
  language  = {en}
}
@misc{NeubauerHaubeltWankoetal.2018,
  author    = {Neubauer, Kai and Haubelt, Christian and Wanko, Philipp and Schaub, Torsten H.},
  title     = {Utilizing quad-trees for efficient design space exploration with partial assignment evaluation},
  series = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  journal   = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-1-5090-0602-1},
  issn      = {2153-6961},
  doi       = {10.1109/ASPDAC.2018.8297362},
  pages     = {434 -- 439},
  year      = {2018},
  abstract  = {Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems.},
  language  = {en}
}
@article{NicolasSchaub1998,
  author    = {Nicolas, Pascal and Schaub, Torsten H.},
  title     = {Un cadre g{\´e}n{\´e}ral pour l'interrogation automatique en logiques des d{\´e}fauts},
  year      = {1998},
  language  = {fr}
}
@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Two approaches to merging knowledge bases},
  isbn      = {3-540-23242-7},
  year      = {2004},
  language  = {en}
}
@article{BorchertAngerSchaubetal.2004,
  author    = {Borchert, P. and Anger, Christian and Schaub, Torsten H. and Truszczynski, M.},
  title     = {Towards systematic benchmarking in answer set programming : the dagstuhl initiative},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{CabalarDieguezSchaubetal.2020,
  author    = {Cabalar, Pedro and Dieguez, Martin and Schaub, Torsten H. and Schuhmann, Anna},
  title     = {Towards metric temporal answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000307},
  pages     = {783 -- 798},
  year      = {2020},
  abstract  = {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.},
  language  = {en}
}