International Center for Computational Logic - Benutzerbeiträge [de]

QuantLA

2015-03-18T13:26:32Z

Aaron Stephan:

{{Projekt
|Kurzname=QuantLA
|Name=Quantitative Logics and Automata
|Name EN=Quantitative Logics and Automata
|Beschreibung EN=Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.

The aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.

The planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists — in addition to the weekly research seminar — of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
|Kontaktperson=Franz Baader
|URL=http://lat.inf.tu-dresden.de/quantla/
|Start=2013/01/22
|Projektstatus=aktiv
|Logo=quantla-logo.png
|Person=Daniel Borchmann, Sascha Wundelich, Vitaly Perevoshchikov, Oliver Fernandez Gil, Parvaneh Babari Ghorghi, Shiguang Feng, Andreas Ecke, David Müller, Ignasi Abio Roig , Claudia Carapelle
|Forschungsgruppe=Automatentheorie
|Partner=Universität Leipzig
}}

EMCL/en

2015-03-18T13:26:04Z

Aaron Stephan: Page created automatically by parser function on page EMCL

EMCL

2015-03-18T13:26:03Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Projekt |Kurzname=EMCL |Name EN= European Master's Program in Computational Logic |Beschreibung EN=The objective of the European Master's Program in Computa…“

{{Projekt
|Kurzname=EMCL
|Name EN= European Master's Program in Computational Logic
|Beschreibung EN=The objective of the European Master's Program in Computational Logic is to impart to the students a thorough education comprising both the theoretical and practical knowledge required for professional practive in Computational Logic, to give him a profound insight into the various disciplines of Computational Logic and to strengthen his ability to work according to scientific methods.
|Kontaktperson=Steffen Hölldobler
|Start=2011/10/01
|Ende=2016/09/30
|Finanziert von=The European Union (EU), Erasmus Mundus
|Projektstatus=aktiv
|Forschungsgruppe=Wissensverarbeitung
}}

QuantLA

2015-03-18T13:19:26Z

Aaron Stephan:

{{Projekt
|Kurzname=QuantLA
|Name=Quantitative Logics and Automata
|Name EN=Quantitative Logics and Automata
|Beschreibung EN=Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.

The aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.

The planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists — in addition to the weekly research seminar — of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
|Kontaktperson=Prof. Dr.-Ing. Franz Baader
|URL=http://lat.inf.tu-dresden.de/quantla/
|Start=2013/01/22
|Projektstatus=aktiv
|Logo=quantla-logo.png
|Person=Daniel Borchmann, Sascha Wundelich, Vitaly Perevoshchikov, Oliver Fernandez Gil, Parvaneh Babari Ghorghi, Shiguang Feng, Andreas Ecke, David Müller, Ignasi Abio Roig , Claudia Carapelle
|Forschungsgruppe=Automatentheorie
|Partner=Universität Leipzig
}}

QuantLA/en

2015-03-18T13:17:53Z

Aaron Stephan: Page created automatically by parser function on page QuantLA

QuantLA

2015-03-18T13:17:52Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Projekt |Kurzname=QuantLA |Name EN=Quantitative Logics and Automata |Beschreibung EN=Both automata and logics are employed as modelling approaches in Comput…“

{{Projekt
|Kurzname=QuantLA
|Name EN=Quantitative Logics and Automata
|Beschreibung EN=Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.

The aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.

The planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists — in addition to the weekly research seminar — of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.
|Kontaktperson=Prof. Dr.-Ing. Franz Baader
|URL=http://lat.inf.tu-dresden.de/quantla/
|Start=2013/01/22
|Projektstatus=aktiv
|Logo=quantla-logo.png
|Person=Daniel Borchmann, Sascha Wundelich, Vitaly Perevoshchikov, Oliver Fernandez Gil, Parvaneh Babari Ghorghi, Shiguang Feng, Andreas Ecke, David Müller, Ignasi Abio Roig , Claudia Carapelle
|Forschungsgruppe=Automatentheorie
|Partner=Universität Leipzig
}}

Riss

2015-03-18T13:15:24Z

Aaron Stephan:

{{DataOrTool
|name=Riss - including Pcasso and Priss
|short description EN=SAT Solver -- a programm that solves the satisfiability testing problem
|short description DE=SAT Solver - ein Programm, welches das Erfüllbarkeitsproblem löst
|contact persons=Norbert Manthey
|contributors=Norbert Manthey, Kilian Gebhardt, Aaron Stephan, Lucas Kalert, Franziska Krüger,
|link=http://tools.computational-logic.org
|publication date=2012/07/01
|long description EN=Riss is a SAT solver (package) that is based on MiniSat 2.2 and Glucose 2.2 and uses the conflict driven clause learning algorithm. It furthermore includes the formula simplification tool Coprocessor, which can be used to simplify the formula before search, as well as during search. Riss includes many search algorithm extensions, and currently (2014) has about 500 parameters. Another feature of Riss is that it can emit unsatisfiability proofs in the DRAT format for almost all implemented techniques. These proofs can also be verified online while solving the actual problem.

The Riss framework furthermore includes a CNF formula feature extraction tool, so that equipped with a machine learning tool, a configuration of Riss can be chosen on a formula basis. Furthermore, there is the parallel portfolio solver Priss, which is also able to produce unsatisfiability proofs while respecting shared clauses.

Another parallel solving algorithm is included, iterative partitionin. The related system is called Pcasso. Instead of running multiple configurations of a solver on a single formula, Pcasso partitions the search space of the formula, an assigns solvers to each partition, as well as to the original formula. If there are idle resources, partitions are re-partitioned recursively. Furthermore, Pcasso does allow clause sharing. Inprocessing is currently not supported, but will be added in the near furture.
|long description DE=Riss ist ein SAT Solver (Softwarepaket), welches auf MiniSat 2.2 und Glucose 2.2 basiert, und welches the conflict driven clause learning Algorithmus verwended. Riss beherbergt außerdem den Formelvereinfacher Coprocessor, der Formeln vor, und während, der Suche bearbeiten kann. Riss schließt viele Suchalgorithmuserweiterungen ein, und enthält im Moment (2014) circa 500 Parameter. Während der Suche kann Riss einen Unerfüllbarkeitsbeweis im DRAT-Format generieren, sodass sowohl Antworten für erfüllbare, als auch für unerfüllbare Probleme überprüft werden können. Diese Beweise können auch schon während der Suche überprüft werden.

Das Softwarepaket enthält außerdem ein Werkzeug, welches Features der CNF-Formel extrahieren kann, sodass zusammen mit einem Machine-Learning Werkzeug eine Konfiguration für Riss basierend auf der gegebenen Formel ausgewählt werden kann. Weiterhin ist der paralleler Portfolio-Solver Priss enthalten, welcher auch Unerfüllbarkeitsbeweise während der parallelen Suche ausgeben kann, wobei geteilte Klauseln berücksichtigt werden.

Ein weitere paralleler Lösungsansatz ist enthalten, Iterative Partitioning. Das dazugehörige System pcasso lässt nicht mehrere Solver auf der Formel laufen, sondern unterteilt den Suchraum des Problems in Partitionen, und weist anschließend jeder Partition einen sequentiellen Solver zu. Zusätzlich wird die originale Formel gelöst. Wenn weitere Resourcen zur Verfügung stehen, werden die Partitinoen ihrerseite wieder unterteilt und parallel zu den anderen Partitionen gelöst. Pcasso kann außerdem gelernte Klauseln teilen. Formelvereinfachung während der Suche werden im Moment nicht unterstützt.
|Forschungsgruppe=Wissensverarbeitung
|dataOrTool=Tool
|Projektstatus=aktiv
}}

Riss

2015-03-18T13:14:07Z

Aaron Stephan:

{{DataOrTool
|name=Riss - including Pcasso and Priss
|short description EN=SAT Solver -- a programm that solves the satisfiability testing problem
|short description DE=SAT Solver - ein Programm, welches das Erfüllbarkeitsproblem löst
|contact persons=Norbert Manthey
|contributors=Norbert Manthey , Kilian Gebhardt, Aaron Stephan, Lucas Kalert, Franziska Krüger
|link=http://tools.computational-logic.org
|publication date=2012/07/01
|long description EN=Riss is a SAT solver (package) that is based on MiniSat 2.2 and Glucose 2.2 and uses the conflict driven clause learning algorithm. It furthermore includes the formula simplification tool Coprocessor, which can be used to simplify the formula before search, as well as during search. Riss includes many search algorithm extensions, and currently (2014) has about 500 parameters. Another feature of Riss is that it can emit unsatisfiability proofs in the DRAT format for almost all implemented techniques. These proofs can also be verified online while solving the actual problem.

The Riss framework furthermore includes a CNF formula feature extraction tool, so that equipped with a machine learning tool, a configuration of Riss can be chosen on a formula basis. Furthermore, there is the parallel portfolio solver Priss, which is also able to produce unsatisfiability proofs while respecting shared clauses.

Another parallel solving algorithm is included, iterative partitionin. The related system is called Pcasso. Instead of running multiple configurations of a solver on a single formula, Pcasso partitions the search space of the formula, an assigns solvers to each partition, as well as to the original formula. If there are idle resources, partitions are re-partitioned recursively. Furthermore, Pcasso does allow clause sharing. Inprocessing is currently not supported, but will be added in the near furture.
|long description DE=Riss ist ein SAT Solver (Softwarepaket), welches auf MiniSat 2.2 und Glucose 2.2 basiert, und welches the conflict driven clause learning Algorithmus verwended. Riss beherbergt außerdem den Formelvereinfacher Coprocessor, der Formeln vor, und während, der Suche bearbeiten kann. Riss schließt viele Suchalgorithmuserweiterungen ein, und enthält im Moment (2014) circa 500 Parameter. Während der Suche kann Riss einen Unerfüllbarkeitsbeweis im DRAT-Format generieren, sodass sowohl Antworten für erfüllbare, als auch für unerfüllbare Probleme überprüft werden können. Diese Beweise können auch schon während der Suche überprüft werden.

Das Softwarepaket enthält außerdem ein Werkzeug, welches Features der CNF-Formel extrahieren kann, sodass zusammen mit einem Machine-Learning Werkzeug eine Konfiguration für Riss basierend auf der gegebenen Formel ausgewählt werden kann. Weiterhin ist der paralleler Portfolio-Solver Priss enthalten, welcher auch Unerfüllbarkeitsbeweise während der parallelen Suche ausgeben kann, wobei geteilte Klauseln berücksichtigt werden.

Ein weitere paralleler Lösungsansatz ist enthalten, Iterative Partitioning. Das dazugehörige System pcasso lässt nicht mehrere Solver auf der Formel laufen, sondern unterteilt den Suchraum des Problems in Partitionen, und weist anschließend jeder Partition einen sequentiellen Solver zu. Zusätzlich wird die originale Formel gelöst. Wenn weitere Resourcen zur Verfügung stehen, werden die Partitinoen ihrerseite wieder unterteilt und parallel zu den anderen Partitionen gelöst. Pcasso kann außerdem gelernte Klauseln teilen. Formelvereinfachung während der Suche werden im Moment nicht unterstützt.
|Forschungsgruppe=Wissensverarbeitung
|dataOrTool=Tool
|Projektstatus=aktiv
}}

Datei:Quantla-logo.png

2015-03-18T12:49:23Z

Aaron Stephan: http://lat.inf.tu-dresden.de/quantla/

http://lat.inf.tu-dresden.de/quantla/

17. WLP - Workshop Logic Programming/en

2015-03-18T11:46:48Z

Aaron Stephan: Page created automatically by parser function on page 17. WLP - Workshop Logic Programming

17. WLP - Workshop Logic Programming

2015-03-18T11:46:47Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=17. WLP - Workshop Logische Programmierung |Titel EN=17. WLP - Workshop Logic Programming |Beschreibung DE=Logische Programmierung i…“

{{Veranstaltung
|Titel DE=17. WLP - Workshop Logische Programmierung
|Titel EN=17. WLP - Workshop Logic Programming
|Beschreibung DE=Logische Programmierung ist eine besonders weitgehende Art, Probleme deklarativ zu spezifizieren. In der Form von Prolog geschieht das durch den Einsatz eines Fragments der Logik. Weitergehende Konzepte integrieren in dieses ursprünglich rein relationale Konzept auch Funktionen und Constraints. In den vergangenen Jahren hat dieses Paradigma eine hohe Attraktivität erworben, u.a. in den Bereichen Datenbanken und Verarbeitung von natürlicher Sprache und bei der Modellierung und Bearbeitung komplexer kombinatorischer Probleme. Die Logikprogrammierung ist somit ein aktives Gebiet geblieben, das sich zunehmend auch den schwierigen Thematiken der Integration in die übrige Softwarelandschaft, der Behandlung von Dynamik und des Umgangs mit Kommunikation stellt.
|Veranstaltungsart=Vortrag
|Start=2002/12/11 09:00:00
|Ende=2002/12/13 16:00:00
|URL=http://www.computational-logic.org/iccl/events/WLP-2002/
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

Deep Inference Christmas Meeting 2007/en

2015-03-18T11:32:35Z

Aaron Stephan: Page created automatically by parser function on page Deep Inference Christmas Meeting 2007

Deep Inference Christmas Meeting 2007

2015-03-18T11:32:35Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Deep Inference Christmas Meeting 2007 |Beschreibung EN=The idea of this workshop is to provide an informal atmosphere for discussion…“

{{Veranstaltung
|Titel EN=Deep Inference Christmas Meeting 2007
|Beschreibung EN=The idea of this workshop is to provide an informal atmosphere for discussion on deep inference and related topics. This time, the workshop will be held in Dresden, the city where deep inference was born.

Past events were held in Dresden in November 2003, in September 2004, in February 2005, in December 2005, in Lisbon in 2005, in Bath in July 2006, in Paris in December 2006, and in Palaiseau in June 2007.

This meeting comes with a goody: There will be an introductory mini-course (5 x 90min) on deep inference for the local Master's students held from Dec 17 to Dec 22 by Paola Bruscoli and Lutz Straßburger.
|Veranstaltungsart=Konferenz
|Start=2007/12/19 09:00:00
|Ende=2007/12/19 16:00:00
|URL=http://www.lix.polytechnique.fr/~lutz/orgs/DIworkshop-DD-Dec2007.html
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

The 21st International Workshop on Description Logics 2008/en

2015-03-18T11:29:41Z

Aaron Stephan: Page created automatically by parser function on page The 21st International Workshop on Description Logics 2008

The 21st International Workshop on Description Logics 2008

2015-03-18T11:29:41Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=The 21st International Workshop on Description Logics 2008 |Beschreibung EN=The DL workshop is the major annual event of the descript…“

{{Veranstaltung
|Titel EN=The 21st International Workshop on Description Logics 2008
|Beschreibung EN=The DL workshop is the major annual event of the description logic
research community. The workshop is thought as a gathering forum to
meet, discuss and exchange experiences among all those, both in the
academia and industry, who are interested in description logics and
their applications.
|Veranstaltungsart=Konferenz
|Start=2008/05/13 10:00:00
|Ende=2008/05/16 18:00:00
|URL=http://dl.kr.org/dl2008/?id=25
|Forschungsgruppe=Automatentheorie
|In News anzeigen=1
}}

9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)/en

2015-03-18T11:22:25Z

Aaron Stephan: Page created automatically by parser function on page 9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)

9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)

2015-03-18T11:22:25Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA) |Beschreibung EN=Multi-Agent Systems are communities…“

{{Veranstaltung
|Titel EN=9th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA)
|Beschreibung EN=Multi-Agent Systems are communities of problem-solving entities that can perceive and act upon their environment in order to achieve both their individual goals and their joint goals. The work on such systems integrates many technologies and concepts from artificial intelligence and other areas of computing as well as other disciplines. Over recent years, the agent paradigm gained popularity, due to its applicability to a full spectrum of domains, such as search engines, recommendation systems, educational support, e-procurement, simulation and routing, electronic commerce and trade, etc. Computational logic provides a well-defined, general, and rigorous framework for studying the syntax, semantics and procedures for the various tasks in individual agents, as well as the interaction between, and integration amongst, agents in multi-agent systems. It also provides tools, techniques and standards for implementations and environments, for linking specifications to implementations, and for the verification of properties of individual agents, multi-agent systems and their implementations.
|Veranstaltungsart=Konferenz
|Start=2008/09/29 09:00:00
|Ende=2008/09/30 13:00:00
|URL=http://cgi.csc.liv.ac.uk/~michael/clima08.html
|Forschungsgruppe=Computational Logic
|In News anzeigen=1
}}

22nd Workshop on (Constraint) Logic Programming 2008/en

2015-03-18T11:16:32Z

Aaron Stephan: Page created automatically by parser function on page 22nd Workshop on (Constraint) Logic Programming 2008

22nd Workshop on (Constraint) Logic Programming 2008

2015-03-18T11:16:32Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=22nd Workshop on (Constraint) Logic Programming 2008 |Beschreibung EN=The workshops on (constraint) logic programming are the annual…“

{{Veranstaltung
|Titel EN=22nd Workshop on (Constraint) Logic Programming 2008
|Beschreibung EN=The workshops on (constraint) logic programming are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria and Switzerland. The technical program of the workshop will include invited talks, presentations of refereed papers and demo presentations.
|Veranstaltungsart=Konferenz
|Start=2008/09/30 10:00:00
|Ende=2008/10/01 18:00:00
|URL=http://nirvana.informatik.uni-halle.de/~schwarz/wlp2008/
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

EMCL Student Workshop Summer 2010/en

2015-03-18T11:13:04Z

Aaron Stephan: Page created automatically by parser function on page EMCL Student Workshop Summer 2010

EMCL Student Workshop Summer 2010

2015-03-18T11:13:03Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=EMCL Student Workshop Summer 2010 |Beschreibung EN=This student workshop will be held in Dresden, Germany on 9/10 September 2010. It…“

{{Veranstaltung
|Titel EN=EMCL Student Workshop Summer 2010
|Beschreibung EN=This student workshop will be held in Dresden, Germany on 9/10 September 2010. It is organized by the International Center of Computational Logic (ICCL).

The workshop is co-located with the ICCL Summer School 2010 on Cognitive Science, Computational Logic and Connectionism. Those, who'd like to participate in both events, please note that there is no overlap of summer school courses and workshop presentations.

For questions related to the workshop, please contact Mr Fareed Arif.
|Veranstaltungsart=Konferenz
|Start=2010/09/09 09:30:00
|Ende=2010/09/10 18:00:00
|URL=https://emcl-study.eu/emclws_ss10.html
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

EPCL PhD Workshop 2012/en

2015-03-18T11:10:50Z

Aaron Stephan: Page created automatically by parser function on page EPCL PhD Workshop 2012

EPCL PhD Workshop 2012

2015-03-18T11:10:50Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=EPCL PhD Workshop 2012 |Beschreibung EN=During the PhD workshop, members of each doctoral candidate's advisory board will be present…“

{{Veranstaltung
|Titel EN=EPCL PhD Workshop 2012
|Beschreibung EN=During the PhD workshop, members of each doctoral candidate's advisory board will be present to discuss, refine and, if needed, readjust the PhD projects. Other doctoral candidates, researches from the partner universities as well as staff from the associated partners may attend the PhD workshop.

The participation in the PhD workshop shall enhance the doctoral candidates' skills to define, implement, and successfully complete a research project. The PhD workshop is organized by the doctoral candidates themselves, thus developing and enhancing their skills to plan, organize, and run scientific events.
|Veranstaltungsart=Konferenz
|Start=2012/07/11 10:00:00
|Ende=2012/07/13 18:00:00
|URL=http://www.epcl-study.eu/content/phdws12/
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

EPCL PhD Workshop/en

2015-03-18T11:04:00Z

Aaron Stephan: Page created automatically by parser function on page EPCL PhD Workshop

EPCL PhD Workshop

2015-03-18T11:03:59Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=EPCL PhD Workshop |Beschreibung EN=During the PhD workshop, members of each doctoral candidate's advisory board will be present to di…“

{{Veranstaltung
|Titel EN=EPCL PhD Workshop
|Beschreibung EN=During the PhD workshop, members of each doctoral candidate's advisory board will be present to discuss, refine and, if needed, readjust the PhD projects. Other doctoral candidates, researches from the partner universities as well as staff from the associated partners may attend the PhD workshop.

The participation in the PhD workshop shall enhance the doctoral candidates' skills to define, implement, and successfully complete a research project. The PhD workshop is organized by the doctoral candidates themselves, thus developing and enhancing their skills to plan, organize, and run scientific events.
|Veranstaltungsart=Konferenz
|Start=2013/07/01 10:00:00
|Ende=2013/07/03 18:00:00
|URL=http://www.epcl-study.eu/content/phdws13/
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

EPCL PhD Workshop 2014/en

2015-03-18T09:10:08Z

Aaron Stephan: Page created automatically by parser function on page EPCL PhD Workshop 2014

EPCL PhD Workshop 2014

2015-03-18T09:10:08Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=EPCL PhD Workshop 2014 |Beschreibung EN=The European PhD program in Computational Logic (EPCL) workshop is an annual workshop where l…“

{{Veranstaltung
|Titel EN=EPCL PhD Workshop 2014
|Beschreibung EN=The European PhD program in Computational Logic (EPCL) workshop is an annual workshop where lecturers from the partner universities (FUB, TUD, TUW, UNL) within EPCL as well as some guest researcher are invited to give research talks. In addition, the EPCL students present the progress in their thesis research.
|Veranstaltungsart=Konferenz
|Start=2014/04/14 10:00:00
|Ende=2014/04/17 18:00:00
|URL=https://sites.google.com/site/epclworkshop2014/
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=0
}}

Wissensverarbeitung

2015-03-17T16:28:36Z

Aaron Stephan:

{{Forschungsgruppe
|Name EN=Knowledge Representation and Reasoning
|Kurzname=KRR
|Beschreibung DE=Die Professur Wissensverarbeitung untergliedert sich gegenwärtig in zwei Schwerpunkte: menschliches Schließen in Logikprogramme abzubilden, und das Erfüllbarkeitsproblem und damit verwandte Probleme maschinell zu lösen. Auf beiden Gebieten wird sowohl aktiv geforscht, als auch Lehre mit aktuellsten Inhalten gehalten.
|Beschreibung EN=The Knowledge Representation and Reasoning group has two major parts: human reasoning and solving the satisfiability testing and related decision and discrete optimization problems. In both areas we focus on research, and on the other hand teach with most recent reseach results.
|Forschungsgruppenleiter=Steffen Hölldobler
|Bild=Kiwv-group-picture.jpg
|Ehemalige Forschungsgruppe=0
}}

ICCL Summer School 2005/en

2015-03-17T15:46:21Z

Aaron Stephan: Page created automatically by parser function on page ICCL Summer School 2005

ICCL Summer School 2005

2015-03-17T15:46:21Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=ICCL Summer School 2005 |Beschreibung EN=Logic-based Knowledge Representation (ICCL-SS-2005) TU Dresden, July 2 - 17, 2005 |Verans…“

{{Veranstaltung
|Titel EN=ICCL Summer School 2005
|Beschreibung EN=Logic-based Knowledge Representation (ICCL-SS-2005)
TU Dresden, July 2 - 17, 2005

|Veranstaltungsart=Sommerschule
|Start=2005/07/02 00:00:00
|Ende=2005/07/17 23:59:59
|URL=http://www.computational-logic.org/content/events/iccl-ss-2005/index.php?id=24
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=0
}}

ICCL Summer School 2006/en

2015-03-17T15:44:27Z

Aaron Stephan: Page created automatically by parser function on page ICCL Summer School 2006

ICCL Summer School 2006

2015-03-17T15:44:26Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=ICCL Summer School 2006 |Beschreibung EN=ICCL Summer School 2006: Knowledge Structures (ICCL-SS-2006) TU Dresden, June 24 - July 8,…“

{{Veranstaltung
|Titel EN=ICCL Summer School 2006
|Beschreibung EN=ICCL Summer School 2006: Knowledge Structures (ICCL-SS-2006)
TU Dresden, June 24 - July 8, 2006
|Veranstaltungsart=Sommerschule
|Start=2006/06/24 00:00:00
|Ende=2006/07/08 23:59:59
|URL=http://www.computational-logic.org/content/events/iccl-ss-2006/index.php?id=24
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

ICCL Summer School 2008/en

2015-03-17T15:41:56Z

Aaron Stephan: Page created automatically by parser function on page ICCL Summer School 2008

ICCL Summer School 2008

2015-03-17T15:41:55Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=ICCL Summer School 2008 |Beschreibung EN=ICCL Summer School 2008: Computational Logic and Cognitive Science (ICCL-SS-2008) TU Dresde…“

{{Veranstaltung
|Titel EN=ICCL Summer School 2008
|Beschreibung EN=ICCL Summer School 2008: Computational Logic and Cognitive Science (ICCL-SS-2008)
TU Dresden, August 24 - September 6, 2008
|Veranstaltungsart=Sommerschule
|Start=2008/08/24 00:00:00
|Ende=2008/09/06 23:59:59
|URL=http://www.computational-logic.org/content/events/summerschools.php?id=24
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

ICCL Summer School 2010/en

2015-03-17T15:40:16Z

Aaron Stephan: Page created automatically by parser function on page ICCL Summer School 2010

ICCL Summer School 2010

2015-03-17T15:40:16Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=ICCL Summer School 2010 |Beschreibung EN=ICCL Summer School 2010: Cognitive Science, Computational Logic and Connectionism (ICCL-SS-2…“

{{Veranstaltung
|Titel EN=ICCL Summer School 2010
|Beschreibung EN=ICCL Summer School 2010: Cognitive Science, Computational Logic and Connectionism (ICCL-SS-2010)
TU Dresden, August 29 - September 10, 2010
|Veranstaltungsart=Sommerschule
|Start=2010/08/29 00:00:00
|Ende=2010/09/10 23:59:59
|URL=http://www.computational-logic.org/content/events/iccl-ss-2010/index.php?id=24
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

ICCL Summer School 2013: Semantic Web - Ontology Languages and Their Use (ICCL-SS-2013)/en

2015-03-17T15:31:12Z

Aaron Stephan: Page created automatically by parser function on page ICCL Summer School 2013: Semantic Web - Ontology Languages and Their Use (ICCL-SS-2013)

11th European Conference on Logics in Artificial Intelligence (JELIA-2008)/en

2015-03-17T12:34:35Z

Aaron Stephan: Page created automatically by parser function on page 11th European Conference on Logics in Artificial Intelligence (JELIA-2008)

11th European Conference on Logics in Artificial Intelligence (JELIA-2008)

2015-03-17T12:34:34Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=11th European Conference on Logics in Artificial Intelligence (JELIA-2008) |Beschreibung EN=Logics have, for many years, laid claim t…“

{{Veranstaltung
|Titel EN=11th European Conference on Logics in Artificial Intelligence (JELIA-2008)
|Beschreibung EN=Logics have, for many years, laid claim to providing a formal basis for the study and development of applications and systems in Artificial Intelligence. With the depth and maturity of formalisms, methodologies and logic-based systems today, this claim is stronger than ever.

The European Conference on Logics in Artificial Intelligence (or Journées Européennes sur la Logique en Intelligence Artificielle - JELIA) began back in 1988, as a workshop, in response to the need for a European forum for the discussion of emerging work in this field. Since then, JELIA has been organised biennially, with English as official language, and with proceedings published in Springer-Verlag's Lecture Notes in Artificial Intelligence. Previous meetings took place in Roscoff, France (1988), Amsterdam, Netherlands (1990), Berlin, Germany (1992), York, UK (1994), Évora, Portugal (1996), Dagstuhl, Germany (1998), Málaga, Spain (2000), Cosenza, Italy (2002), Lisbon, Portugal (2004), and Liverpool, UK (2006).

The increasing interest in this forum, its international level with growing participation from researchers outside Europe, and the overall technical quality, has turned JELIA into a major biennial forum for the discussion of logic-based approaches to artificial intelligence.
|Veranstaltungsart=Konferenz
|Start=2008/09/28 16:00:00
|Ende=2008/10/01 15:15:00
|URL=http://www.jelia.eu/2008/index.html
|Forschungsgruppe=Wissensverarbeitung
|In News anzeigen=1
}}

International MSc/en

2015-03-17T12:22:51Z

Aaron Stephan: Die Seite wurde geleert.

International MSc/en

2015-03-17T12:18:38Z

Aaron Stephan: Die Seite wurde neu angelegt: „ == == == International MSc Program in Computational Logic == == == Introduction Motivation and Background Course Announcement General Course Program…“

== == == International MSc Program in Computational Logic == == ==

Introduction

Motivation and Background

Course Announcement

General Course Program

Summary of Main Features

Teaching Staff

Further Information

Regulations for the Aptitude Assessment Procedure

Study Prerequisites

How To Apply

Your Stay in Dresden

Frequently Asked Questions

Michael Thielscher

2015-03-17T12:02:32Z

Aaron Stephan:

Michael Thielscher

2015-03-17T12:00:12Z

Aaron Stephan:

{{Mitarbeiter
|Vorname=Michael
|Nachname=Thielscher
|Akademischer Titel=Prof.
|Forschungsgruppe=Computational Logic
|Stellung=Professor
|Ehemaliger=1
|Email=mit@cse.unsw.edu.au
|Bild=Thielscher.jpg
|Info EN=Michael Thielscher received his PhD with distinction from Darmstadt University of Technology. He was awarded a Post Doctoral grant to spend the academic year 1995/96 at the International Computer Science Institute in Berkeley.

In 1997, he joined the faculty of the Computer Science Department of the Technische Universität Dresden.

In 1998, his habilitation thesis was honored with the award for research excellence by the alumni of Darmstadt University of Technology.

He has been a guest researcher at Imperial College in London at the University of Toronto and at the University of New South Wales in Sydney.

His research interests include Cognitive Robotics, simulation and verification of dynamic systems, and applying computational logic to common sense knowledge. He has published over 60 papers and two books.

Although way beyond the ideal age, he still enjoys riding the snow boards.
|Publikationen anzeigen=0
|Abschlussarbeiten anzeigen=0
}}

Michael Thielscher

2015-03-17T11:58:06Z

Aaron Stephan:

Datei:Thielscher.jpg

2015-03-17T11:57:49Z

Aaron Stephan:

Michael Thielscher/en

2015-03-17T11:56:39Z

Aaron Stephan: Page created automatically by parser function on page Michael Thielscher

Michael Thielscher

2015-03-17T11:56:38Z

Aaron Stephan: Die Seite wurde neu angelegt: „{{Mitarbeiter |Vorname=Michael |Nachname=Thielscher |Akademischer Titel=Prof. |Forschungsgruppe=Computational Logic |Stellung=Professor |Ehemaliger=1 |Email=mi…“

{{Mitarbeiter
|Vorname=Michael
|Nachname=Thielscher
|Akademischer Titel=Prof.
|Forschungsgruppe=Computational Logic
|Stellung=Professor
|Ehemaliger=1
|Email=mit@cse.unsw.edu.au
|Info EN=Michael Thielscher received his PhD with distinction from Darmstadt University of Technology. He was awarded a Post Doctoral grant to spend the academic year 1995/96 at the International Computer Science Institute in Berkeley.

In 1997, he joined the faculty of the Computer Science Department of the Technische Universität Dresden.

In 1998, his habilitation thesis was honored with the award for research excellence by the alumni of Darmstadt University of Technology.

He has been a guest researcher at Imperial College in London at the University of Toronto and at the University of New South Wales in Sydney.

His research interests include Cognitive Robotics, simulation and verification of dynamic systems, and applying computational logic to common sense knowledge. He has published over 60 papers and two books.

Although way beyond the ideal age, he still enjoys riding the snow boards.
|Publikationen anzeigen=0
|Abschlussarbeiten anzeigen=0
}}

Aaron Stephan

2015-03-17T09:40:15Z

Aaron Stephan:

{{Mitarbeiter
|Vorname=Aaron
|Nachname=Stephan
|Forschungsgruppe=Wissensverarbeitung
|Stellung=Studentische Hilfskraft
|Ehemaliger=0
|Email=aaron.stephan@tu-dresden.de
|Bild=Aaronstehpan.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}