News Archive

September 30, 2013: FWF project “Interactive Proof: Proof Translation, Premise Selection, Rewriting” accepted

Cezary Kaliszyk’s project proposal “Interactive Proof: Proof Translation, Premise Selection, Rewriting” has been accepted by the Austrian Science Fund. The project is planned for 3 years and will commence shortly. The volume of the project is EUR 323K.

continue reading ...

August 16, 2013: Benjamin Höller completed his master studies

Today Benjamin Höller successfully defended his master thesis on “Confluence of Rewrite Systems with AC Rules”.

continue reading ...

August 8, 2013: René Thiemann successfully completed his habilitation procedure

After the final presentation of his habilitation thesis on July 4, today René Thiemann was officially authorized to teach the subject “computer science”.

continue reading ...

May 14, 2013: FWF project “Automated Complexity Analysis via Transformations” accepted

Georg Moser’s project proposal on “Automated Complexity Analysis via Transformations” was accepted by the Austrian Science Fund (FWF) and has a duration of 3 years. The volume of the project is EUR 400K.

continue reading ...

March 28, 2013: Julian Nagele completed his master studies

Today Julian Nagele successfully defended his master thesis on higher-order termination.

continue reading ...

March 21, 2013: Sarah Winkler passed her final examination

Today MSc Sarah Winkler passed the rigorosum (cum laude) to obtain her doctorate degree.

continue reading ...

December 3, 2012: Thomas Sternagel completed his master studies

Thomas Sternagel successfully defended his master thesis on “Automatic Proofs in Equational Logic”.

continue reading ...

CL @ BeSt^3

CL will actively participate at this year’s BeSt3 by providing logic puzzles software and personal guidance by master students and senior researchers.

continue reading ...

Computation with Bounded Resources

CL proudly presents its research group on Computation with Bounded Resources. The group is concerned with fundamental questions on computations with limited resources.

continue reading ...

September 16, 2012: CL @ Brückenkurs

As part of the Brückenkurs, a new initiative to provide additional tutoring to freshmen, Harald Zankl gives a course on formal concepts.

continue reading ...

September 4, 2012: CL welcomes Benjamin Winder as new member

Benjamin is our new system administrator. He joined us on September 4, 2012.

continue reading ...

August 23, 2012: Friedrich Neurauter passed his final examination

DI Friedrich Neurauter passed his rigorosum (cum laude) and will soon be officially honoured with his doctorate.

continue reading ...

June 15, 2012: CL welcomes Cynthia Kop as new member

Cynthia Kop joined the CL group on June 15.

continue reading ...

April 28, 2012: Logic Puzzles @ Tiroler Forschungsnacht

The Computational Logic group showed how computers can solve logic puzzles such as Sudoku at the Tiroler Forschungsnacht.

continue reading ...

April 27, 2012: Andreas Schnabl passed his final examination

Today DI Andreas Schnabl passed his rigorosum (cum laude) and will soon be officially honoured with his doctorate.

continue reading ...

FWF-JSPS Joint Project Austria-Japan Accepted (March 20, 2012)

The project “Constrained Rewriting and SMT: Emerging Trends in Rewriting”, funded by Austrian Science Fund (FWF) and the Japan Society for Promotion of Science (JSPS) has been accepted. The project is a joint project between Austria and Japan. It is planned for 3 years and will commence shortly. The volume of the project is EUR 463K.

continue reading ...

CL welcomes its new member: Cezary Kaliszyk (February 1, 2012)

Dr. Cezary Kaliszyk is an expert on interactive theorem proving and joins us from the renowned University of Tsukuba, Japan.

continue reading ...

Award of the Hypo Tirol Bank 2011 (December 22, 2011)

The project “The Word Problem in Equational Logic” led by Dr. Harald Zankl is supported by the “Hypo Bank Tirol Forschungsförderungspreis 2011”.

continue reading ...

2nd Kick-Off Meeting STRUCTURAL (October 21, 2011)

From October 26 — 28 the Computational Logic group hosts the
2nd kick-off meeting of the STRUCTURAL project.

continue reading ...

Memorandum of Understanding (September 5, 2011)

Early September the University of Innsbruck and the Japan Advanced Institute of Science and Technology have signed a memorandum of understanding that eases international cooperation.

continue reading ...

Open PostDoc Position (August 3, 2011)

The Computational Logic research group is looking for a postdoctoral researcher for a 6 year university position.

continue reading ...

FWF “Erwin Schrödinger project” accepted (June 30, 2011)

Dr. Christian Sternagel receives an Erwin Schrödinger scholarship from the Austrian Academy of Sciences (FWF).

continue reading ...

Homepage Layout (June 8, 2011)

The CL homepage comes with a new layout fitting the summer season.

continue reading ...

E-Learning Project accepted (May 23, 2011)

Proving if two objects are equivalent (modulo some axioms) is the main aim of the new eLearning project led by Dr. Harald Zankl.

continue reading ...

Christian Sternagel passed his final examination (December 17, 2010)

Today DI Christian Sternagel passed his rigorosum (cum laude) and will soon be officially honoured with his doctorate.

continue reading ...

TWF project accepted (December 15, 2010)

The Tyrolean Science Fund (Tiroler Wissenschaftsfond) is funding the project “Solving Non-Linear Arithmetic” led by Dr. Harald Zankl. Solving constraints of non-linear arithmetic is inevitable for many applications in hard- and software verification.

The funding will mainly be used to support a master thesis at the Computational Logic group.

continue reading ...

FWF “Joint Project” accepted (December 6, 2010)

In its last assembly on December 1, the FWF Board accepted the FWF joint project “Structural and Computational Proof Theory” between Austria and France. The Austrian part of the proposal was coordinated by Priv.-Doz. Dr. Georg Moser. The project is about bringing together different aspects and developments in structural proof theory, namely deep inference, the Curry-Howard isomorphism, term rewriting, and Hilbert’s epsilon-calculus.

continue reading ...

Logic Puzzles at BeSt (October 29, 2010)

For the third time the BeSt exhibition informed interested visitors about local and national educational facilities, course offers and universities. In the booth held by the Institute of Computer Science logic puzzles provided by the Computational Logic Group allowed visitors to cast a glance at the fascinating world of logic hidden behind puzzle games.

continue reading ...

Martin Korp passed his final examination (October 22, 2010)

Today DI Martin Korp passed his rigorosum (cum laude) and will soon be officially honoured with his doctorate.

continue reading ...

Forschungspreise der Stiftung Südtiroler Sparkasse (September 15, 2010)

Georg Moser was awarded the „Forschungspreise der Stiftung Südtiroler Sparkasse“ to honour his habilitation thesis “Proof Theory at Work: Complexity Analysis of Term Rewrite Systems”.

continue reading ...

Open PhD position   (28 July, 2010)

The Computational Logic research group is looking for a talented PhD student for a 4 year university position.

continue reading ...

Termination Competition 2010   (20 July, 2010)

The 6th international competition of termination tools is over. Three termination tools and one certifier, developed at our group, participated and all of them won in at least one of several categories.

continue reading ...

SMT-COMP 2010   (19 July 2010)

SMT-COMP 2010 is over. MiniSmt participated in two categories which it dominated.

continue reading ...

FWF project accepted   (28 June 2010)

In its last assembly on June 28, the FWF board accepted Dr. René Thiemann's project proposal "Improving Certifiers for Termination Proofs." Termination is a fundamental property in computer science, since it is essential for verifying the correctness of programs. If a program is terminating, then it always yields a result. There are several automated tools to check for termination. Those tools, however, are horrendously complex pieces of software. Hence, they may contain errors and thus report wrong results. To counteract this problem, recent achievements in automatically certifying such proofs have been made.

continue reading ...

FWF project accepted   (1 March 2010)

In its last assembly on March 1 the FWF board accepted Univ.-Prof. Dr. Aart Middeldorp's project proposal "Confluence: Automation, Certification, Extensions". Confluence is a fundamental property in computer science. If an algorithm has the confluence property then computations have unique results.

continue reading ...

Sarah Winkler receives Doc-fForte scholarship   (26 February 2010)

For her PhD project in the area of automated reasoning, Sarah Winkler was awarded a three year doc-fForte grant by the Austrian Academy of Sciences.

continue reading ...