% This file was created with JabRef 2.6.
% Encoding: EUC_JP

@ARTICLE{KangBT:COMPSOFT:2001,
  author = {姜京順 and 番原睦則 and 田村直之},
  title = {線形論理型言語の効率的なリソース管理モデル},
  journal = {コンピュータソフトウェア},
  year = {2001},
  volume = {18},
  pages = {138--154},
  number = {0},
  abstract = {1987年にJ.-Y. Girardが発表した線形論理は，計算機科学への応用が期待さ れている新しい論理体系である．線形論理の論理型言語への応用は，特に活
	発な分野の一つであり，LO, ACL, Lolli, Lygon, Forum, およびLLP等の研 究がある．これらのほとんどの言語では，リソース概念はプログラミング上
	で重要な位置を占めている．したがって，リソースを効率的良く取り扱う計 算モデルの構築は重要な研究課題となっている．本論文で述べるレベル付き
	IOモデルは，効率的なリソース管理を目的とした計算モデルであり，実行中 はただ一つのリソース表を保持すれば良いように工夫されている．本モデル
	は，LLPコンパイラ処理系で採用され，その有効性が示されている．},
  comment = {LLPの計算モデルであるレベル付きIOモデルについてまとめた論文．},
  file = {:pdf/jssst01k.pdf:PDF},
  sort = {10010},
  url = {http://ci.nii.ac.jp/naid/80012137055},
  yomi = {Kyoung-Sun Kang and Mutsunori Banbara and Naoyuki Tamura}
}

@ARTICLE{BanbaraKT:COMPSOFT:2001,
  author = {番原睦則 and 姜京順 and 田村直之},
  title = {線形論理型言語のコンパイラ処理系のための抽象機械について},
  journal = {コンピュータソフトウェア},
  year = {2001},
  volume = {18},
  pages = {39--60},
  number = {1},
  abstract = {本論文では，線形論理に基づいた論理型言語LLPの概要と，そのコンパイラ 処理系のための抽象機械であるLLPAMについて述べている．LLPは，Prologの
	自然な拡張になっており，論理式をリソースとして取り扱うことができる点 を特徴とする．抽象機械LLPAMは，LLPの効率的な計算モデルであるレベル付
	きIOモデルのリソース管理方式に基づいて設計されており，抽象機械WAMの 拡張になっている．LLPAMでは，リソース自体もコンパイルされており，ま
	たリソースの検索はハッシュ表を通じて行われるため，線形論理型言語の特 徴であるリソース論理式の追加や消費といった操作を非常に効率よく実現す
	ることができる．},
  comment = {LLPのコンパイラ処理系で用いているLLPAM (LLP抽象機械)についてまとめた論文．},
  file = {:pdf/jssst01b.pdf:PDF},
  sort = {10020},
  url = {http://ci.nii.ac.jp/naid/10011734268},
  yomi = {Mutsunori Banbara and Kyoung-Sun Kang and Naoyuki Tamura}
}

@INPROCEEDINGS{HodasKTK:JICSLP:1998,
  author = {Joshua S. Hodas and Kevin Watkins and Naoyuki Tamura and Kyoung-Sun
	Kang},
  title = {Efficient Implementation of a Linear Logic Programming Language},
  booktitle = {Proceedings of the 1998 Joint International Conference and Symposium
	on Logic Programming (JICSLP'98)},
  year = {1998},
  pages = {145--159},
  month = Jun,
  publisher = {MIT Press},
  abstract = {A number of logic programming languages based on Girard's Linear Logic
	have been proposed. While efficiency of computation has been a consideration
	in the design of these languages from the earliest days the proposed
	implementation techniques have relied heavily on the copying and
	scanning of large data structures to ensure that linearity conditions
	have been met, and thus have been most suited to the creation of
	interpreters written in high-level languages. In this paper we present
	a new formulation of the logic of the the language Lolli that is
	conducive to the creation of both more efficient interpreters, as
	well as compilers based on extensions of the standard WAM model.
	We present an extension of the WAM based on this model which implements
	a useful fragment of Lolli. Resource conscious algorithms executed
	using this system show significant performance advantages relative
	to their traditional Prolog implementations.},
  comment = {LLPの計算モデルと抽象機械について述べた論文．リソース式のコンパイルについては述べられていない．},
  file = {:pdf/jicslp98f.pdf:PDF},
  sort = {10030},
  url = {http://dblp.uni-trier.de/db/conf/iclp/iclp98.html#HodasWTK98}
}

@INPROCEEDINGS{BanbaraT:ILPS:1998,
  author = {Mutsunori Banbara and Naoyuki Tamura},
  title = {Compiling Resources in a Linear Logic Programming Language},
  booktitle = {Proceedings of the Workshop on Parallelism and Implementation Technology
	for Logic Programming Languages},
  year = {1998},
  pages = {32--45},
  month = Jun,
  abstract = {There have been several proposals for logic programming language based
	on linear logic: Lolli, Lygon, LO, LinLog, Forum.
	
	In addition, BinProlog allows the use of linear implications of affine
	logic (a variant of linear logic). In these languages, it is possible
	to create and consume resources dynamically as logical formulas.
	The efficient handling of resource formulas is therefore an important
	issue in the implementation of these languages.
	
	In [10], N. Tamura and Y. Kaneda proposed an abstract machine called
	LLPAM which is an extension of the standard WAM for a linear logic
	programming language called LLP. LLP is a superset of Prolog and
	a subset of Lolli. However, in the original LLPAM design, a resource
	formula was stored as a term in a heap memory and was not compiled
	into LLPAM code.
	
	In this paper, we describe an extension of LLPAM for compiling resource
	formulas. In our extension, resources are compiled into closures
	which consist of compiled code and a variable binding environment.},
  comment = {LLPのリソース式のコンパイルについて述べた論文．},
  file = {:pdf/jicslp98w.pdf:PDF},
  sort = {10040},
  url = {http://dblp.uni-trier.de/db/conf/iclp/iclp98-w1.html#BanbaraT98}
}

@INPROCEEDINGS{TamuraK:FUJI:1996,
  author = {Naoyuki Tamura and Yukio Kaneda},
  title = {Extension of {WAM} for a linear logic programming language},
  booktitle = {Second Fuji International Workshop on Functional and Logic Programming
	(Fuji'96)},
  year = {1996},
  editor = {T. Ida and A. Ohori and M. Takeichi},
  pages = {33--50},
  month = Nov,
  publisher = {World Scientific},
  comment = {LLPの言語と処理系について述べた初期の論文．},
  file = {:pdf/fuji96.pdf:PDF},
  sort = {10050}
}

@INPROCEEDINGS{TamuraK:JICSLP:1996,
  author = {Naoyuki Tamura and Yukio Kaneda},
  title = {Resource Management Method for a Compiler System of a Linear Logic
	Programming Language},
  booktitle = {Proceedings of the 1996 Joint International Conference and Symposium
	on Logic Programming (JICSLP'96)},
  year = {1996},
  pages = {545},
  month = Sep,
  publisher = {MIT Press},
  comment = {LLPの言語と処理系の概要について述べた初期の論文．},
  sort = {10055},
  url = {http://dblp.uni-trier.de/db/conf/iclp/iclp96.html#TamuraK96}
}

@ARTICLE{BanbaraKT:TIPSJ-PRO:1999,
  author = {番原睦則 and 姜京順 and 田村直之},
  title = {線形論理型言語の{Java}言語による処理系の設計と実装},
  journal = {情報処理学会論文誌: プログラミング},
  year = {1999},
  volume = {40},
  pages = {1--16},
  number = {SIG 10 (PRO 5)},
  month = {12月},
  sort = {10110},
  url = {http://ci.nii.ac.jp/naid/110002725190},
  yomi = {Mutsunori Banbara and Kyoung-Sun Kang and Naoyuki Tamura}
}

@INPROCEEDINGS{BanbaraT:ETCS:1999,
  author = {Mutsunori Banbara and Naoyuki Tamura},
  title = {Translating a Linear Logic Programming Language into {Java}},
  booktitle = {Electronic Notes in Theoretical Computer Science},
  year = {1999},
  volume = {30},
  number = {3},
  pages = {19--39},
  month = Nov,
  publisher = {Elsevier},
  optnote = {Proceedings of the Workshop on Parallelism and Implementation Technology
	for (Constraint) Logic Programming Languages},
  sort = {10120},
  url = {http://dblp.uni-trier.de/db/journals/tcs/entcs30.html#BanbaraT99}
}

@INPROCEEDINGS{BanbaraTI:INAP:2005,
  author = {Mutsunori Banbara and Naoyuki Tamura and Katsumi Inoue},
  title = {Prolog Cafe : A Prolog to Java Translator System},
  booktitle = {Lecture Notes in Computer Science 4369: Proceedings of the 16th International
	Conference on Applications of Declarative Programming and Knowledge
	Management (INAP 2005)},
  year = {2005},
  pages = {1--11},
  month = Oct,
  publisher = {Springer},
  doi = {http://dx.doi.org/10.1007/11963578_1},
  sort = {10130},
  url = {http://dblp.uni-trier.de/db/conf/inap/inap2005.html#BanbaraTI05}
}

@ARTICLE{TamuraB:JSAI:2006,
  author = {田村直之 and 番原睦則},
  title = {{Prolog} {Cafe}: {Java}上で動作する{Prolog}処理系},
  journal = {人工知能学会学会誌},
  year = {2006},
  volume = {21},
  pages = {1--8},
  number = {4},
  sort = {10140},
  url = {http://ci.nii.ac.jp/naid/110004745135},
  yomi = {Naoyuki Tamura and Mutsunori Banbara}
}

@ARTICLE{BanbaraTI:COMPSOFT:2007,
  author = {番原睦則 and 田村直之 and 井上克巳},
  title = {{Prolog}から{Java}へのトランスレータ処理系とその応用},
  journal = {コンピュータソフトウェア},
  year = {2007},
  volume = {24},
  pages = {75--86},
  number = {3},
  month = {7},
  sort = {10150},
  url = {http://ci.nii.ac.jp/naid/110006366612},
  yomi = {Mutsunori Banbara and Naoyuki Tamura and Katsumi Inoue}
}

@ARTICLE{TamuraHYKB:TIPSJ-PRO:2000a,
  author = {田村直之 and 平井崇晴 and 吉川英男 and 姜京順 and 番原睦則},
  title = {直観主義時相線形論理における論理プログラミングについて},
  journal = {情報処理学会論文誌: プログラミング},
  year = {2000},
  volume = {41},
  pages = {11--23},
  number = {SIG 4 (PRO 7)},
  month = {6月},
  comment = {時相線形論理に基づいたTLLPの言語について述べた論文．},
  sort = {20010},
  url = {http://ci.nii.ac.jp/naid/110002725385},
  yomi = {Naoyuki Tamura and Takaharu Hirai and Hideo Yoshikawa and Kyoung-Sun
	Kang and Mutsunori Banbara}
}

@ARTICLE{BanbaraKT:TIPSJ-PRO:2001,
  author = {番原睦則 and 姜京順 and 田村直之},
  title = {時相線形論理型言語のコンパイラ処理系のための抽象機械について},
  journal = {情報処理学会論文誌: プログラミング},
  year = {2001},
  volume = {42},
  pages = {52--66},
  number = {SIG 11 (PRO 12)},
  month = {11月},
  comment = {時相線形論理に基づいたTLLPのコンパイラ処理系について述べた論文．},
  sort = {20020},
  url = {http://ci.nii.ac.jp/naid/110002726066},
  yomi = {Mutsunori Banbara and Kyoung-Sun Kang and Naoyuki Tamura}
}

@INPROCEEDINGS{BanbaraKHT:ICLP:2001,
  author = {Mutsunori Banbara and Kyoung-Sun Kang and Takaharu Hirai and Naoyuki
	Tamura},
  title = {Logic programming in a fragment of intuitionistic temporal linear
	logic},
  booktitle = {Lecture Notes in Computer Science 2237: Proceedings of the 2001 International
	Conference on Logic Programming (ICLP 2001)},
  year = {2001},
  pages = {315--330},
  month = Nov,
  publisher = {Springer},
  comment = {時相線形論理に基づいたTLLPのコンパイラ処理系について述べた論文．},
  doi = {http://dx.doi.org/10.1016/S1571-0661(05)80111-2},
  sort = {20030},
  url = {http://dblp.uni-trier.de/db/conf/iclp/iclp2001.html#BanbaraKHT01}
}

@INPROCEEDINGS{TamuraK:IASTED-AI:1997,
  author = {Naoyuki Tamura and Yukio Kaneda},
  title = {A Compiler System of a Linear Logic Programming Language},
  booktitle = {Proceedings of the IASTED International Conference Artificial Intelligence
	and Soft Computing},
  year = {1997},
  pages = {180--183},
  month = Jul,
  file = {:pdf/asc97.pdf:PDF},
  sort = {30010}
}

@INPROCEEDINGS{HodasT:IJCAR:2001,
  author = {Joshua S. Hodas and Naoyuki Tamura},
  title = {LolliCoP -- a linear logic implementation of a lean connection-method
	theorem prover for first-order classical logic},
  booktitle = {Lecture Notes in Computer Science 2083: Proceedings of the International
	Joint Conference on Automated Reasoning 2001},
  year = {2001},
  pages = {670--684},
  month = Jun,
  publisher = {Springer},
  abstract = {When Prolog programs that manipulate lists to manage a collection
	of resources are rewritten to take advantage of the linear logic
	resource management provided by the logic programming language Lolli,
	they can obtain dramatic speedup. Thus far this has been demonstrated
	only for ``toy'' applications, such as n-queens. In this paper we
	present such a reimplementation of the lean connection-calculus prover
	lolliCoP and obtain a theorem prover for first-order classical logic
	which rivals or outperforms state-of-the-art provers on a significant
	body of problems.},
  file = {:pdf/ijcar01.pdf:PDF},
  sort = {30020},
  url = {http://dblp.uni-trier.de/db/conf/cade/ijcar2001.html#HodasT01}
}

@ARTICLE{TamuraB:COMPSOFT:2003,
  author = {田村直之 and 番原睦則},
  title = {{LLPTTP}: 線形論理型言語コンパイラ処理系を用いた定理証明システム},
  journal = {コンピュータソフトウェア},
  year = {2003},
  volume = {20},
  pages = {90--96},
  number = {5},
  month = {9},
  abstract = {一階述語論理の節形式をPrologプログラムに変換し， Prologコンパイラ処理系を用いて定理証明を 行うシステムとしてPTTP
	(Prolog Technology Theorem Prover)が 知られている． 本論文では，節形式を線形論理型言語LLPのプログラムに変換し，
	LLPコンパイラ処理系を用いることで， より効率的な証明探索が可能になることを示す． 特に，証明中のリテラルをリソースとして追加することにより，
	ME (model elimination)処理を高速化している点に特徴がある．},
  file = {:pdf/jssst03.pdf:PDF},
  sort = {30030},
  url = {http://ci.nii.ac.jp/naid/110003743135},
  yomi = {Naoyuki Tamura and Mutsunori Banbara}
}

@ARTICLE{TamuraB:COMPSOFT:2005,
  author = {田村直之 and 番原睦則},
  title = {線形論理型言語コンパイラ処理系を用いた古典命題線形論理の定理証明システム},
  journal = {コンピュータソフトウェア},
  year = {2005},
  volume = {22},
  pages = {98--103},
  number = {1},
  month = {1},
  abstract = {本論文では， 著者らの開発した線形論理型言語コンパイラ処理系のLLPを用いて， 古典命題線形論理の論理式の証明探索を行うシステムLL2LLPについて述べる．
	本システムは，古典命題 線形論理式を直観主義線形論理式に変換し，さらにLLPコンパイラを用いてLLP 抽象機械命令にコンパイルしたのち実行することで高速な証明探索を実現して
	いる点に特徴がある． いくつかの線形論理式に対して，既存の線形論理定理証明システムと 性能を比較した所， ほとんどの問題でより良い結果が得られた．},
  file = {:pdf/jssst04.pdf:PDF},
  sort = {30040},
  url = {http://ci.nii.ac.jp/naid/110003744168},
  yomi = {Naoyuki Tamura and Mutsunori Banbara}
}

@ARTICLE{KangBT:TIPSJ-PRO:2000b,
  author = {姜京順 and 番原睦則 and 田村直之},
  title = {古典線形論理型プログラミング言語の静的解析の一手法について},
  journal = {情報処理学会論文誌: プログラミング},
  year = {2000},
  volume = {41},
  pages = {42--55},
  number = {SIG 4 (PRO 7)},
  month = {6月},
  sort = {40010},
  url = {http://ci.nii.ac.jp/naid/110002725388},
  yomi = {Kyoung-Sun Kang and Mutsunori Banbara and Naoyuki Tamura}
}

@INPROCEEDINGS{KangT:ETCS:1999,
  author = {Kyoung-Sun Kang and Naoyuki Tamura},
  title = {A Static Analysis Method for a Classical Linear Logic Programming
	Language},
  booktitle = {Electronic Notes in Theoretical Computer Science},
  year = {1999},
  volume = {30},
  number = {3},
  pages = {2--18},
  month = Nov,
  publisher = {Elsevier},
  doi = {http://dx.doi.org/10.1016/S1571-0661(05)80112-4},
  optnote = {Proceedings of the Workshop on Parallelism and Implementation Technology
	for (Constraint) Logic Programming Languages},
  sort = {40020},
  url = {http://dblp.uni-trier.de/db/journals/tcs/entcs30.html#KangT99}
}

@INPROCEEDINGS{KangT:ICLP:1999,
  author = {Kyoung-Sun Kang and Naoyuki Tamura},
  title = {A Static Analysis for Classical Linear Logic Programming Language},
  booktitle = {Proceedings of the 1999 International Conference on Logic Programming
	(ICLP'99)},
  year = {1999},
  pages = {610},
  month = Nov,
  publisher = {MIT Press},
  sort = {40030},
  url = {http://dblp.uni-trier.de/db/conf/iclp/iclp99.html#KangT99}
}