---
_id: '3327'
author:
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
- first_name: Oliver
  full_name: Niggemann, Oliver
  last_name: Niggemann
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Stein B, Niggemann O, Lettmann T. Speeding Up Model-based Diagnosis by a Heuristic
    Approach to Solving SAT. In: <i>AIA ’06: Proceedings of the 24th IASTED International
    Conference on Artificial Intelligence and Applications</i>. ; 2006:273--278.'
  apa: 'Stein, B., Niggemann, O., &#38; Lettmann, T. (2006). Speeding Up Model-based
    Diagnosis by a Heuristic Approach to Solving SAT. In <i>AIA ’06: Proceedings of
    the 24th IASTED International Conference on Artificial Intelligence and Applications</i>
    (pp. 273--278).'
  bibtex: '@inproceedings{Stein_Niggemann_Lettmann_2006, title={Speeding Up Model-based
    Diagnosis by a Heuristic Approach to Solving SAT}, booktitle={AIA ’06: Proceedings
    of the 24th IASTED International Conference on Artificial Intelligence and Applications},
    author={Stein, Benno and Niggemann, Oliver and Lettmann, Theodor}, year={2006},
    pages={273--278} }'
  chicago: 'Stein, Benno, Oliver Niggemann, and Theodor Lettmann. “Speeding Up Model-Based
    Diagnosis by a Heuristic Approach to Solving SAT.” In <i>AIA ’06: Proceedings
    of the 24th IASTED International Conference on Artificial Intelligence and Applications</i>,
    273--278, 2006.'
  ieee: 'B. Stein, O. Niggemann, and T. Lettmann, “Speeding Up Model-based Diagnosis
    by a Heuristic Approach to Solving SAT,” in <i>AIA ’06: Proceedings of the 24th
    IASTED International Conference on Artificial Intelligence and Applications</i>,
    2006, pp. 273--278.'
  mla: 'Stein, Benno, et al. “Speeding Up Model-Based Diagnosis by a Heuristic Approach
    to Solving SAT.” <i>AIA ’06: Proceedings of the 24th IASTED International Conference
    on Artificial Intelligence and Applications</i>, 2006, pp. 273--278.'
  short: 'B. Stein, O. Niggemann, T. Lettmann, in: AIA ’06: Proceedings of the 24th
    IASTED International Conference on Artificial Intelligence and Applications, 2006,
    pp. 273--278.'
date_created: 2018-06-25T09:06:39Z
date_updated: 2022-01-06T06:59:10Z
language:
- iso: eng
page: 273--278
publication: 'AIA ''06: Proceedings of the 24th IASTED International Conference on
  Artificial Intelligence and Applications'
status: public
title: Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
type: conference
user_id: '315'
year: '2006'
...
---
_id: '19815'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: Kleine Büning H, Lettmann T. Resolution remains hard under equivalence. <i>Discrete
    Applied Mathematics</i>. 1999:139-148. doi:<a href="https://doi.org/10.1016/s0166-218x(99)00055-4">10.1016/s0166-218x(99)00055-4</a>
  apa: Kleine Büning, H., &#38; Lettmann, T. (1999). Resolution remains hard under
    equivalence. <i>Discrete Applied Mathematics</i>, 139–148. <a href="https://doi.org/10.1016/s0166-218x(99)00055-4">https://doi.org/10.1016/s0166-218x(99)00055-4</a>
  bibtex: '@article{Kleine Büning_Lettmann_1999, title={Resolution remains hard under
    equivalence}, DOI={<a href="https://doi.org/10.1016/s0166-218x(99)00055-4">10.1016/s0166-218x(99)00055-4</a>},
    journal={Discrete Applied Mathematics}, author={Kleine Büning, Hans and Lettmann,
    Theodor}, year={1999}, pages={139–148} }'
  chicago: Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under
    Equivalence.” <i>Discrete Applied Mathematics</i>, 1999, 139–48. <a href="https://doi.org/10.1016/s0166-218x(99)00055-4">https://doi.org/10.1016/s0166-218x(99)00055-4</a>.
  ieee: H. Kleine Büning and T. Lettmann, “Resolution remains hard under equivalence,”
    <i>Discrete Applied Mathematics</i>, pp. 139–148, 1999.
  mla: Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.”
    <i>Discrete Applied Mathematics</i>, 1999, pp. 139–48, doi:<a href="https://doi.org/10.1016/s0166-218x(99)00055-4">10.1016/s0166-218x(99)00055-4</a>.
  short: H. Kleine Büning, T. Lettmann, Discrete Applied Mathematics (1999) 139–148.
date_created: 2020-10-01T08:13:12Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1016/s0166-218x(99)00055-4
language:
- iso: eng
page: 139-148
publication: Discrete Applied Mathematics
publication_identifier:
  issn:
  - 0166-218X
publication_status: published
status: public
title: Resolution remains hard under equivalence
type: journal_article
user_id: '315'
year: '1999'
...
---
_id: '3339'
author:
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
citation:
  ama: 'Lettmann T, Kleine Büning H. <i>Propositional Logic : Deduction and Algorithms</i>.
    Cambridge Univ. Press; 1999.'
  apa: 'Lettmann, T., &#38; Kleine Büning, H. (1999). <i>Propositional Logic : Deduction
    and Algorithms</i>. Cambridge Univ. Press.'
  bibtex: '@book{Lettmann_Kleine Büning_1999, series={Cambridge tracts in theoretical
    computer science}, title={Propositional Logic : Deduction and Algorithms}, publisher={Cambridge
    Univ. Press}, author={Lettmann, Theodor and Kleine Büning, Hans}, year={1999},
    collection={Cambridge tracts in theoretical computer science} }'
  chicago: 'Lettmann, Theodor, and Hans Kleine Büning. <i>Propositional Logic : Deduction
    and Algorithms</i>. Cambridge Tracts in Theoretical Computer Science. Cambridge
    Univ. Press, 1999.'
  ieee: 'T. Lettmann and H. Kleine Büning, <i>Propositional Logic : Deduction and
    Algorithms</i>. Cambridge Univ. Press, 1999.'
  mla: 'Lettmann, Theodor, and Hans Kleine Büning. <i>Propositional Logic : Deduction
    and Algorithms</i>. Cambridge Univ. Press, 1999.'
  short: 'T. Lettmann, H. Kleine Büning, Propositional Logic : Deduction and Algorithms,
    Cambridge Univ. Press, 1999.'
date_created: 2018-06-25T10:08:43Z
date_updated: 2022-01-06T06:59:10Z
language:
- iso: eng
publication_identifier:
  isbn:
  - '0521630177'
publication_status: published
publisher: Cambridge Univ. Press
series_title: Cambridge tracts in theoretical computer science
status: public
title: 'Propositional Logic : Deduction and Algorithms'
type: book
user_id: '315'
year: '1999'
...
---
_id: '19816'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Kleine Büning H, Lettmann T. Learning a representation for optimizable formulas.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996. doi:<a
    href="https://doi.org/10.1007/3-540-61863-5_33">10.1007/3-540-61863-5_33</a>'
  apa: Kleine Büning, H., &#38; Lettmann, T. (1996). Learning a representation for
    optimizable formulas. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-61863-5_33">https://doi.org/10.1007/3-540-61863-5_33</a>
  bibtex: '@inbook{Kleine Büning_Lettmann_1996, place={Berlin, Heidelberg}, title={Learning
    a representation for optimizable formulas}, DOI={<a href="https://doi.org/10.1007/3-540-61863-5_33">10.1007/3-540-61863-5_33</a>},
    booktitle={Lecture Notes in Computer Science}, author={Kleine Büning, Hans and
    Lettmann, Theodor}, year={1996} }'
  chicago: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for
    Optimizable Formulas.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg,
    1996. <a href="https://doi.org/10.1007/3-540-61863-5_33">https://doi.org/10.1007/3-540-61863-5_33</a>.
  ieee: H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable
    formulas,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996.
  mla: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable
    Formulas.” <i>Lecture Notes in Computer Science</i>, 1996, doi:<a href="https://doi.org/10.1007/3-540-61863-5_33">10.1007/3-540-61863-5_33</a>.
  short: 'H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin,
    Heidelberg, 1996.'
date_created: 2020-10-01T08:15:08Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1007/3-540-61863-5_33
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540618638'
  - '9783540707196'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Learning a representation for optimizable formulas
type: book_chapter
user_id: '315'
year: '1996'
...
---
_id: '3333'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: Kleine Büning H, Lettmann T. <i>Aussagenlogik - Deduktion und Algorithmen</i>.
    Teubner; 1994. doi:<a href="https://doi.org/10.1007/978-3-322-84809-3">10.1007/978-3-322-84809-3</a>
  apa: Kleine Büning, H., &#38; Lettmann, T. (1994). <i>Aussagenlogik - Deduktion
    und Algorithmen</i>. Teubner. <a href="https://doi.org/10.1007/978-3-322-84809-3">https://doi.org/10.1007/978-3-322-84809-3</a>
  bibtex: '@book{Kleine Büning_Lettmann_1994, series={Leitfäden und Monographien der
    Informatik}, title={Aussagenlogik - Deduktion und Algorithmen}, DOI={<a href="https://doi.org/10.1007/978-3-322-84809-3">10.1007/978-3-322-84809-3</a>},
    publisher={Teubner}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1994},
    collection={Leitfäden und Monographien der Informatik} }'
  chicago: Kleine Büning, Hans, and Theodor Lettmann. <i>Aussagenlogik - Deduktion
    und Algorithmen</i>. Leitfäden und Monographien der Informatik. Teubner, 1994.
    <a href="https://doi.org/10.1007/978-3-322-84809-3">https://doi.org/10.1007/978-3-322-84809-3</a>.
  ieee: H. Kleine Büning and T. Lettmann, <i>Aussagenlogik - Deduktion und Algorithmen</i>.
    Teubner, 1994.
  mla: Kleine Büning, Hans, and Theodor Lettmann. <i>Aussagenlogik - Deduktion und
    Algorithmen</i>. Teubner, 1994, doi:<a href="https://doi.org/10.1007/978-3-322-84809-3">10.1007/978-3-322-84809-3</a>.
  short: H. Kleine Büning, T. Lettmann, Aussagenlogik - Deduktion und Algorithmen,
    Teubner, 1994.
date_created: 2018-06-25T09:25:15Z
date_updated: 2022-01-06T06:59:10Z
doi: 10.1007/978-3-322-84809-3
language:
- iso: ger
publication_identifier:
  isbn:
  - 978-3-519-02133-9
publication_status: published
publisher: Teubner
series_title: Leitfäden und Monographien der Informatik
status: public
title: Aussagenlogik - Deduktion und Algorithmen
type: book
user_id: '315'
year: '1994'
...
---
_id: '19814'
author:
- first_name: A.
  full_name: Flögel, A.
  last_name: Flögel
- first_name: H.
  full_name: Kleine Büning, H.
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: Flögel A, Kleine Büning H, Lettmann T. On the restricted equivalence for subclasses
    of propositional logic. <i>RAIRO - Theoretical Informatics and Applications</i>.
    1993:327-340. doi:<a href="https://doi.org/10.1051/ita/1993270403271">10.1051/ita/1993270403271</a>
  apa: Flögel, A., Kleine Büning, H., &#38; Lettmann, T. (1993). On the restricted
    equivalence for subclasses of propositional logic. <i>RAIRO - Theoretical Informatics
    and Applications</i>, 327–340. <a href="https://doi.org/10.1051/ita/1993270403271">https://doi.org/10.1051/ita/1993270403271</a>
  bibtex: '@article{Flögel_Kleine Büning_Lettmann_1993, title={On the restricted equivalence
    for subclasses of propositional logic}, DOI={<a href="https://doi.org/10.1051/ita/1993270403271">10.1051/ita/1993270403271</a>},
    journal={RAIRO - Theoretical Informatics and Applications}, author={Flögel, A.
    and Kleine Büning, H. and Lettmann, Theodor}, year={1993}, pages={327–340} }'
  chicago: Flögel, A., H. Kleine Büning, and Theodor Lettmann. “On the Restricted
    Equivalence for Subclasses of Propositional Logic.” <i>RAIRO - Theoretical Informatics
    and Applications</i>, 1993, 327–40. <a href="https://doi.org/10.1051/ita/1993270403271">https://doi.org/10.1051/ita/1993270403271</a>.
  ieee: A. Flögel, H. Kleine Büning, and T. Lettmann, “On the restricted equivalence
    for subclasses of propositional logic,” <i>RAIRO - Theoretical Informatics and
    Applications</i>, pp. 327–340, 1993.
  mla: Flögel, A., et al. “On the Restricted Equivalence for Subclasses of Propositional
    Logic.” <i>RAIRO - Theoretical Informatics and Applications</i>, 1993, pp. 327–40,
    doi:<a href="https://doi.org/10.1051/ita/1993270403271">10.1051/ita/1993270403271</a>.
  short: A. Flögel, H. Kleine Büning, T. Lettmann, RAIRO - Theoretical Informatics
    and Applications (1993) 327–340.
date_created: 2020-10-01T08:10:48Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1051/ita/1993270403271
language:
- iso: eng
page: 327-340
publication: RAIRO - Theoretical Informatics and Applications
publication_identifier:
  issn:
  - 0988-3754
  - 1290-385X
publication_status: published
status: public
title: On the restricted equivalence for subclasses of propositional logic
type: journal_article
user_id: '315'
year: '1993'
...
---
_id: '19822'
author:
- first_name: Bernd I.
  full_name: Dahn, Bernd I.
  last_name: Dahn
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
- first_name: Wolfgang
  full_name: Schönfeld, Wolfgang
  last_name: Schönfeld
citation:
  ama: 'Dahn BI, Lettmann T, Schönfeld W. <i>ILFA Interface Concept</i>. Vol 193.
    ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland ; 1991.'
  apa: 'Dahn, B. I., Lettmann, T., &#38; Schönfeld, W. (1991). <i>ILFA Interface Concept</i>
    (Vol. 193). ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland .'
  bibtex: '@book{Dahn_Lettmann_Schönfeld_1991, place={´Heidelberg}, series={IWBS Report},
    title={ILFA Interface Concept}, volume={193}, publisher={Wissenschaftliche Zentrum
    der IBM Deutschland }, author={Dahn, Bernd I. and Lettmann, Theodor and Schönfeld,
    Wolfgang}, year={1991}, collection={IWBS Report} }'
  chicago: 'Dahn, Bernd I., Theodor Lettmann, and Wolfgang Schönfeld. <i>ILFA Interface
    Concept</i>. Vol. 193. IWBS Report. ´Heidelberg: Wissenschaftliche Zentrum der
    IBM Deutschland , 1991.'
  ieee: 'B. I. Dahn, T. Lettmann, and W. Schönfeld, <i>ILFA Interface Concept</i>,
    vol. 193. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.'
  mla: Dahn, Bernd I., et al. <i>ILFA Interface Concept</i>. Vol. 193, Wissenschaftliche
    Zentrum der IBM Deutschland , 1991.
  short: B.I. Dahn, T. Lettmann, W. Schönfeld, ILFA Interface Concept, Wissenschaftliche
    Zentrum der IBM Deutschland , ´Heidelberg, 1991.
date_created: 2020-10-01T09:30:28Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
intvolume: '       193'
language:
- iso: eng
place: ´Heidelberg
publisher: 'Wissenschaftliche Zentrum der IBM Deutschland '
series_title: IWBS Report
status: public
title: ILFA Interface Concept
type: report
user_id: '315'
volume: 193
year: '1991'
...
---
_id: '19818'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
- first_name: Ernst W.
  full_name: Mayr, Ernst W.
  last_name: Mayr
citation:
  ama: Kleine Büning H, Lettmann T, Mayr EW. Projections of vector addition system
    reachability sets are semilinear. <i>Theoretical Computer Science</i>. 1989:343-350.
    doi:<a href="https://doi.org/10.1016/0304-3975(89)90055-8">10.1016/0304-3975(89)90055-8</a>
  apa: Kleine Büning, H., Lettmann, T., &#38; Mayr, E. W. (1989). Projections of vector
    addition system reachability sets are semilinear. <i>Theoretical Computer Science</i>,
    343–350. <a href="https://doi.org/10.1016/0304-3975(89)90055-8">https://doi.org/10.1016/0304-3975(89)90055-8</a>
  bibtex: '@article{Kleine Büning_Lettmann_Mayr_1989, title={Projections of vector
    addition system reachability sets are semilinear}, DOI={<a href="https://doi.org/10.1016/0304-3975(89)90055-8">10.1016/0304-3975(89)90055-8</a>},
    journal={Theoretical Computer Science}, author={Kleine Büning, Hans and Lettmann,
    Theodor and Mayr, Ernst W.}, year={1989}, pages={343–350} }'
  chicago: Kleine Büning, Hans, Theodor Lettmann, and Ernst W. Mayr. “Projections
    of Vector Addition System Reachability Sets Are Semilinear.” <i>Theoretical Computer
    Science</i>, 1989, 343–50. <a href="https://doi.org/10.1016/0304-3975(89)90055-8">https://doi.org/10.1016/0304-3975(89)90055-8</a>.
  ieee: H. Kleine Büning, T. Lettmann, and E. W. Mayr, “Projections of vector addition
    system reachability sets are semilinear,” <i>Theoretical Computer Science</i>,
    pp. 343–350, 1989.
  mla: Kleine Büning, Hans, et al. “Projections of Vector Addition System Reachability
    Sets Are Semilinear.” <i>Theoretical Computer Science</i>, 1989, pp. 343–50, doi:<a
    href="https://doi.org/10.1016/0304-3975(89)90055-8">10.1016/0304-3975(89)90055-8</a>.
  short: H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989)
    343–350.
date_created: 2020-10-01T08:20:05Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1016/0304-3975(89)90055-8
language:
- iso: eng
page: 343-350
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Projections of vector addition system reachability sets are semilinear
type: journal_article
user_id: '315'
year: '1989'
...
---
_id: '19820'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Kleine Büning H, Lettmann T. Perspektiven für die Logikprogrammierung. In:
    Rahmstorf G, ed. <i>Workshop Wissensrepräsentation in Expertensystemen</i>. Berlin,
    Heidelberg; 1988:56-78.'
  apa: Kleine Büning, H., &#38; Lettmann, T. (1988). Perspektiven für die Logikprogrammierung.
    In G. Rahmstorf (Ed.), <i>Workshop Wissensrepräsentation in Expertensystemen</i>
    (pp. 56–78). Berlin, Heidelberg.
  bibtex: '@inproceedings{Kleine Büning_Lettmann_1988, place={Berlin, Heidelberg},
    title={Perspektiven für die Logikprogrammierung}, booktitle={Workshop Wissensrepräsentation
    in Expertensystemen}, author={Kleine Büning, Hans and Lettmann, Theodor}, editor={Rahmstorf,
    G.Editor}, year={1988}, pages={56–78} }'
  chicago: Kleine Büning, Hans, and Theodor Lettmann. “Perspektiven Für Die Logikprogrammierung.”
    In <i>Workshop Wissensrepräsentation in Expertensystemen</i>, edited by G. Rahmstorf,
    56–78. Berlin, Heidelberg, 1988.
  ieee: H. Kleine Büning and T. Lettmann, “Perspektiven für die Logikprogrammierung,”
    in <i>Workshop Wissensrepräsentation in Expertensystemen</i>, 1988, pp. 56–78.
  mla: Kleine Büning, Hans, and Theodor Lettmann. “Perspektiven Für Die Logikprogrammierung.”
    <i>Workshop Wissensrepräsentation in Expertensystemen</i>, edited by G. Rahmstorf,
    1988, pp. 56–78.
  short: 'H. Kleine Büning, T. Lettmann, in: G. Rahmstorf (Ed.), Workshop Wissensrepräsentation
    in Expertensystemen, Berlin, Heidelberg, 1988, pp. 56–78.'
date_created: 2020-10-01T08:58:58Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
editor:
- first_name: G.
  full_name: Rahmstorf, G.
  last_name: Rahmstorf
language:
- iso: eng
page: 56-78
place: Berlin, Heidelberg
publication: Workshop Wissensrepräsentation in Expertensystemen
publication_identifier:
  isbn:
  - '9783540192169'
  - '9783642736414'
  issn:
  - 0343-3005
publication_status: published
status: public
title: Perspektiven für die Logikprogrammierung
type: conference
user_id: '315'
year: '1988'
...
---
_id: '19821'
author:
- first_name: Hans Kleine
  full_name: Büning, Hans Kleine
  last_name: Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Büning HK, Lettmann T. Representation independent query and update operations
    on propositional definite Horn formulas. In: Börger E, ed. <i>Computation Theory
    and Logic</i>. Berlin, Heidelberg; 1987:208-223. doi:<a href="https://doi.org/10.1007/3-540-18170-9_167">10.1007/3-540-18170-9_167</a>'
  apa: Büning, H. K., &#38; Lettmann, T. (1987). Representation independent query
    and update operations on propositional definite Horn formulas. In E. Börger (Ed.),
    <i>Computation Theory and Logic</i> (pp. 208–223). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-18170-9_167">https://doi.org/10.1007/3-540-18170-9_167</a>
  bibtex: '@inbook{Büning_Lettmann_1987, place={Berlin, Heidelberg}, title={Representation
    independent query and update operations on propositional definite Horn formulas},
    DOI={<a href="https://doi.org/10.1007/3-540-18170-9_167">10.1007/3-540-18170-9_167</a>},
    booktitle={Computation Theory and Logic}, author={Büning, Hans Kleine and Lettmann,
    Theodor}, editor={Börger, EgonEditor}, year={1987}, pages={208–223} }'
  chicago: Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent
    Query and Update Operations on Propositional Definite Horn Formulas.” In <i>Computation
    Theory and Logic</i>, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987.
    <a href="https://doi.org/10.1007/3-540-18170-9_167">https://doi.org/10.1007/3-540-18170-9_167</a>.
  ieee: H. K. Büning and T. Lettmann, “Representation independent query and update
    operations on propositional definite Horn formulas,” in <i>Computation Theory
    and Logic</i>, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
  mla: Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query
    and Update Operations on Propositional Definite Horn Formulas.” <i>Computation
    Theory and Logic</i>, edited by Egon Börger, 1987, pp. 208–23, doi:<a href="https://doi.org/10.1007/3-540-18170-9_167">10.1007/3-540-18170-9_167</a>.
  short: 'H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic,
    Berlin, Heidelberg, 1987, pp. 208–223.'
date_created: 2020-10-01T09:08:05Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1007/3-540-18170-9_167
editor:
- first_name: Egon
  full_name: Börger, Egon
  last_name: Börger
language:
- iso: eng
page: 208-223
place: Berlin, Heidelberg
publication: Computation Theory and Logic
publication_identifier:
  isbn:
  - '9783540181705'
  - '9783540477952'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Representation independent query and update operations on propositional definite
  Horn formulas
type: book_chapter
user_id: '315'
year: '1987'
...
---
_id: '19819'
author:
- first_name: H.
  full_name: Kleine Büning, H.
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Kleine Büning H, Lettmann T. Classes of first order formulas under various
    satisfiability definitions. In: <i>8th International Conference on Automated Deduction</i>.
    Berlin, Heidelberg; 1986. doi:<a href="https://doi.org/10.1007/3-540-16780-3_119">10.1007/3-540-16780-3_119</a>'
  apa: Kleine Büning, H., &#38; Lettmann, T. (1986). Classes of first order formulas
    under various satisfiability definitions. In <i>8th International Conference on
    Automated Deduction</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-16780-3_119">https://doi.org/10.1007/3-540-16780-3_119</a>
  bibtex: '@inbook{Kleine Büning_Lettmann_1986, place={Berlin, Heidelberg}, title={Classes
    of first order formulas under various satisfiability definitions}, DOI={<a href="https://doi.org/10.1007/3-540-16780-3_119">10.1007/3-540-16780-3_119</a>},
    booktitle={8th International Conference on Automated Deduction}, author={Kleine
    Büning, H. and Lettmann, Theodor}, year={1986} }'
  chicago: Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas
    under Various Satisfiability Definitions.” In <i>8th International Conference
    on Automated Deduction</i>. Berlin, Heidelberg, 1986. <a href="https://doi.org/10.1007/3-540-16780-3_119">https://doi.org/10.1007/3-540-16780-3_119</a>.
  ieee: H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various
    satisfiability definitions,” in <i>8th International Conference on Automated Deduction</i>,
    Berlin, Heidelberg, 1986.
  mla: Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under
    Various Satisfiability Definitions.” <i>8th International Conference on Automated
    Deduction</i>, 1986, doi:<a href="https://doi.org/10.1007/3-540-16780-3_119">10.1007/3-540-16780-3_119</a>.
  short: 'H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated
    Deduction, Berlin, Heidelberg, 1986.'
date_created: 2020-10-01T08:56:14Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1007/3-540-16780-3_119
language:
- iso: eng
place: Berlin, Heidelberg
publication: 8th International Conference on Automated Deduction
publication_identifier:
  isbn:
  - '9783540167808'
  - '9783540398615'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Classes of first order formulas under various satisfiability definitions
type: book_chapter
user_id: '315'
year: '1986'
...