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

메뉴 건너뛰기

Journal of Symbolic Computation

Volumn 33, Issue 6, 2002, Pages 777-829

Cancellative Abelian monoids and related structures in refutational theorem proving (Part I)

(1) Waldmann, Uwe a

a MAX PLANCK INSTITUTE FOR INFORMATICS (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036633404 PISSN: 07477171 EISSN: None Source Type: Journal
DOI: 10.1006/jsco.2002.0536 Document Type: Article

Times cited : (9)

References (34)

1
- 0003295641
- Associative-commutative superposition
- Dershowitz, N., Lindenstrauss, N. eds 4th International Workshop, CTRS-94, LNCS, Jerusalem, Israel, Springer
- (1994) Conditional and Typed Rewriting Systems , vol.968 , pp. 1-14
- Bachmair, L.¹ Ganzinger, H.²

2
- 0005483198
- Rewrite-based equational theorem proving with selection and simplification
- (1994) J. Logic Comput , vol.4 , pp. 217-247
- Bachmair, L.¹ Ganzinger, H.²

3
- 0005401419
- Refutational theorem proving for hierarchic first-order theories
- (1994) Appl. Algebra Eng. Commun. Comput , vol.5 , pp. 193-212
- Bachmair, L.¹ Ganzinger, H.² Waldmann, U.³

4
- 0023437488
- Termination of rewriting systems by polynomial interpretations and its implementation
- (1987) Sci. Comput. Program , vol.9 , pp. 137-159
- Ben Cherifa, A.¹ Lescanne, P.²

5
- 84957637895
- AC-complete unification and its application to theorem proving
- Ganzinger, H. ed. 7th International Conference, RTA-96, LNCS 1103, New Brunswick, NJ, USA, Springer Rewriting Techniques and Applications
- (1996) , pp. 18-32
- Boudet, A.¹ Contejean, E.² Marché, C.³

6
- 0002457511
- Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic
- Hayes, J. E., Michie, D., Richards, J. eds, chapter 5, Oxford University Press
- (1988) Machine Intelligence 11: Logic and the Acquisition of Knowledge , pp. 83-124
- Boyer, R.S.¹ Moore, J.S.²

7
- 0005398778
- Symbolic computation: Computer algebra and logic
- Baader, F., Schulz, K. U. eds First International Workshop, of Applied Logic Series, Munich, Germany, Kluwer Academic Publishers
- (1996) Frontiers of Combining Systems , vol.3 , pp. 193-219
- Buchberger, B.¹

8
- 0000029077
- Rewrite systems
- van Leeuwen, J. ed. chapter 6, Amsterdam, The Netherlands, Elsevier Science Publishers B.V
- (1990) Handbook of Theoretical Computer Science Volume B: Formal Models and Semantics , pp. 243-320
- Dershowitz, N.¹ Jouannaud, J.-P.²

9
- 0003631434
- New York, NY, USA, Springer
- (1990) First-Order Logic and Automated Theorem Proving
- Fitting, M.¹

10
- 79955723230
- Theorem proving in cancellative abelian monoids
- McRobbie, M. A., Slaney, J. K. eds Automated Deduction-CADE-13 13th International Conference on Automated Deduction, LNAI 1104, New Brunswick, NJ, USA, Springer (extended abstract)
- (1996) , pp. 388-402
- Ganzinger, H.¹ Waldmann, U.²

11
- 0033718535
- Paramodulation with built-in abelian groups
- Fifteenth Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, USA, Los Alamitos, CA, USA, IEEE Computer Society
- (2000) , pp. 413-424
- Godoy, G.¹ Nieuwenhuis, R.²

12
- 0000273239
- Proving refutational completeness of theorem-proving strategies: The transfinite semantic tree method
- (1991) J. ACM , vol.38 , pp. 559-587
- Hsiang, J.¹ Rusinowitch, M.²

13
- 26144458583
- Complete inference rules for the cancellation laws
- (extended abstract), McDermott, J. ed., Proceedings of the Tenth International Joint Conference on Artificial Intelligence 2, Milan, Italy, Morgan Kaufmann Publishers
- (1987) , pp. 990-992
- Hsiang, J.¹ Rusinowitch, M.² Sakai, K.³

14
- 38249008584
- Termination and completion modulo associativity, commutativity and identity
- (1992) Theor. Comput. Sci , vol.104 , pp. 29-51
- Jouannaud, J.-P.¹ Marché, C.²

15
- 0000365516
- Complexity of unification problems with associative-commutative operators
- (1992) J. Autom. Reasoning , vol.9 , pp. 261-288
- Kapur, D.¹ Narendran, P.²

16
- 0026881401
- Double-exponential complexity of computing a complete set of AC-unifiers
- Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, USA, IEEE Computer Society Press
- (1992) , pp. 11-21
- Kapur, D.¹ Narendran, P.²

17
- 0030101584
- Normalized rewriting: An alternative to rewriting modulo a set of equations
- (1996) J. Symb. Comput , vol.21 , pp. 253-288
- Marché, C.¹

18
- 84957640139
- AC-superposition with constraints: No AC-unifiers needed
- Bundy, A. ed., Twelfth International Conference on Automated Deduction, LNAI 814, Nancy, France, Springer
- (1994) , pp. 545-559
- Nieuwenhuis, R.¹ Rubio, A.²

19
- 0003038966
- Using forcing to prove completeness of resolution and paramodulation
- (1991) J. Symb. Comput , vol.11 , pp. 3-19
- Pais, J.¹ Peterson, G.E.²

20
- 0001382977
- A general refutational completeness result for an inference procedure based on associative-commutative unification
- (1992) J. Symb. Comput , vol.14 , pp. 577-618
- Paul, E.¹

21
- 0002336404
- A technique for establishing completeness results in theorem proving with equality
- (1983) SIAM J. Comput , vol.12 , pp. 82-100
- Peterson, G.E.¹

22
- 84976823860
- Complete sets of reductions for some equational theories
- (1981) J. ACM , vol.28 , pp. 233-264
- Peterson, G.E.¹ Stickel, M.E.²

23
- 0002596558
- Building-in equational theories
- Meltzer, B., Michie, D. eds chapter 4, New York, NY, USA, American Elsevier
- (1972) Machine Intelligence 7 , pp. 73-90
- Plotkin, G.D.¹

24
- 4243484200
- chapitre 7: ensembles complets de règles d'inférence pour les axiomes derégularité, Paris, France, InterEditions
- (1989) Démonstration Automatique: Techniques de Rééecriture , pp. 111-127
- Rusinowitch, M.¹

25
- 84947911578
- Theorem-proving with resolution and superposition
- (1991) J. Symb. Comput , vol.11 , pp. 21-49
- Rusinowitch, M.¹

26
- 0029234085
- Automated deduction with associative-commutative operators
- (1995) Appl. Algebra Eng. Commun. Comput , vol.6 , pp. 23-56
- Rusinowitch, M.¹ Vigneron, L.²

27
- 0018454851
- A practical decision procedure for arithmetic with function symbols
- (1979) J. ACM , vol.26 , pp. 351-360
- Shostak, R.E.¹

28
- 0016115108
- Automated theorem-proving for theories with simplifiers, commutativity, and associativity
- (1974) J. ACM , vol.21 , pp. 622-642
- Slagle, J.R.¹

29
- 84957617657
- Superposition theorem proving for Abelian groups represented as integer modules
- Ganzinger, H. ed. 7th International Conference, RTA-96, LNCS 1103, New Brunswick, NJ, USA, Springer
- (1996) Rewriting Techniques and Applications , pp. 33-47
- Stuber, J.¹

30
- 85026904413
- Associative-commutative deduction with constraints
- Bundy, A. ed., Twelfth International Conference on Automated Deduction, LNAI 814, Nancy, France, Springer
- (1994) , pp. 530-544
- Vigneron, L.¹

31
- 0004196657
- Dissertation, Universität des Saarlandes, Saarbrücken, Germany
- (1997) Cancellative Abelian Monoids in Refutational Theorem Proving
- Waldmann, U.¹

32
- 0036636086
- Cancellative abelian monoids and related structures in refutational theorem proving
- (part II) [this volume/number]
- (2002) J. Symb. Comput
- Waldmann, U.¹

33
- 0004037628
- Technical Report MPI-I-92-216, Saarbrücken, Germany, Max-Planck-Institut für Informatik
- (1992) First-order Theorem Proving Modulo Equations
- Wertz, U.¹

34
- 85034850917
- First-order theorem proving using conditional rewrite rules
- Lusk, E., Overbeek, R. eds, 9th International Conference on Automated Deduction, LNCS Argonne, Illinois, USA, Springer
- (1988) , vol.310 , pp. 1-20
- Zhang, H.¹ Kapur, D.²

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