Paper Abstract and Keywords |
Presentation |
2013-01-10 13:30
Construction of Constrained Tree Automata Recognizing Ground Instances of Constrained Terms Yasuhiro Nakano, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
A theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for R-completeness of constrained term rewriting systems.
In addition, sufficient completeness of constrained term rewriting systems enables us to relax the side conditions of some inference rules in the proving method.
These two properties of constrained term rewriting systems can be reduced to intersection emptiness problems related to sets of ground instances for constrained terms.
In this paper, we propose a method to construct constrained tree automata recognizing ground instances of constrained terms.
We also propose a method to remove states from a constrained tree automaton, to which no ground term transitions, thus improving the accuracy for the judgements of R-completeness and sufficient completeness. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
constrained term rewriting system / intersection emptiness problem / sufficient completeness / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 112, no. 373, SS2012-47, pp. 7-12, Jan. 2013. |
Paper # |
SS2012-47 |
Date of Issue |
2013-01-03 (SS) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Download PDF |
|
Conference Information |
Committee |
SS |
Conference Date |
2013-01-10 - 2013-01-11 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
|
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
SS |
Conference Code |
2013-01-SS |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Construction of Constrained Tree Automata Recognizing Ground Instances of Constrained Terms |
Sub Title (in English) |
|
Keyword(1) |
constrained term rewriting system |
Keyword(2) |
intersection emptiness problem |
Keyword(3) |
sufficient completeness |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yasuhiro Nakano |
1st Author's Affiliation |
Nagoya University (Nagoya Univ.) |
2nd Author's Name |
Naoki Nishida |
2nd Author's Affiliation |
Nagoya University (Nagoya Univ.) |
3rd Author's Name |
Masahiko Sakai |
3rd Author's Affiliation |
Nagoya University (Nagoya Univ.) |
4th Author's Name |
Toshiki Sakabe |
4th Author's Affiliation |
Nagoya University (Nagoya Univ.) |
5th Author's Name |
Keiichirou Kusakari |
5th Author's Affiliation |
Nagoya University (Nagoya Univ.) |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2013-01-10 13:30:00 |
Presentation Time |
30 minutes |
Registration for |
SS |
Paper # |
SS2012-47 |
Volume (vol) |
vol.112 |
Number (no) |
no.373 |
Page |
pp.7-12 |
#Pages |
6 |
Date of Issue |
2013-01-03 (SS) |