BibTeX records: Donald W. Loveland

download as .bib file

@article{DBLP:journals/jar/Loveland16,
  author       = {Donald W. Loveland},
  title        = {Mark Stickel: His Earliest Work},
  journal      = {J. Autom. Reason.},
  volume       = {56},
  number       = {2},
  pages        = {99--112},
  year         = {2016},
  url          = {https://doi.org/10.1007/s10817-015-9342-4},
  doi          = {10.1007/S10817-015-9342-4},
  timestamp    = {Wed, 02 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/Loveland16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/LovelandSS16,
  author       = {Donald W. Loveland and
                  Ashish Sabharwal and
                  Bart Selman},
  editor       = {Eugenio G. Omodeo and
                  Alberto Policriti},
  title        = {{DPLL:} The Core of Modern Satisfiability Solvers},
  booktitle    = {Martin Davis on Computability, Computational Logic, and Mathematical
                  Foundations},
  series       = {Outstanding Contributions to Logic},
  volume       = {10},
  pages        = {315--335},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-41842-1\_12},
  doi          = {10.1007/978-3-319-41842-1\_12},
  timestamp    = {Fri, 28 Dec 2018 18:08:32 +0100},
  biburl       = {https://dblp.org/rec/books/sp/16/LovelandSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ngc/LovelandY03,
  author       = {Donald W. Loveland and
                  Adnan H. Yahya},
  title        = {Satchmorebid: Satchmo(Re) with BIDirectional Relevancy},
  journal      = {New Gener. Comput.},
  volume       = {21},
  number       = {3},
  pages        = {177--207},
  year         = {2003},
  url          = {https://doi.org/10.1007/BF03037473},
  doi          = {10.1007/BF03037473},
  timestamp    = {Thu, 14 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ngc/LovelandY03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Loveland00,
  author       = {Donald W. Loveland},
  title        = {Automated deduction: achievements and future directions},
  journal      = {Commun. {ACM}},
  volume       = {43},
  number       = {11es},
  pages        = {10},
  year         = {2000},
  url          = {https://doi.org/10.1145/352515.352529},
  doi          = {10.1145/352515.352529},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/Loveland00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aim/Loveland99,
  author       = {Donald W. Loveland},
  title        = {Automated Deduction: Looking Ahead},
  journal      = {{AI} Mag.},
  volume       = {20},
  number       = {1},
  pages        = {77--98},
  year         = {1999},
  url          = {https://doi.org/10.1609/aimag.v20i1.1442},
  doi          = {10.1609/AIMAG.V20I1.1442},
  timestamp    = {Tue, 25 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aim/Loveland99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/AstrachanL97,
  author       = {Owen L. Astrachan and
                  Donald W. Loveland},
  title        = {The Use of Lemmas in the Model Elimination Procedure},
  journal      = {J. Autom. Reason.},
  volume       = {19},
  number       = {1},
  pages        = {117--141},
  year         = {1997},
  url          = {https://doi.org/10.1023/A:1005770705587},
  doi          = {10.1023/A:1005770705587},
  timestamp    = {Wed, 02 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/AstrachanL97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/ReedL95,
  author       = {David W. Reed and
                  Donald W. Loveland},
  title        = {Near-Horn Prolog and the Ancestry Family of Procedures},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {14},
  number       = {2-4},
  pages        = {225--249},
  year         = {1995},
  url          = {https://doi.org/10.1007/BF01530821},
  doi          = {10.1007/BF01530821},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/ReedL95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/LovelandRW95,
  author       = {Donald W. Loveland and
                  David W. Reed and
                  Debra Sue Wilson},
  title        = {{SATCHMORE:} {SATCHMO} with REIevancy},
  journal      = {J. Autom. Reason.},
  volume       = {14},
  number       = {2},
  pages        = {325--351},
  year         = {1995},
  url          = {https://doi.org/10.1007/BF00881861},
  doi          = {10.1007/BF00881861},
  timestamp    = {Wed, 02 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/LovelandRW95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/NadathurL95,
  author       = {Gopalan Nadathur and
                  Donald W. Loveland},
  title        = {Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)},
  booktitle    = {Proceedings, 10th Annual {IEEE} Symposium on Logic in Computer Science,
                  San Diego, California, USA, June 26-29, 1995},
  pages        = {148--155},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/LICS.1995.523252},
  doi          = {10.1109/LICS.1995.523252},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/NadathurL95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gi/Loveland94,
  author       = {Donald W. Loveland},
  editor       = {Bernd E. Wolfinger},
  title        = {Proof Procedures for Disjunctive Logic Programming},
  booktitle    = {Innovationen bei Rechen- und Kommunikationssystemen, Eine Herausforderung
                  f{\"{u}}r die Informatik, 24. GI-Jahrestagung im Rahmen des 13th
                  World Computer Congress, {IFIP} Congress '94, Hamburg, 28. August
                  - 2. September 1994},
  series       = {Informatik Aktuell},
  pages        = {92},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/978-3-642-51136-3\_14},
  doi          = {10.1007/978-3-642-51136-3\_14},
  timestamp    = {Tue, 23 May 2017 01:10:34 +0200},
  biburl       = {https://dblp.org/rec/conf/gi/Loveland94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijar/ValtortaL92,
  author       = {Marco Valtorta and
                  Donald W. Loveland},
  title        = {On the complexity of belief network synthesis and refinement},
  journal      = {Int. J. Approx. Reason.},
  volume       = {7},
  number       = {3-4},
  pages        = {121--148},
  year         = {1992},
  url          = {https://doi.org/10.1016/0888-613X(92)90007-M},
  doi          = {10.1016/0888-613X(92)90007-M},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijar/ValtortaL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlp/ReedL92,
  author       = {David W. Reed and
                  Donald W. Loveland},
  title        = {A Comparison of Three Prolog Extensions},
  journal      = {J. Log. Program.},
  volume       = {12},
  number       = {1{\&}2},
  pages        = {25--50},
  year         = {1992},
  url          = {https://doi.org/10.1016/0743-1066(92)90038-5},
  doi          = {10.1016/0743-1066(92)90038-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jlp/ReedL92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/Loveland91,
  author       = {Donald W. Loveland},
  title        = {Near-Horn Prolog and Beyond},
  journal      = {J. Autom. Reason.},
  volume       = {7},
  number       = {1},
  pages        = {1--26},
  year         = {1991},
  url          = {https://doi.org/10.1007/BF00249353},
  doi          = {10.1007/BF00249353},
  timestamp    = {Wed, 02 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jar/Loveland91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/AstrachanL91,
  author       = {Owen L. Astrachan and
                  Donald W. Loveland},
  editor       = {Robert S. Boyer},
  title        = {METEORs: High Performance Theorem Provers Using Model Elimination},
  booktitle    = {Automated Reasoning: Essays in Honor of Woody Bledsoe},
  series       = {Automated Reasoning Series},
  pages        = {31--60},
  publisher    = {Kluwer Academic Publishers},
  year         = {1991},
  timestamp    = {Wed, 30 Mar 2016 17:34:58 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/AstrachanL91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/LovelandR91,
  author       = {Donald W. Loveland and
                  David W. Reed},
  editor       = {Jean{-}Louis Lassez and
                  Gordon D. Plotkin},
  title        = {A Near-Horn Prolog for Compilation},
  booktitle    = {Computational Logic - Essays in Honor of Alan Robinson},
  pages        = {542--564},
  publisher    = {The {MIT} Press},
  year         = {1991},
  timestamp    = {Wed, 30 Mar 2016 17:34:58 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/LovelandR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/elp/ReedLS91,
  author       = {David W. Reed and
                  Donald W. Loveland and
                  Bruce T. Smith},
  editor       = {Lars{-}Henrik Eriksson and
                  Lars Halln{\"{a}}s and
                  Peter Schroeder{-}Heister},
  title        = {The Near-Horn Approach to Disjunctive Logic Programming},
  booktitle    = {Extensions of Logic Programming, Second International Workshop, ELP'91,
                  Stockholm, Sweden, January 27-29, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {596},
  pages        = {345--369},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/BFb0013613},
  doi          = {10.1007/BFB0013613},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/elp/ReedLS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/slp/ReedLS91,
  author       = {David W. Reed and
                  Donald W. Loveland and
                  Bruce T. Smith},
  editor       = {Vijay A. Saraswat and
                  Kazunori Ueda},
  title        = {An Alternative Characterization of Disjunctive Logic Programs},
  booktitle    = {Logic Programming, Proceedings of the 1991 International Symposium,
                  San Diego, California, USA, Oct. 28 - Nov 1, 1991},
  pages        = {54--68},
  publisher    = {{MIT} Press},
  year         = {1991},
  timestamp    = {Wed, 04 Dec 2013 14:42:58 +0100},
  biburl       = {https://dblp.org/rec/conf/slp/ReedLS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/SmithL88,
  author       = {Bruce T. Smith and
                  Donald W. Loveland},
  editor       = {Ewing L. Lusk and
                  Ross A. Overbeek},
  title        = {An nH-Prolog Implementation},
  booktitle    = {9th International Conference on Automated Deduction, Argonne, Illinois,
                  USA, May 23-26, 1988, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {310},
  pages        = {766--767},
  publisher    = {Springer},
  year         = {1988},
  url          = {https://doi.org/10.1007/BFb0012888},
  doi          = {10.1007/BFB0012888},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/cade/SmithL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclp/SmithL88,
  author       = {Bruce T. Smith and
                  Donald W. Loveland},
  editor       = {Robert A. Kowalski and
                  Kenneth A. Bowen},
  title        = {A Simple Near-Horn Prolog Interpreter},
  booktitle    = {Logic Programming, Proceedings of the Fifth International Conference
                  and Symposium, Seattle, Washington, USA, August 15-19, 1988 {(2} Volumes)},
  pages        = {794--809},
  publisher    = {{MIT} Press},
  year         = {1988},
  timestamp    = {Sat, 23 Jun 2018 18:45:26 +0200},
  biburl       = {https://dblp.org/rec/conf/iclp/SmithL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Loveland87,
  author       = {Donald W. Loveland},
  title        = {Finding Critical Sets},
  journal      = {J. Algorithms},
  volume       = {8},
  number       = {3},
  pages        = {362--371},
  year         = {1987},
  url          = {https://doi.org/10.1016/0196-6774(87)90016-2},
  doi          = {10.1016/0196-6774(87)90016-2},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Loveland87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/DuvalWHL87,
  author       = {Louis D. Duval and
                  Robert A. Wagner and
                  Yijie Han and
                  Donald W. Loveland},
  title        = {Finding Test-and-Treatment Procedures Using Parallel Computation},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {4},
  number       = {3},
  pages        = {309--318},
  year         = {1987},
  url          = {https://doi.org/10.1016/0743-7315(87)90039-6},
  doi          = {10.1016/0743-7315(87)90039-6},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jpdc/DuvalWHL87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclp/Loveland87,
  author       = {Donald W. Loveland},
  editor       = {Jean{-}Louis Lassez},
  title        = {Near-Horn {PROLOG}},
  booktitle    = {Logic Programming, Proceedings of the Fourth International Conference,
                  Melbourne, Victoria, Australia, May 25-29, 1987 {(2} Volumes)},
  pages        = {456--469},
  publisher    = {{MIT} Press},
  year         = {1987},
  timestamp    = {Fri, 29 Nov 2013 14:57:24 +0100},
  biburl       = {https://dblp.org/rec/conf/iclp/Loveland87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/DuvalHWL86,
  author       = {Louis D. Duval and
                  Yijie Han and
                  Robert A. Wagner and
                  Donald W. Loveland},
  title        = {Finding Test-and-Treatment Procedures Using Parallel Computation},
  booktitle    = {International Conference on Parallel Processing, ICPP'86, University
                  Park, PA, USA, August 1986},
  pages        = {688--690},
  publisher    = {{IEEE} Computer Society Press},
  year         = {1986},
  timestamp    = {Thu, 30 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icpp/DuvalHWL86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismis/Loveland86,
  author       = {Donald W. Loveland},
  editor       = {Zbigniew W. Ras and
                  Maria Zemankova},
  title        = {Automated theorem proving: mapping logic into {AI}},
  booktitle    = {Proceedings of the {ACM} {SIGART} International Symposium on Methodologies
                  for Intelligent Systems, {ISMIS} 1986, Knoxville, Tennessee, USA,
                  October 22-24, 1986},
  pages        = {214--229},
  publisher    = {{ACM}},
  year         = {1986},
  url          = {https://doi.org/10.1145/12808.12833},
  doi          = {10.1145/12808.12833},
  timestamp    = {Fri, 25 Mar 2022 14:23:58 +0100},
  biburl       = {https://dblp.org/rec/conf/ismis/Loveland86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Loveland85,
  author       = {Donald W. Loveland},
  title        = {Performance Bounds for Binary Testing with Arbitrary Weights},
  journal      = {Acta Informatica},
  volume       = {22},
  number       = {1},
  pages        = {101--114},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00290148},
  doi          = {10.1007/BF00290148},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Loveland85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/LovelandV83,
  author       = {Donald W. Loveland and
                  Marco Valtorta},
  editor       = {Alan Bundy},
  title        = {Detecting Ambiguity: An Example in Knowledge Evaluation},
  booktitle    = {Proceedings of the 8th International Joint Conference on Artificial
                  Intelligence. Karlsruhe, FRG, August 1983},
  pages        = {182--184},
  publisher    = {William Kaufmann},
  year         = {1983},
  url          = {http://ijcai.org/Proceedings/83-1/Papers/039.pdf},
  timestamp    = {Tue, 20 Aug 2019 16:18:54 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/LovelandV83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cade/1982,
  editor       = {Donald W. Loveland},
  title        = {6th Conference on Automated Deduction, New York, USA, June 7-9, 1982,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {138},
  publisher    = {Springer},
  year         = {1982},
  url          = {https://doi.org/10.1007/BFb0000048},
  doi          = {10.1007/BFB0000048},
  isbn         = {3-540-11558-7},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cade/1982.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LovelandR81,
  author       = {Donald W. Loveland and
                  C. R. Reddy},
  title        = {Deleting Repeated Goals in the Problem Reduction Format},
  journal      = {J. {ACM}},
  volume       = {28},
  number       = {4},
  pages        = {646--661},
  year         = {1981},
  url          = {https://doi.org/10.1145/322276.322278},
  doi          = {10.1145/322276.322278},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/LovelandR81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/LovelandS80,
  author       = {Donald W. Loveland and
                  Robert E. Shostak},
  editor       = {Wolfgang Bibel and
                  Robert A. Kowalski},
  title        = {Simplifying Interpreted Formulas},
  booktitle    = {5th Conference on Automated Deduction, Les Arcs, France, July 8-11,
                  1980, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {87},
  pages        = {97--109},
  publisher    = {Springer},
  year         = {1980},
  url          = {https://doi.org/10.1007/3-540-10009-1\_9},
  doi          = {10.1007/3-540-10009-1\_9},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/cade/LovelandS80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/lib/Loveland78,
  author       = {Donald W. Loveland},
  title        = {Automated theorem proving: a logical basis},
  series       = {Fundamental studies in computer science},
  volume       = {6},
  publisher    = {North-Holland},
  year         = {1978},
  url          = {https://www.worldcat.org/oclc/252520243},
  isbn         = {0720404991},
  timestamp    = {Fri, 17 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/lib/Loveland78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ReddyL78,
  author       = {C. R. Reddy and
                  Donald W. Loveland},
  editor       = {Richard J. Lipton and
                  Walter A. Burkhard and
                  Walter J. Savitch and
                  Emily P. Friedman and
                  Alfred V. Aho},
  title        = {Presburger Arithmetic with Bounded Quantifier Alternation},
  booktitle    = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
                  May 1-3, 1978, San Diego, California, {USA}},
  pages        = {320--325},
  publisher    = {{ACM}},
  year         = {1978},
  url          = {https://doi.org/10.1145/800133.804361},
  doi          = {10.1145/800133.804361},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ReddyL78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/LovelandS76,
  author       = {Donald W. Loveland and
                  Mark E. Stickel},
  title        = {A Hole in Goal Trees: Some Guidance from Resolution Theory},
  journal      = {{IEEE} Trans. Computers},
  volume       = {25},
  number       = {4},
  pages        = {335--341},
  year         = {1976},
  url          = {https://doi.org/10.1109/TC.1976.1674614},
  doi          = {10.1109/TC.1976.1674614},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tc/LovelandS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FleisigLSY74,
  author       = {S. Fleisig and
                  Donald W. Loveland and
                  A. K. Smiley III and
                  D. L. Yarmush},
  title        = {An Implementation of the Model Elimination Proof Procedure},
  journal      = {J. {ACM}},
  volume       = {21},
  number       = {1},
  pages        = {124--139},
  year         = {1974},
  url          = {https://doi.org/10.1145/321796.321807},
  doi          = {10.1145/321796.321807},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/FleisigLSY74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigcse/Loveland74,
  author       = {Donald W. Loveland},
  title        = {Position statement: mathematical computer science courses},
  journal      = {{ACM} {SIGCSE} Bull.},
  volume       = {6},
  number       = {3},
  pages        = {106--108},
  year         = {1974},
  url          = {https://doi.org/10.1145/988881.988903},
  doi          = {10.1145/988881.988903},
  timestamp    = {Thu, 01 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sigcse/Loveland74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigcse/GibbsLO74,
  author       = {Norman E. Gibbs and
                  Donald W. Loveland and
                  James M. Ortega},
  title        = {The heart of computer science},
  journal      = {{ACM} {SIGCSE} Bull.},
  volume       = {6},
  number       = {4},
  pages        = {13--14},
  year         = {1974},
  url          = {https://doi.org/10.1145/382201.382989},
  doi          = {10.1145/382201.382989},
  timestamp    = {Thu, 01 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sigcse/GibbsLO74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/LovelandS73,
  author       = {Donald W. Loveland and
                  Mark E. Stickel},
  editor       = {Nils J. Nilsson},
  title        = {A Hole in Goal Trees: Some Guidance from Resolution Theory},
  booktitle    = {Proceedings of the 3rd International Joint Conference on Artificial
                  Intelligence. Standford, CA, USA, August 20-23, 1973},
  pages        = {153--161},
  publisher    = {William Kaufmann},
  year         = {1973},
  url          = {http://ijcai.org/Proceedings/73/Papers/018.pdf},
  timestamp    = {Tue, 20 Aug 2019 16:17:01 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/LovelandS73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Loveland72,
  author       = {Donald W. Loveland},
  title        = {A Unifying View of Some Linear Herbrand Procedures},
  journal      = {J. {ACM}},
  volume       = {19},
  number       = {2},
  pages        = {366--384},
  year         = {1972},
  url          = {https://doi.org/10.1145/321694.321706},
  doi          = {10.1145/321694.321706},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Loveland72.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Loveland69,
  author       = {Donald W. Loveland},
  title        = {A Variant of the Kolmogorov Concept of Complexity},
  journal      = {Inf. Control.},
  volume       = {15},
  number       = {6},
  pages        = {510--526},
  year         = {1969},
  url          = {https://doi.org/10.1016/S0019-9958(69)90538-5},
  doi          = {10.1016/S0019-9958(69)90538-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Loveland69.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Loveland69a,
  author       = {Donald W. Loveland},
  title        = {Erratum: "Mechanical Theorem-Proving by Model Elimination"},
  journal      = {J. {ACM}},
  volume       = {16},
  number       = {1},
  pages        = {646},
  year         = {1969},
  url          = {https://doi.org/10.1145/321541.331604},
  doi          = {10.1145/321541.331604},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Loveland69a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Loveland69,
  author       = {Donald W. Loveland},
  title        = {A Simplified Format for the Model Elimination Theorem-Proving Procedure},
  journal      = {J. {ACM}},
  volume       = {16},
  number       = {3},
  pages        = {349--363},
  year         = {1969},
  url          = {https://doi.org/10.1145/321526.321527},
  doi          = {10.1145/321526.321527},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Loveland69.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Loveland69,
  author       = {Donald W. Loveland},
  editor       = {Patrick C. Fischer and
                  Seymour Ginsburg and
                  Michael A. Harrison},
  title        = {On Minimal-Program Complexity Measures},
  booktitle    = {Proceedings of the 1st Annual {ACM} Symposium on Theory of Computing,
                  May 5-7, 1969, Marina del Rey, CA, {USA}},
  pages        = {61--65},
  publisher    = {{ACM}},
  year         = {1969},
  url          = {https://doi.org/10.1145/800169.805422},
  doi          = {10.1145/800169.805422},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Loveland69.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Loveland68,
  author       = {Donald W. Loveland},
  title        = {Mechanical Theorem-Proving by Model Elimination},
  journal      = {J. {ACM}},
  volume       = {15},
  number       = {2},
  pages        = {236--251},
  year         = {1968},
  url          = {https://doi.org/10.1145/321450.321456},
  doi          = {10.1145/321450.321456},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Loveland68.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/DavisLL62,
  author       = {Martin Davis and
                  George Logemann and
                  Donald W. Loveland},
  title        = {A machine program for theorem-proving},
  journal      = {Commun. {ACM}},
  volume       = {5},
  number       = {7},
  pages        = {394--397},
  year         = {1962},
  url          = {https://doi.org/10.1145/368273.368557},
  doi          = {10.1145/368273.368557},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cacm/DavisLL62.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aieeire/GelernterHL60,
  author       = {Herbert L. Gelernter and
                  J. R. Hansen and
                  Donald W. Loveland},
  editor       = {R. M. Bennett},
  title        = {Empirical explorations of the geometry theorem machine},
  booktitle    = {Papers presented at the 1960 western joint {IRE-AIEE-ACM} computer
                  conference, {IRE-AIEE-ACM} 1960 (Western), San Francisco, California,
                  USA, May 3-5, 1960},
  pages        = {143--149},
  publisher    = {{ACM}},
  year         = {1960},
  url          = {https://doi.org/10.1145/1460361.1460381},
  doi          = {10.1145/1460361.1460381},
  timestamp    = {Fri, 23 Apr 2021 17:08:37 +0200},
  biburl       = {https://dblp.org/rec/conf/aieeire/GelernterHL60.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics