Conflict-Driven Answer Set Solving: From Theory to Practice∗ Martin Gebser Benjamin Kaufmann Torsten Schaub† Universit¨at Potsdam, Institut f¨ur Informatik,

Source URL: www.cs.uni-potsdam.de

• Logic programming
• Model theory
• Stable model semantics
• Natural deduction
• Pi system

Einladung zur Buchpräsentation What’s next? Art Education Band II Herausgegeben von Torsten Meyer und Gila Kolb, kopaed München, 2015, 400 S.

Source URL: whtsnxt.net

T-DAC / RPi-DAC Collection of schematics, design drafts, block diagrams Torsten Jaekel May 2014

Source URL: www.tjaekel.com

Intersection Graphs of L-Shapes and Segments in the Plane? Stefan Felsner1 , Kolja Knauer2 , George B. Mertzios3 , and Torsten Ueckerdt4 1 Institut f¨

Source URL: page.math.tu-berlin.de

Under consideration for publication in Theory and Practice of Logic Programming 1 Clingo = ASP + Control: Preliminary Report Martin Gebser1,2 , Roland Kaminski2 , Benjamin Kaufmann2 , and Torsten Schaub2 ∗

Source URL: www.cs.uni-potsdam.de

• Logic programming
• Mathematical logic
• Constraint programming
• Logic in computer science
• Programming paradigms
• Satisfiability modulo theories
• Answer set programming
• Stable model semantics
• G-code
• Subroutine
• Analogy
• Algorithm

Using Automated Performance Modeling to Find Scalability Bugs in Complex Codes Alexandru Calotoiu Torsten Hoefler

Source URL: htor.inf.ethz.ch

Cegua Spökhistoria från Costa Rica. En ung man på väg hem från huvudstaden San José stannade till på ett värdshus för att släcka törsten. Han hade tjänat en god slant under sitt besök i staden och bjöd fris

Source URL: www.ungafakta.se

Constraint Answer Set Solving Martin Gebser, Max Ostrowski, and Torsten Schaub? Universit¨at Potsdam, Institut f¨ur Informatik, August-Bebel-Str. 89, DPotsdam Abstract. We present a new approach to integrating C

Source URL: www.cs.uni-potsdam.de

• Theoretical computer science
• Constraint programming
• Declarative programming
• Logic programming
• Mathematics
• Model theory
• Logic in computer science
• NP-complete problems
• Constraint satisfaction problem
• Answer set programming
• Constraint satisfaction
• Satisfiability modulo theories

Three ways to cover a graph Kolja Knauer1? and Torsten Ueckerdt2?? 1 2

Source URL: page.math.tu-berlin.de

1 Potassco: The Potsdam Answer Set Solving Collection Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Schneider

Source URL: www.cs.uni-potsdam.de

• Logic programming
• NP-complete problems
• Operations research
• Constraint programming
• Answer set programming
• Logic in computer science
• Boolean satisfiability problem
• Algorithm
• Solver
• Stable model semantics
• AMPL
• Constraint satisfaction problem