Art
J-GLOBAL ID:200902005972741454   Reference number:92A0740439

On the Decidability of Rational Presburger Arithmetic.

有理Presburger算術の決定性について
Author (2):
Material:
Volume:Issue:Page: 432-439  Publication year: Sep. 1992 
JST Material Number: Y0628A  ISSN: 0289-6540  Document type: Article
Article type: 原著論文  Country of issue: Japan (JPN)  Language: JAPANESE (JA)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=92A0740439&from=J-GLOBAL&jstjournalNo=Y0628A") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Theory of computation  ,  Logic algebra 
Reference (9):
  • DAVIS, M. A Computer Program for Presburger's Algorithm. Symbolic Computation Automation of Resoning 1. 41-48
  • IGARASHI, S. The ν-Conversion and an Analytic Semantics. Inf.Proc.83. 1983, 657-668
  • 池田靖雄. NU 解釈系の設計. 日本ソフトウェア科学会第7回大会諭文集. 1990, 293-296
  • 池田靖雄. 高階論理型プログラム言語 NU の処理系に関する研究. 筑波大学工学研究科修士論文. 1989
  • KAUFL, T. Reasoning Systems of Linear Inequalities. 9th International Conference on automated Deduction. Proceedings of conference held in Argonne. 1988, 563-572
more...
Terms in the title (1):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page