Faculty Profiles - NISHIDA Naoki

Papers - NISHIDA Naoki

Division display 121 - 140 of about 247 ／ All the affair displays >>

Evaluation of Parallel Execution of an Implementation of Breadth-First-Search-based Completion Procedures in Erlang

Ryutaro Kuriki, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai and Keiichirou Kusakari

Record of 2013 Tokai-Section Joint Conference on Electrical and Related Engineering ( M2-5 ) page： 1 2013.9

Term Rewriting with Logical Constraints Reviewed

Cynthia Kop and Naoki Nishida

Proceedings of the 9th International Symposium on Frontiers of Combining Systems, Lecture Notes in Artificial Intelligence ( 8152 ) page： 343-358 2013.9

Malbolge with 20trits word length and its programming support tool

Tatsuki Kato, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari and Naoki Nishida

IEICE Technical Rerport Vol. 113 ( 159 ) page： 73-78 2013.7

Proving Confluence of Conditional Term Rewriting Systems via Unravelings Reviewed

Karl Gmeiner, Naoki Nishida and Bernhard Gramlich

Proceedings of the 2nd International Workshop on Confluence page： 35-39 2013.6

Computing More Specific Versions of Conditional Rewriting Systems Reviewed

Naoki Nishida and German Vidal

Revised Selected Papers of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation, Lecture Notes in Computer Science Vol. 7844 page： 137-154 2013.4

Improving Determinization of Grammar Programs for Program Inversion Reviewed

Minami Niwa, Naoki Nishida, and Masahiko Sakai

Revised Selected Papers of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation, Lecture Notes in Computer Science Vol. 7844 page： 155-175 2013.4

On Composing the Simplex Method and Gomory Cut for Deriving Integer Assignments

Masaaki Fushimi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe

IEICE Technical Rerport Vol. 112 ( 458 ) page： 109-114 2013.3

Construction of Constrained Tree Automata Recognizing Ground Instances of Constrained Terms

Yasuhiro Nakano, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari

IEICE Technical Rerport Vol. 112 ( 373 ) page： 7-12 2013.1

Using SAT Solvers for Solving Control-Instruction Layout Problems in Low-Level Assembly Programming for Malbolge

Satoshi Ando, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari and Naoki Nishida

IEICE Technical Rerport Vol. 112 ( 373 ) page： 25-30 2013.1

A SAT Encoding for Finding Operation Sequences of Malbolge that Implement Trit-wise Functions

Satoshi Ando, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari and Naoki Nishida

IEICE Technical Rerport Vol. 112 ( 275 ) page： 7-12 2012.11

Formula transformation for sequential composition of Cooper's quantifier elimination and the general simplex method

Masaaki Fushimi, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, and Keiichirou Kusakari

Record of 2012 Tokai-Section Joint Conference on Electrical and Related Engineering ( A4-2 ) page： 1 2012.9

On Constructing Constrained Tree Automaton Recognizing Ground Instances of Constrained Terms

Yasuhiro Nakano, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari

Record of 2012 Tokai-Section Joint Conference on Electrical and Related Engineering ( A4-4 ) page： 1 2012.9

Currying for Proving Termination of Simply-Typed Term Rewriting Systems

Keisuke Kurata, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida

Record of 2012 Tokai-Section Joint Conference on Electrical and Related Engineering ( A4-3 ) page： 1 2012.9

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity Invited Reviewed

Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe

Logical Methods in Computer Science Vol. 8 ( 3-4 ) page： 1-49 2012.8

Authorship：Lead author Language：English Publishing type：Research paper (scientific journal)

Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound w.r.t. reduction for every CTRS, while they are complete w.r.t. reduction. Here, soundness w.r.t. reduction means that every reduction sequence of the corresponding unraveled TRS, of which the initial and end terms are over the original signature, can be simulated by the reduction of the original CTRS. In this paper, we show that an optimized variant of Ohlebusch's unraveling for a deterministic CTRS is sound w.r.t. reduction if the corresponding unraveled TRS is left-linear or both right-linear and non-erasing. We also show that soundness of the variant implies that of Ohlebusch's unraveling. Finally, we show that soundness of Ohlebusch's unraveling is the weakest in soundness of the other unravelings and a transformation, proposed by Serbanuta and Rosu, for (normal) deterministic CTRSs, i.e., soundness of them respectively implies that of Ohlebusch's unraveling.

DOI： 10.2168/LMCS-8(3:4)2012

On Extending Matching Operation in Grammar Programs for Program Inversion

Minami Niwa, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe and Keiichirou Kusakari

IEICE Technical Rerport Vol. 112 ( 164 ) page： 103-108 2012.7

Constrained Tree Automata and their Closure Properties Reviewed

Naoki Nishida, Futoshi Nomura, Katsuhisa Kurahashi and Masahiko Sakai

Proceedings of the 1st International Workshop on Trends in Tree Automata and Tree Transducers page： 24-34 2012.6

More Specific Term Rewriting Systems Reviewed

Naoki Nishida and German Vidal

Proceedings of the 21st International Workshop on Functional and (Constraint) Logic Programming page： 1-15 2012.5

Introducing Array Mechanism into High-Level Assembly Language for Malbolge

Satoshi Ando, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari and Naoki Nishida

IEICE Technical Rerport Vol. 112 ( 23 ) page： 43-49 2012.5

A Sound Type System for Typing Runtime Errors Reviewed

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, and Naoki Nishida

IPSJ Transactions on Programming, Vol. 5 ( 2 ) page： 16-24 2012.3

On Rewriting Induction for Simply-typed Term Rewriting Systems

Akira Ozeki, Keiichirou Kusakari, Tsubasa Sakata, Naoki Nishida, Masahiko Sakai and Toshiki Sakabe

IEICE Technical Rerport Vol. 111 ( 406 ) page： 51-56 2012.1

　 PREV - NEXT 　

<NISHIDA Naoki>

Papers - NISHIDA Naoki