| 词条 | Jean Gallier |
| 释义 |
Jean Henri Gallier (born 1949) is a researcher in computational logic at the University of Pennsylvania, where he holds appointments in the Computer and Information Science Department and the Department of Mathematics. BiographyGallier was born January 5, 1949 in Nancy, France, and holds dual French and American citizenship. He earned his baccalauréat at the Lycée de Sèvres in 1966, and a degree in civil engineering at the École Nationale des Ponts et Chaussées in 1972.{{r|cv}} He then moved to the University of California, Los Angeles for his graduate studies, earning a Ph.D. in computer science in 1978 under the joint supervision of Sheila Greibach and Emily Perlinski Friedman. His dissertation was entitled Semantics and Correctness of Classes of Deterministic and Nondeterministic Recursive Programs.{{r|cv|mg}} After postdoctoral study at the University of California, Santa Barbara, he joined the University of Pennsylvania Department of Computer and Information Science in 1978. At Pennsylvania, he was promoted to full professor in 1990, gained a secondary appointment to the Department of Mathematics in 1994, and directed the French Institute of Culture and Technology from 2001 to 2004.{{r|cv}} ContributionsGallier's most heavily cited research paper, with his student William F. Dowling, gives a linear time algorithm for Horn-satisfiability.{{ran|DG84}} This is a variant of the Boolean satisfiability problem: its input is a Boolean formula in conjunctive normal form with at most one positive literal per clause, and the goal is to assign truth values to the variables of the formula to make the whole formula true. Solving Horn-satisfiability problems is the central computational paradigm in the Prolog programming language.{{r|dechter}} Gallier is also the author of five books in computational logic,{{ran|G86}} computational geometry,{{ran|G99}}{{ran|G00}} low-dimensional topology,{{ran|GX13}} and discrete mathematics.{{ran|G11}} Selected publicationsResearch papers{{rma|DG84|{{citation| last1 = Dowling | first1 = William F. | last2 = Gallier | first2 = Jean H. | doi = 10.1016/0743-1066(84)90014-1 | issue = 3 | journal = Journal of Logic Programming | mr = 770156 | pages = 267–284 | title = Linear-time algorithms for testing the satisfiability of propositional Horn formulae | volume = 1 | year = 1984}}. |tw=3em}} Books{{rma|G86|{{citation| last = Gallier | first = Jean H. | publisher = Wiley | title = Logic for Computer Science: Foundations of Automatic Theorem Proving | year = 1986}}. 2nd ed., Dover Publications, 2015.{{r|pfenning}} |tw=3em}}{{rma|G99|{{citation | last = Gallier | first = Jean | isbn = 1-55860-599-1 | location = San Francisco, CA | publisher = Morgan Kaufmann | series = The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling | title = Curves and Surfaces in Geometric Modeling: Theory and Algorithms | year = 1999}}.{{r|kallay}} |tw=3em}}{{rma|G00|{{citation | last = Gallier | first = Jean | doi = 10.1007/978-1-4613-0137-0 | isbn = 0-387-95044-3 | location = New York | publisher = Springer-Verlag | series = Texts in Applied Mathematics | title = Geometric Methods and Applications: For Computer Science and Engineering | volume = 38 | year = 2000}}. 2nd ed., 2011, {{ISBN|978-1-4419-9960-3}}.{{r|juttler|williams|hunacek}} |tw=3em}}{{rma|G11|{{citation | last = Gallier | first = Jean | doi = 10.1007/978-1-4419-8047-2 | isbn = 978-1-4419-8046-5 | location = New York | mr = 2777371 | publisher = Springer-Verlag | series = Universitext | title = Discrete Mathematics | year = 2011}}.{{r|pinter}} |tw=3em}}{{rma|GX13|{{citation | last1 = Gallier | first1 = Jean | last2 = Xu | first2 = Dianna | author2-link = Dianna Xu | doi = 10.1007/978-3-642-34364-3 | isbn = 978-3-642-34363-6 | location = Heidelberg | publisher = Springer | series = Geometry and Computing | title = A Guide to the Classification Theorem for Compact Surfaces | volume = 9 | year = 2013}}.{{r|loh|wood}} |tw=3em}} References1. ^Hunacek, Mark (2011), Review of Geometric methods and applications, Mathematical Association of America. .[1][2][3][4][5][6][7][8][9]2. ^Jüttler, Bert (2001), Review of Geometric methods and applications, {{MR|1792535}}. Updated for 2nd ed., 2012, {{MR|2663906}}. 3. ^Kallay, Michael (2001), Review of Curves and surfaces in geometric modeling, {{MR|1823812}}. 4. ^Löh, Clara, Review of A guide to the classification theorem for compact surfaces, {{MR|3026641}}. 5. ^{{mathgenealogy|id=78759}} 6. ^{{citation | last = Pfenning | first = Frank | doi = 10.2307/2275035 | issue = 1 | journal = Journal of Symbolic Logic | jstor = 2275035 | pages = 288–289 | title = Review: Jean H. Gallier, Logic for Computer Science. Foundations of Automatic Theorem Proving | url = https://www.cs.cmu.edu/~fp/papers/jsl89.pdf | volume = 54 | year = 1989}}. 7. ^Pinter, Gabriella (2012), Review of Discrete Mathematics, Mathematical Association of America. 8. ^{{citation | last = Williams | first = Hugh | date = November 2002 | doi = 10.2307/3621198 | issue = 507 | journal = The Mathematical Gazette | jstor = 3621198 | page = 564 | title = Geometric Methods and Applications for Computer Science and Engineering | volume = 86}}. 9. ^Wood, Bill (2014), Review of A Guide to the Classification Theorem for Compact Surfaces, Mathematical Association of America. }} External links
13 : Living people|American computer scientists|French computer scientists|20th-century American mathematicians|21st-century American mathematicians|French mathematicians|Mathematical logicians|Researchers in geometric algorithms|Theoretical computer scientists|École des Ponts ParisTech alumni|University of California, Los Angeles alumni|University of Pennsylvania faculty|1949 births |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。