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

메뉴 건너뛰기

Applicable Algebra in Engineering, Communications and Computing

Volumn 12, Issue 1-2, 2001, Pages 73-116

Termination of logic programs: Transformational methods revisited

(1) Ohlebusch, Enno a

a BIELEFELD UNIVERSITY (Germany)

Author keywords

Logic programs; Term rewriting systems; Termination; Transformations

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; PROGRAM INTERPRETERS;

DEPENDENCY PAIR TECHNIQUES; TERM REWRITING SYSTEMS;

LOGIC PROGRAMMING;

EID: 0034960719 PISSN: 09381279 EISSN: None Source Type: Journal
DOI: 10.1007/s002000100064 Document Type: Article

Times cited : (37)

References (41)

1
- 0040622367
- Proving termination of logic programs by transforming them into equivalent term rewriting systems
- Lecture Notes in Computer Science, Berlin: Springer
- (1993) Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science , vol.761 , pp. 114-124
- Aguzzi, G.¹ Modigliani, U.²

2
- 0003400084
- Englewood Cliffs, NJ: Prentice-Hall
- (1997) From Logic Programming to Prolog
- Apt, K.R.¹

3
- 84957630896
- On the unification free Prolog programs
- Lecture Notes in Computer Science, Berlin: Springer
- (1993) Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science , vol.711 , pp. 1-19
- Apt, K.R.¹ Etalle, S.²

4
- 0003144205
- Modular termination proofs for logic and pure Prolog programs
- Oxford University Press
- (1994) Advances in Logic Programing , pp. 183-229
- Apt, K.R.¹ Pedreschi, D.H.²

5
- 0028429698
- On the occur-check free Prolog programs
- (1994) ACM Trans. Program. Lang. Syst. , vol.16 , Issue.3 , pp. 687-726
- Apt, K.R.¹ Pellegrini, A.²

6
- 0003899169
- PhD thesis, Utrecht University
- (1997) Automatically Proving Termination and Innermost Normalisation of Term Rewriting Systems
- Arts, T.¹

7
- 84937426338
- System description: The dependency pair method
- Lecture Notes in Computer Science, Berlin: Springer
- (2000) Proceedings of the 11th International Conference on Rewriting Techniques and Applications , vol.1833 , pp. 261-264
- Arts, T.¹

8
- 84958750767
- Modularity of termination using dependency pairs
- Lecture Notes in Computer Science, Berlin: Springer
- (1998) Proceedings of the 9th International Conference on Rewriting Techniques and Applications , vol.1379 , pp. 226-240
- Arts, T.¹ Giesl, J.²

9
- 0001193616
- Termination of term rewriting using dependency pairs
- (2000) Theor. Comp. Sci. , vol.236 , pp. 133-178
- Arts, T.¹ Giesl, J.²

10
- 0004665691
- Termination of logic programs via labelled term rewrite systems
- (1995) Proceedings of Computing Science in the Netherlands , pp. 22-34
- Arts, T.¹ Zantema, H.²

11
- 84858906826
- Termination of logic programs using semantic unification
- Lecture Notes in Computer Science, Berlin: Springer
- (1996) Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation , vol.1048 , pp. 219-233
- Arts, T.¹ Zantema, H.²

12
- 56349155846
- On conditional rewrite systems with extra variables and deterministic logic programs
- Lecture Notes in Artificial Intelligence, Berlin: Springer
- (1994) Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning , vol.822 , pp. 215-229
- Avenhaus, J.¹ Loría-Sátenz, C.²

13
- 0003650163
- Cambridge University Press
- (1998) Term Rewriting and All That
- Baader, F.¹ Nipkow, T.²

14
- 0022738654
- Conditional rewrite rules: Confluence and termination
- (1986) J. Comput. Syst. Sci. , vol.32 , Issue.3 , pp. 323-362
- Bergstra, J.A.¹ Klop, J.W.²

15
- 4244218266
- Unpublished manuscript in French
- (1993) Méthode transformationnelle pour la preuve de terminaison des programmes logiques
- Chtourou, M.¹ Rusinowitch, M.²

16
- 0004684189

17
- 0032678119
- A semantic basis for the termination analysis of logic programs
- (1999) J. Log. Program. , vol.41 , pp. 103-123
- Codish, M.¹ Taboch, C.²

18
- 84957684590
- CiME: Completion Modulo E
- Lecture Notes in Computer Science, Berlin: Springer
- (1996) Proceedings of the 7th International Conference on Rewriting Techniques and Applications , vol.1103 , pp. 416-419
- Contejean, E.¹ Marché, C.²

19
- 0001004312
- Constraint-based termination analysis of logic programs
- (1999) ACM Trans. Program. Lang. Syst. , vol.21 , pp. 1137-1195
- Decorte, S.¹ De Schreye, D.² Vandecasteele, H.³

20
- 0022186245
- AND-parallelism with intelligent backtracking for annotated logic programs
- (1985) Proceedings of the 2nd IEEE Symposium on Logic Programming , pp. 29-38
- Dembinski, P.¹ Maluszynski, J.²

21
- 84910829499
- Termination of rewriting
- (1987) J. Symbol. Comput. , vol.3 , Issue.1 , pp. 69-116
- Dershowitz, N.¹

22
- 0001962835
- Order-sorted completion: The many-sorted way
- (1991) Theor. Comput. Sci. , vol.89 , pp. 3-32
- Ganzinger, H.¹

23
- 0039833106
- Termination proofs of well-moded logic programs via conditional rewrite systems
- Lecture Notes in Computer Science, Berlin: Springer
- (1993) Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems , vol.656 , pp. 113-127
- Ganzinger, H.¹ Waldmann, U.²

24
- 0034952405
- Verification of Erlang processes by dependency pairs
- (2001) AAECC , vol.12 , pp. 39-72
- Giesl, J.¹ Arts, T.²

25
- 0001894539
- Pushing the frontiers of combining rewrite systems farther outwards
- Research Studies Press Ltd.
- (2000) Frontiers of Combining Systems 2 (Proceedings of the 2nd International Workshop on Frontiers of Combining Systems) , pp. 141-160
- Giesl, J.¹ Ohlebusch, E.²

26
- 0040425687
- A transformational methodology for proving termination of logic programs
- Lecture Notes in Computer Science, Berlin: Springer
- (1992) Proceedings of the 5th Workshop on Computer Science Logic , vol.626 , pp. 213-226
- Krishna Rao, M.R.K.¹ Kapur, D.² Shyamasundar, R.K.³

27
- 0039346788
- Transformational methodology for proving termination of logic programs
- A preliminary version appeared in [26]
- (1998) J. Log. Program. , vol.34 , Issue.1 , pp. 1-42
- Krishna Rao, M.R.K.¹ Kapur, D.² Shyamasundar, R.K.³

28
- 0001858814
- Technical report, Hebrew University, Jerusalem. Test suites http://www.cs.huji.ac.il/~naomil/
- (1997) Automatic termination analysis of logic programs (with detailed experimental results)
- Lindenstrauss, N.¹ Sagiv, Y.²

29
- 0003453263
- Berlin Heidelberg New York: Springer
- (1987) Foundations of Logic Programming
- Lloyd, J.¹

30
- 84949197430
- Logic programs as term rewriting systems
- Lecture Notes in Computer Science Berlin: Springer
- (1994) Proceedings of the 4th International Conference on Algebraic and Logic Programming , vol.850 , pp. 223-241
- Marchiori, M.¹

31
- 84958750586
- Unravelings and ultra-properties
- Lecture Notes in Computer Science, Berlin: Springer
- (1996) Proceedings of the 5th International Conference on Algebraic and Logic Programming , vol.1139 , pp. 107-121
- Marchiori, M.¹

32
- 4243250294
- Computation Structures Group, Memo 405, MIT Laboratory for Computer Science
- (1997) On deterministic conditional rewriting
- Marchiori, M.¹

33
- 84957686824
- On quasi-reductive and quasi-simplifying deterministic conditional rewrite systems
- Lecture Notes in Computer Science, Berlin: Springer
- (1999) Proceedings of the 4th International Symposium on Functional and Logic Programming , vol.1722 , pp. 179-193
- Ohlebusch, E.¹

34
- 33749391066
- Transforming conditional rewrite systems with extra variables into unconditional systems
- Lecture Notes in Artificial Intelligence Berlin: Springer
- (1999) Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning , vol.1705 , pp. 111-130
- Ohlebusch, E.¹

35
- 84937438740
- TALP: A tool for the termination analysis of logic programs
- Lecture Notes in Computer Science, Berlin: Springer System
- (2000) Proceedings of the 11th International Conference on Rewriting Techniques and Applications , vol.1833 , pp. 270-273
- Ohlebusch, E.¹ Claves, C.² Marché, C.³

36
- 0040029222
- Lecture Notes in Artificial Intelligence. Berlin: Springer
- (1990) Termination Proofs for Logic Programs , vol.446
- Plümer, L.¹

37
- 0004695316
- Translating logic programs into conditional rewriting systems
- Cambridge, MA: MIT Press
- (1997) Proceedings of the 14th International Conference on Logic Programming , pp. 168-182
- Van Raamsdonk, F.¹

38
- 0028429645
- Termination of logic programs: The never-ending story
- (1994) J. Log. Program , vol.19-20 , pp. 199-260
- De Schreye, D.¹ Decorte, S.²

39
- 84890082647
- Termination analysis for Mercury
- Lecture Notes in Computer Science, Berlin: Springer. The Mercury system
- (1997) Proceedings of the 4th International Symposium on Static Analysis , vol.1302 , pp. 157-171
- Speirs, C.¹ Somogyi, Z.² Søndergaard, H.³

40
- 0004695317
- Elimination of conditions
- (1999) J. Symbol. Comput. , vol.28 , pp. 381-400
- Viry, P.¹

41
- 0001845757
- Termination of term rewriting: Interpretation and type elimination
- (1994) J. Symbol. Comput. , vol.17 , pp. 23-50
- Zantema, H.¹

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