⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 http:^^www.cs.buffalo.edu^pub^www^lrg^papers.html

📁 This data set contains WWW-pages collected from computer science departments of various universities
💻 HTML
字号:
Date: Tue, 14 Jan 1997 22:00:15 GMT
Server: Apache/1.1.1
Content-type: text/html
Content-length: 3412
Last-modified: Sat, 23 Nov 1996 16:45:04 GMT

<H2>Recent Publications</H2><UL><LI>C. Crowner, K. Govindarajan, B. Jayaraman and S. Mantha,<!WA0><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/plg2.ps">Preference Logic Grammars </a>,submitted for publication.  Expanded version of TR 94-027<LI> K. Govindarajan, B. Jayaraman and S. Mantha,<!WA1><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/iclp95.ps">Preference Logic Programming </a>,<em>Proc. 12th International Conference on Logic Programming</em>, pp. 731-745, MIT Press, June 1995.<LI> K. Govindarajan, B. Jayaraman and S. Mantha,<!WA2><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/popl-bj.ps">Optimization and Relaxation in Constraint Logic Languages </a>,<em> Proc. 23rd ACM Symposium on Principles of Programming Languages</em>,pp. 91-105, St. Petersburg, FL, January 1996.<LI>K. Govindarajan, B. Jayaraman, and S. Mantha,<!WA3><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/pdp.ps">Preference Queries in Deductive Databases</a>,Technical Report TR 95-50, Department of Computer Science,SUNY-Buffalo.  Revised February 1996. <LI>J. Haas and B. Jayaraman  <!WA4><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/jlp96.ps">From Context Free to Definite Clause Grammars: A Type-Theoretic Approach</a>,<em>Journal of Logic Programming</em>, to appear 1996.<LI>D. Jana and B. Jayaraman,  <!WA5><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/sets94.ps">Set Constructors, Finite Sets, and Logical Semantics</a>, Technical Report 94-030, Department of Computer Science, SUNY-Buffalo, August 1994.  Submitted for publication.<LI>B. Jayaraman, <!WA6><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/jlp92.ps">Implementation of Subset-Equational Programs</a><em>Journal of Logic Programming</em>, 11:299-324, April 1992.  <LI>B. Jayaraman and C. Baltus,<!WA7><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/visual.ps">Visualizing Program Execution</a>,<em>Proc. IEEE Symposium on Visual Languages</em>,Boulder, CO, Sep. 1996.  To appear.<LI>B. Jayaraman and K. Moon,<!WA8><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/jlp95.ps">Implementation of Subset Logic Programs</a>, Technical Report 95-014, Department of Computer Science, SUNY-Buffalo, March 1995.   Submitted for publication<LI>B. Jayaraman, M. Osorio, and K. Moon, <!WA9><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/amast95.ps">Partial Order Programming (Revisited)</a>, <em>Proc. Algebraic Methodology and SoftwareTechnology (AMAST)</em>, Springer-Verlag, pp.~561-575,Montreal, July 1995.<LI>M. Osorio and B. Jayaraman,  <!WA10><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/ilps93.ps">Subset Assertions and Negation As Faiure</a>, expanded version of a poster paper, <em>Proc. International Symposium on Logic Programming</em>,Vancouver, 1993.</UL><H2>Recent Papers With External Collaborators</H2><UL><LI>G. Gupta and B. Jayaraman,<!WA11><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/toplas.ps">Analysis of Or-Parallel Execution Models</a>,<em>ACM TOPLAS</em>, 15(4): 659-680, 1993.<LI>G. Gupta and B. Jayaraman,<!WA12><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/jlp93.ps">And-Or Parellelism on Shared-Memory Multiprocessors</a>,<em>Journal of Logic Programming</em>, 17(1): 59-89, 1993.<LI>B. Jayaraman and D.A. Plaisted<!WA13><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/naclp89.ps">Programming with Equations, Subsets, and Relations</a>,<em>  North American Logic Programming Conference </em>,MIT Press,  pp.~1051-1068, Cleveland, OH, October 1989.<LI>G. Nadathur, B. Jayaraman, and K-H. Kwon,<!WA14><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/scope.ps">Scoping Constructs in Logic Programming: Implementation Problemsand their Solution</a>,<em>Journal of Logic Programming</em>, November 1995.<LI>T. Wilmarth and B. Jayaraman,<!WA15><a HREF="http://www.cs.buffalo.edu/pub/WWW/LRG/Papers/total.ps">Total Order Programming?</a>, in progress.</UL><P><ADDRESS>Bharat Jayaraman (bharat@cs.buffalo.edu)</ADDRESS></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -