|
Herbrand Award
The Herbrand Award for Distinguished Contributions to Automated Reasoning is an award given by the Conference on Automated Deduction (CADE), Inc., (although it predates the formal incorporation of CADE) to honour persons or groups for important contributions to the field of automated theorem proving, automated deduction. The award is named after the France, French scientist Jacques Herbrand and given at most once per CADE or International Joint Conference on Automated Reasoning (IJCAR). It comes with a prize of US$1,000. Anyone can be nominated, the award is awarded after a vote among CADE trustees and former recipients, usually with input from the CADE/IJCAR programme committee. Recipients Past award recipients are: 1990s * Larry Wos (1992) * Woody Bledsoe (1994) * John Alan Robinson (1996) * Wu Wenjun (1997) * Gérard Huet (1998) * Robert S. Boyer and J Strother Moore (1999) 2000s * William McCune, William W. McCune (2000) * Donald W. Loveland (2001) * Mark E. Stickel (200 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Conference On Automated Deduction
The Conference on Automated Deduction (CADE) is the premier academic conference on automated deduction and related fields. The first CADE was organized in 1974 at the Argonne National Laboratory near Chicago. Most CADE meetings have been held in Europe and the United States. However, conferences have been held all over the world. Since 1996, CADE has been held yearly. In 2001, CADE was, for the first time, merged into the International Joint Conference on Automated Reasoning The International Joint Conference on Automated Reasoning (IJCAR) is a series of conferences on the topics of automated reasoning, automated deduction, and related fields. It is organized semi-regularly as a merger of other meetings. IJCAR replace ... (IJCAR). This has been repeated biannually since 2004. In 1996, CADE Inc. was formed as a non-profit sub-corporation of the Association for Automated Reasoning to organize the formerly individually organized conferences. External links * , CADE * , AAR Refe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin Davis (mathematician)
Martin David Davis (March 8, 1928 – January 1, 2023) was an American mathematician, known for his work on Hilbert's tenth problem.. Biography Davis's parents were Jewish immigrants to the US from Łódź, Poland, and married after they met again in New York City. Davis grew up in the Bronx, where his parents encouraged him to obtain a full education. Davis received his Ph.D. from Princeton University in 1950, where his advisor was Alonzo Church. During a research instructorship at the University of Illinois at Urbana-Champaign in the early 1950s, he joined the ''Control Systems Lab'' and became one of the early programmers of the ORDVAC. He was Professor Emeritus at New York University. Davis died on January 1, 2023, at the age of 94. Contributions Davis was the co-inventor of the Davis–Putnam algorithm and the DPLL algorithms. He is also known for his model of Post–Turing machines, and his work on Hilbert's tenth problem leading to the MRDP theorem. Awards and honors In ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lawrence C
Lawrence may refer to: Education Colleges and universities * Lawrence Technological University, a university in Southfield, Michigan, United States * Lawrence University, a liberal arts university in Appleton, Wisconsin, United States Preparatory & high schools * Lawrence Academy at Groton, a preparatory school in Groton, Massachusetts, United States * Lawrence College, Ghora Gali, a high school in Pakistan * Lawrence School, Lovedale, a high school in India * The Lawrence School, Sanawar, a high school in India Research laboratories * Lawrence Berkeley National Laboratory, United States * Lawrence Livermore National Laboratory, United States People * Lawrence (given name), including a list of people with the name * Lawrence (surname), including a list of people with the name * Lawrence (band), an American soul-pop group * Lawrence (judge royal) (died after 1180), Hungarian nobleman, Judge royal 1164–1172 * Lawrence (musician), Lawrence Hayward (born 1961), British musician * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Waldinger
Richard Jay Waldinger is a computer science researcher at SRI International's Artificial Intelligence Center (where he has worked since 1969) whose interests focus on the application of automated deductive reasoning to problems in software engineering and artificial intelligence. Early life and education In his thesis ( Carnegie Mellon University, 1969), which concerned the extraction of computer programs from proofs of theorems, he found that the application of the resolution rule accounted for the appearance of a conditional branch in the extracted program, while the use of the mathematical induction principle caused the introduction of recursion and other repetitive constructs. Career Waldinger started at SRI International, then known as the Stanford Research Institute, in 1969, and has remained there since then. He has served coffee and cookies in his office at SRI twice a week since 1970. QA4 Waldinger collaborated with Cordell Green, Robert Yates, Jeff Rulifson, and Jan Der ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zohar Manna
Zohar Manna (1939 – 30 August 2018) was an Israeli-American computer scientist who was a professor of computer science at Stanford University. Biography He was born in Haifa, Israel. He earned his Bachelor of Science (BS) and Master of Science (MS) degrees from the Technion – Israel Institute of Technology. He attended Carnegie Mellon University and earned his Doctor of Philosophy (PhD) in computer science in 1968. Manna returned to Israel in 1972 as a professor of applied mathematics at the Weizmann Institute of Science. He became a full professor at Stanford in 1978. He remained affiliated with the Weizmann Institute of Science until 1995. He continued to work as a Stanford professor until retirement in 2010. Books He authored nine books. ''The Mathematical Theory of Computation'' (McGraw Hill, 1974; reprinted Dover, 2003) is one of the first texts to provide extensive coverage of the mathematical concepts behind computer programming. With Amir Pnueli, he co-authored ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrei Voronkov
Andrei Anatolievič Voronkov (born 1959) is a Professor of Formal methods in the Department of Computer Science at the University of Manchester. Education Voronkov was educated at Novosibirsk State University, graduating with a PhD in 1987. Research Voronkov is known for the Vampire automated theorem prover, the EasyChair conference management software, the Handbook of Automated Reasoning (with John Alan Robinson, 2001), and as organiser of the Alan Turing Centenary Conference 2012. Voronkov's research has been funded by the Engineering and Physical Sciences Research Council (EPSRC). Awards and honours In 2015, his contributions to the field of automated reasoning were recognized with the Herbrand Award. He has won 25 division titles in the CADE ATP System Competition (CASC) at the Conference on Automated Deduction (CADE) since 1999. Personal life Voronkov is married and has three children. A son and two daughters. He lives in Bramhall Bramhall is a suburban area in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robert L
The name Robert is an ancient Germanic given name, from Proto-Germanic "fame" and "bright" (''Hrōþiberhtaz''). Compare Old Dutch ''Robrecht'' and Old High German ''Hrodebert'' (a compound of '' Hruod'' ( non, Hróðr) "fame, glory, honour, praise, renown" and ''berht'' "bright, light, shining"). It is the second most frequently used given name of ancient Germanic origin. It is also in use as a surname. Another commonly used form of the name is Rupert. After becoming widely used in Continental Europe it entered England in its Old French form ''Robert'', where an Old English cognate form (''Hrēodbēorht'', ''Hrodberht'', ''Hrēodbēorð'', ''Hrœdbœrð'', ''Hrœdberð'', ''Hrōðberχtŕ'') had existed before the Norman Conquest. The feminine version is Roberta. The Italian, Portuguese, and Spanish form is Roberto. Robert is also a common name in many Germanic languages, including English, German, Dutch, Norwegian, Swedish, Scots, Danish, and Icelandic. It can be use ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Greg Nelson (computer Scientist)
Charles Gregory Nelson (27 March 1953 – 2 February 2015) was an American computer scientist. Biography Nelson grew up in Honolulu. As a boy he excelled at gymnastics and tennis. He attended the University Laboratory School. He received his B.A. degree in mathematics from Harvard University in 1976. He received his Ph.D. in computer science from Stanford University in 1980 under the supervision of Robert Tarjan. He lived in Juneau, Alaska for a year before settling permanently in the San Francisco Bay Area. Notable work His thesis, ''Techniques for Program Verification'', influenced both program verification and automated theorem proving, especially in the area now named satisfiability modulo theories, where he contributed techniques for combining decision procedures, as well as efficient decision procedures for quantifier-free constraints in first-order logic and term algebra. He received the Herbrand Award in 2013: He was instrumental in developing the ''Simplify ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Melvin Fitting
Melvin Fitting (born January 24, 1942) is a logician with special interests in philosophical logic and tableau proof systems. He was a professor at City University of New York, Lehman College and the Graduate Center. from 1968 to 2013. At the Graduate Center he was in the departments of Computer Science, Philosophy, and Mathematics, and at Lehman College he was in the department of Mathematics and Computer Science. He is now Professor emeritus. Fitting was born in Troy, New York. His undergraduate degree is from Rensselaer Polytechnic Institute, and his doctorate is from Yeshiva University, both in mathematics. His thesis advisor was Raymond Smullyan. In June 2012 Melvin Fitting was given the Herbrand Award by CADE, for distinguished contributions to automated deduction. A loose motivation for much of Melvin Fitting's work can be formulated succinctly as follows. There are many logics. Our principles of reasoning vary with context and subject matter. Multiplicity is on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nachum Dershowitz
Nachum Dershowitz is an Israeli computer scientist, known e.g. for the Dershowitz–Manna ordering and the multiset path ordering used to prove termination of term rewrite systems. He obtained his B.Sc. summa cum laude in 1974 in Computer Science–Applied Mathematics from Bar-Ilan University, and his Ph.D. in 1979 in Applied Mathematics from the Weizmann Institute of Science. From 1978, he worked at the Department of Computer Science of the University of Illinois at Urbana-Champaign, until he became a full professor of the Tel Aviv University (School of Computer Science) in 1998. He was a guest researcher at Weizmann Institute, INRIA, ENS Cachan, Microsoft Research, and the universities of Stanford, Paris, Jerusalem, Chicago, and Beijing. He received the Herbrand Award for Distinguished Contributions to Automatic Reasoning in 2011. He has co-authored the standard text on calendar algorithms, ''Calendrical Calculations'', with Edward Reingold.Review of ''Calendrical Calculat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Plaisted
David Alan Plaisted is a computer science professor at the University of North Carolina at Chapel Hill. Research interests Plaisted's research interests include term rewriting systems, automated theorem proving, logic programming, and algorithms. His research accomplishments in theorem proving include work on the recursive path ordering, the associative path ordering, abstraction, the simplified and modified problem reduction formats, ground reducibility, nonstandard clause form translations, rigid E-unification, Knuth–Bendix completion, replacement rules in theorem proving, instance-based theorem proving strategies, and semantics in theorem proving. Education and career He received his B.S. from the University of Chicago in 1970 and his Ph.D. from Stanford University in 1976. He served on the faculty of the computer science department at the University of Illinois at Urbana-Champaign until 1984, and since then has been a full professor in the Department of Computer Science ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deepak Kapur
Deepak Kapur (born August 24, 1950) is a Distinguished Professor in the Department of Computer Science at the University of New Mexico. Biography Kapur was born in a lower-middle-class family based in Amritsar, where his father, Nawal Kishore Kapur, was a cloth broker; his mother, Bimla Vati, was a housewife. Education Kapur's early education was at the Government Primary School, Katra Khazana, Amritsar, until 3rd grade. He was then shifted to the Vidya Bhushan Primary School, Amritsar. After 5th grade, he had to change school again to Dayanand Anglo Vedic (DAV) Higher Secondary School until 11th grade. He was selected in the Indian Institute of Technology (IIT) entrance examination in 1966. He got his undergraduate degree (B.Tech) in Electric Engineering from IIT, Kanpur, in 1971 and M. Tech. degree in Computer Science in May 1973 also from IIT, Kanpur. Academic career After graduating from MIT in March 1980, Kapur joined as a research staff at GE Corporate Research and D ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
