Laws@SRI-AI.ARPA@sri-unix.UUCP (08/09/83)
From: Ken Laws <Laws@SRI-AI.ARPA> Ballantyne, M. Bledsoe, W.W. Doyle, J. Moore, R.C. Pattis, R. Rosenschein, S.J.* Automatic deduction (Chapter XII of Volume III of the Handbook of Artificial Intelligence, edited by Paul R. Cohen and Edward A. Feigenbaum).* Stanford U. Comp.Sci.Dept.*STAN-CS-82-937; Stanford U. Comp.Sci.Dept. Heuristic Programming Project.*HPP-82-019.* 1982. 64p. Bergstra, J. Chmielinska, A. Tiuryn, J.*" Hoare's logic is not complete when it could be".* M.I.T. Lab. for Comp.Sci.*TM-226.*1982. Bergstra, J.A. Tucker, J.V.* Hoare's logic for programming languages with two data types.* Mathematisch Centrum.*IW 207/82.*1982. Boehm, H.-J.*A logic for expressions with side-effects.* Cornell U. Comp.Sci.Dept.*Tech.Rpt. 81-478.*1981. Bowen, D.L. (ed.)* DECsystem-10 Prolog user's manual.* Edinburgh U. A.I. Dept.*Occasional Paper 027.*1982. Boyer, R.S. Moore, J.S.*A mechanical proof of the unsolvability of the halting problem.* Texas U. Computing Sci. and Comp.Appl.Inst. Certifiable Minicomputer Project.*ICSCA-CMP-28.*1982. Bundy, A. Welham, B.*Utility procedures in Prolog.* Edinburgh U. A.I. Dept.*Occasional Paper 009.*1977. Byrd, L. (ed.)*User's guide to EMAS Prolog.* Edinburgh U. A.I. Dept.*Occasional Paper 026.*1981. Demopoulos, W.*The rejection of truth conditional semantics by Putnam and Dummett.* Western Ontario U. Cognitive Science Centre.*COGMEM 06.*1982. Goto, E. Soma, T. Inada, N. Ida, T. Idesawa, M. Hiraki, K. Suzuki, M. Shimizu, K. Philipov, B.*Design of a Lisp machine - FLATS.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-09.*1982. Griswold, R.E.*The control of searching and backtracking in string pattern matching.* Arizona U. Comp.Sci.Dept.*TR 82-20.*1982. Hagiya, M.*A proof description language and its reduction system.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-03.*1982. Itai, A. Makowsky, J.*On the complexity of Herbrand's theorem.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 243.*1982. Kautz, H.A.*A first-order dynamic logic for planning.* Toronto U. Comp. Systems Res. Group.*CSRG-144.*1982. Kozen, D.C.*Results on the propositional mu-calculus.* Aarhus U. Comp.Sci.Dept.*DAIMI PB-146.*1982. Makowsky, J.A. Tiomkin, M.L.*An array assignment for propositional dynamic logic.* Technion - Israel Inst. of Tech. Comp.Sci.Dept.*Tech.Rpt. 234.*1982. Manna, Z. Pneuli, A.*How to cook a temporal proof system for your pet language.* Stanford U. Comp.Sci.Dept.* STAN-CS-82-954.*1982. 14p. Mosses, P.* Abstract semantic algebras!* Aarhus U. Comp.Sci.Dept.*DAIMI PB-145.*1982. Orlowska, E.*Logic of vague concepts: applications of rough sets.* Polish Academy of Sciences. Inst. of Comp.Sci.*ICS PAS rpt. no. 474.*1982. Sakamura, K. Ishikawa, C.* High level machine design by dynamic tuning.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-07.*1982. Sato, M.*Algebraic structure of symbolic expressions.* Tokyo U. Info.Sci.Dept.*Tech.Rpt. 82-05.*1982. Shapiro, E.Y.* Alternation and the computational complexity of logic programs.* Yale U. Comp.Sci.Dept.*Res.Rpt. 239.* 1982. Stabler, E.P. Jr.* Database and theorem prover designs for question answering systems.* Western Ontario U. Cognitive Science Centre.*COGMEM 12.*1982. Sterling, L. Bundy, A.* Meta level inference and program verification.* Edinburgh U. A.I. Dept.*Res. Paper 168.* 1982. Treleaven, P.C. Gouveia Lima, I.*Japan's fifth generation computer systems.* Newcastle upon Tyne U. Computing Lab.* No. 176.*1982.