SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1232, Issue , 1997, Pages 241-253

Undecidability of the first order theory of one-step right ground rewriting

(1) Marcinkowski, Jerzy a

a UNIVERSITY OF WROC AW (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FIRST ORDER THEORIES; GROUND SYSTEMS; KNOWLEDGE IT; REWRITING SYSTEMS; UNDECIDABILITY;

LOGIC PROGRAMMING;

EID: 84947781530 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-62950-5_75 Document Type: Conference Paper

Times cited : (17)

References (10)

1
- 0001431539
- Encompassment Properties and Automata with Constraints
- (Springer LNCS vol. 690) [CCD93]
- A-C Caron, J-L Coquide, M. Dauchet, Encompassment Properties and Automata with Constraints Proceedings of 5th RTA, 1993, (Springer LNCS vol. 690) pp. 328-342
- (1993) Proceedings of 5th RTA , pp. 328-342
- Caron, A.-C.¹ Coquide, J.-L.² Dauchet, M.³

2
- 0001564654
- More Problems in Rewriting
- (Springer LNCS), [DJK93]
- N. Dershowitz, J-P Jouannaud, J. W. Klop, More Problems in Rewriting, Proceedings of 5th RTA, 1993, (Springer LNCS vol. 690) pp. 468-487
- (1993) Proceedings of 5th RTA , vol.690 , pp. 468-487
- Dershowitz, N.¹ Jouannaud, J.-P.² Klop, J.W.³

3
- 84955562470
- Problems in Rewriting III
- (Springer LNCS), [DJK95]
- N. Dershowitz, J-P Jouannaud, J. W. Klop, Problems in Rewriting III, Proceedings of RTA 95, (Springer LNCS vol. 914) pp 457-471
- Proceedings of RTA 95 , vol.914 , pp. 457-471
- Dershowitz, N.¹ Jouannaud, J.-P.² Klop, J.W.³

4
- 0025596345
- The theory of ground rewrite systems is dectdable
- IEEE Press, [DT90]
- M. Dauchet, S. Tison. The theory of ground rewrite systems is dectdable, Proceedings of 5th IEEE LICS, pp 242-256, IEEE Press 1990
- (1990) Proceedings of 5th IEEE LICS , pp. 242-256
- Dauchet, M.¹ Tison, S.²

5
- 30244556588
- Undecidability of the Horn Clause Implication Problem
- Los Alamitos [MP92]
- J. Marcinkowski, L. Pacholski, Undecidability of the Horn Clause Implication Problem, Proceedings of 33th IEEE FOCS, pp 354-362 Los Alamitos 1992
- (1992) Proceedings of 33th IEEE FOCS , pp. 354-362
- Marcinkowski, J.¹ Pacholski, L.²

6
- 84995795536
- A Horn Clause that Implies an Undecidable Set of Horn Clauses
- (Springer), LNCS 832, [M93]
- J. Marcinkowski, A Horn Clause that Implies an Undecidable Set of Horn Clauses, Proceedings of the 1993 Annual Conference of the European Association of Computer Science Logic. (Springer, 1994), LNCS 832, pp 223-237.
- (1994) Proceedings of the 1993 Annual Conference of the European Association of Computer Science Logic , pp. 223-237
- Marcinkowski, J.¹

7
- 84947735467
- Grid Structures and Undecidable Properties
- to appear in [STT97]
- F. Seynhaeve, M. Tommasi, R. Treinen, Grid Structures and Undecidable Properties, to appear in Proceedings of TAPSOFT 97
- Proceedings of TAPSOFT 97
- Seynhaeve, F.¹ Tommasi, M.² Treinen, R.³

8
- 84947789500
- The First-Order Theory of One-Step Rewriting is Undecidable
- (Springer LNCS). [T96]
- R. Treinen, The First-Order Theory of One-Step Rewriting is Undecidable, Proceedings of RTA 1996, (Springer LNCS).
- (1996) Proceedings of RTA
- Treinen, R.¹

9
- 84947778627
- [V95]
- S. Vorobyov, Elementary theory of one step rewriting is undecidable, draft 1995.
- (1995) Elementary theory of one step rewriting is undecidable, draft
- Vorobyov, S.¹

10
- 84947776887
- (Springer LNCS). [V96]
- S. Vorobyov, The first-order theory of one step rewriting in Unear Noethe- rian systems is undecidable, this volume.
- The first-order theory of one step rewriting in Unear Noethe- rian systems is undecidableX
- Vorobyov, S.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.