Theodor Lettmann

According to our database, Theodor Lettmann authored at least 17 papers between 1986 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

Planning with Independent Task Networks.

Felix Mohr, Theo Lettmann, Eyke Hüllermeier

Proceedings of the KI 2017: Advances in Artificial Intelligence, 2017

2013

Reducing Nondeterminism in Automated Service Composition.

Felix Mohr, Theodor Lettmann, Hans Kleine Büning

Proceedings of the 2013 IEEE 6th International Conference on Service-Oriented Computing and Applications, 2013

2012

Paderborn Genre Analysis Corpus 2012 (PaGA-12).

Michael Baumann, Theodor Lettmann, Benno Stein

Dataset, January, 2012

2011

Modeling Agents and Agent Systems.

Theodor Lettmann, Michael Baumann, Markus Eberling, Thomas Kemmerich

Trans. Comput. Collect. Intell., 2011

2006

Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT.

Benno Stein, Oliver Niggemann, Theodor Lettmann

Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2006

1999

Resolution Remains Hard Under Equivalence.

Hans Kleine Büning, Theodor Lettmann

Discret. Appl. Math., 1999

Propositional logic - deduction and algorithms.

Hans Kleine Büning, Theodor Lettmann

Cambridge tracts in theoretical computer science 48, Cambridge University Press, ISBN: 978-0-521-63017-7, 1999

1996

Learning a Representation for Optimizable Formulas.

Hans Kleine Büning, Theodor Lettmann

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1994

Aussagenlogik - Deduktion und Algorithmen.

Hans Kleine Büning, Theodor Lettmann

Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02133-9, 1994

1993

On the Restricted Equivalence Subclasses of Propositional Logic.

Andreas Flögel, Hans Kleine Büning, Theodor Lettmann

RAIRO Theor. Informatics Appl., 1993

1991

ILFA Interface Concept

Bernd I. Dahn, Theodor Lettmann, Wolfgang Schönfeld

IWBS Report, 1991

1989

Projections of Vector Addition System Reachability Sets are Semilinear.

Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr

Theor. Comput. Sci., 1989

1988

First-Order Formulas in Conjunctive Quantificational Form.

Hans Kleine Büning, Theodor Lettmann

Math. Log. Q., 1988

1987

Erfüllbarkeitsalgorithmen und die Problematik ihrer Realisierung in einem System zur Logikverarbeitung.

Theodor Lettmann

PhD thesis, 1987

Perspektiven für die Logikprogrammierung.

Hans Kleine Büning, Theodor Lettmann

Proceedings of the Wissensrepräsentation in Expertensystemen, 1987

Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.

Hans Kleine Büning, Theodor Lettmann

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

Classes of First Order Formulas Under Various Satisfiability Definitions.

Hans Kleine Büning, Theodor Lettmann

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986