Theodor Lettmann

According to our database1, Theodor Lettmann authored at least 16 papers between 1986 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Planning with Independent Task Networks.
Proceedings of the KI 2017: Advances in Artificial Intelligence, 2017

2013
Reducing Nondeterminism in Automated Service Composition.
Proceedings of the 2013 IEEE 6th International Conference on Service-Oriented Computing and Applications, 2013

2011
Modeling Agents and Agent Systems.
Trans. Computational Collective Intelligence, 2011

2006
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2006

1999
Resolution Remains Hard Under Equivalence.
Discrete Applied Mathematics, 1999

Propositional logic - deduction and algorithms.
Cambridge tracts in theoretical computer science 48, Cambridge University Press, ISBN: 978-0-521-63017-7, 1999

1996
Learning a Representation for Optimizable Formulas.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

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

1993
On the Restricted Equivalence Subclasses of Propositional Logic.
ITA, 1993

1991
ILFA Interface Concept
IWBS Report, 1991

1989
Projections of Vector Addition System Reachability Sets are Semilinear.
Theor. Comput. Sci., 1989

1988
First-Order Formulas in Conjunctive Quantificational Form.
Math. Log. Q., 1988

1987
Erfüllbarkeitsalgorithmen und die Problematik ihrer Realisierung in einem System zur Logikverarbeitung.
PhD thesis, 1987

Perspektiven für die Logikprogrammierung.
Proceedings of the Wissensrepräsentation in Expertensystemen, 1987

Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986
Classes of First Order Formulas Under Various Satisfiability Definitions.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986


  Loading...