×

zbMATH — the first resource for mathematics

Kapur, Deepak

Compute Distance To:
Author ID: kapur.deepak Recent zbMATH articles by "Kapur, Deepak"
Published as: Kapur, D.; Kapur, Deepak
Documents Indexed: 141 Publications since 1982, including 8 Books
all top 5

Co-Authors

14 single-authored
28 Narendran, Paliath
11 Zhang, Hantao
10 Falke, Stephan
9 Chtcherba, Arthur D.
8 Musser, David R.
8 Subramaniam, Mahadevan
7 Sun, Yao
7 Wang, Dingkang
6 Sivakumar, G. D.
6 Zhan, Naijun
5 Erbatur, Serdar
5 Rodríguez-Carbonell, Enric
4 Giesl, Jürgen
4 Krishnamoorthy, Mukkai S.
4 Marshall, Andrew M.
4 Mundy, Joseph L.
4 Saxena, Tushar
4 Srivas, Mandayam K.
3 Kandri-Rody, Abdelilah
3 Minimair, Manfred
3 Ringeissen, Christophe
3 Weidenbach, Christoph
3 Zhao, Hengjun
2 Benanav, Dan
2 Chen, Mingshuai
2 Demri, Stéphane P.
2 Fränzle, Martin
2 Gao, Xiaoshan
2 Guttag, John V.
2 Lu, Dong
2 McNaughton, Robert
2 Meadows, Catherine A.
2 Meseguer Guaita, José
2 Mohan, Chilukuri Krishna
2 Monagan, Michael B.
2 Nguyen, Thanhvu H.
2 Rao, M. R. K. Krishna
2 Shyamasundar, Rudrapatna Kallikote
2 Stillman, Jonathan
2 Wang, Lida
2 Winter, Victor L.
2 Zhang, Zhihai
1 An, Jie
1 Barry, Michele
1 Berg, Raymond S.
1 Cai, Yongyang
1 Cyrluk, David A.
1 Dai, Liyun
1 Donald, Bruce Randall
1 Escobar, Santiago
1 Forrest, Stephanie
1 Gan, Ting
1 Hendrix, Joe
1 Hong, Hoon
1 Horbach, Matthias
1 Hung, Dang Van
1 Larsen, Kim Guldstrand
1 Liu, Zhiqiang
1 Lu, Qi
1 Lynch, Christopher A.
1 Madlener, Klaus E.
1 Majumdar, Rupak
1 Marron, Mark
1 McAllester, David Allen
1 Nguyen, Van- Duc
1 Nie, Xiangfei
1 Nieuwenhuis, Robert
1 Otto, Friedrich
1 Paule, Peter
1 Rosenkrantz, Daniel J.
1 Sakhanenko, Nikita A.
1 Santiago, Sonia
1 Sasse, Ralf
1 Sinz, Carsten
1 Stefanovic, Darko
1 Van Hentenryck, Pascal
1 Vigneron, Laurent
1 Voronkov, Andrei
1 Wang, Jian
1 Wehrheim, Heike
1 Weimer, Westley
1 Wilhelm, Reinhard
1 Winkler, Franz
1 Xia, Bican
1 Yang, Lu
1 Yang, Yiming
1 Zhan, Bohua
1 Zhou, Jie

Publications by Year

Citations contained in zbMATH

103 Publications have been cited 840 times in 562 Documents Cited by Year
A finite Thue system with decidable word problem and without equivalent finite canonical system. Zbl 0588.03023
Kapur, Deepak; Narendran, Paliath
33
1985
Using Gröbner bases to reason about geometry problems. Zbl 0629.68087
Kapur, Deepak
30
1986
Algebraic and geometric reasoning using Dixon resultants. Zbl 0964.68536
Kapur, Deepak; Saxena, Tushar; Yang, Lu
29
1994
A completion procedure for computing a canonical basis for a k- subalgebra. Zbl 0692.13001
Kapur, Deepak; Madlener, Klaus
28
1989
On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
25
1987
Solving polynomial systems using a branch and prune approach. Zbl 0874.65039
Van Hentenryck, Pascal; McAllester, David; Kapur, Deepak
24
1997
Proof by consistency. Zbl 0631.68073
Kapur, Deepak; Musser, David R.
23
1987
The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010
Kapur, Deepak; Narendran, Paliath
23
1985
A new algorithm for computing comprehensive Gröbner systems. Zbl 1321.68533
Kapur, Deepak; Sun, Yao; Wang, Dingkang
22
2010
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain. Zbl 0658.13016
Kandri-Rody, Abdelilah; Kapur, Deepak
21
1988
Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings. Zbl 0564.13001
Kandri-Rody, Abdelilah; Kapur, Deepak
20
1984
Generating all polynomial invariants in simple loops. Zbl 1121.13034
Rodríguez-Carbonell, E.; Kapur, D.
19
2007
Complexity of unification problems with associative-commutative operators. Zbl 0781.68076
Kapur, Deepak; Narendran, Paliath
19
1992
A mechanizable induction principle for equational specifications. Zbl 0657.68103
Zhang, Hantao; Kapur, Deepak; Krishnamoorthy, Mukkai S.
19
1988
A refutational approach to geometry theorem proving. Zbl 0678.68094
Kapur, Deepak
18
1988
Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032
Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao
17
1991
Complexity of matching problems. Zbl 0638.68036
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
17
1987
NP-completeness of the set unification and matching problems. Zbl 0643.68054
Kapur, Deepak; Narendran, Paliath
17
1986
Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029
Kapur, Deepak; Musser, David R.; Narendran, Paliath
16
1988
Shostak’s congruence closure as completion. Zbl 1379.68196
Kapur, Deepak
15
1997
Comparison of various multivariate resultant formulations. Zbl 0916.65048
Kapur, Deepak; Saxena, Tushar
15
1995
Wu’s method and its application to perspective viewing. Zbl 0664.68102
Kapur, Deepak; Mundy, Joseph L.
14
1988
Automatic generation of polynomial loop invariants: algebraic foundations. Zbl 1108.13310
Rodríguez-Carbonell, Enric; Kapur, Deepak
13
2004
On proving uniform termination and restricted termination of rewriting systems. Zbl 0526.68036
Guttag, J. V.; Kapur, D.; Musser, D. R.
13
1983
An efficient method for computing comprehensive Gröbner bases. Zbl 1283.13024
Kapur, Deepak; Sun, Yao; Wang, Dingkang
12
2013
Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Zbl 1171.68555
Rodríguez-Carbonell, E.; Kapur, D.
12
2007
Sparsity considerations in Dixon resultants. Zbl 0914.65055
Kapur, Deepak; Saxena, Tushar
11
1996
A path ordering for proving termination of term rewriting systems. Zbl 0567.68026
Kapur, D.; Narendran, P.; Sivakumar, G.
11
1985
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems. Zbl 0563.03018
Kapur, D.; Krishnamoorthy, M. S.; McNaughton, R.; Narendran, P.
11
1985
An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system. Zbl 1255.13018
Kapur, Deepak; Sun, Yao; Wang, Dingkang
10
2013
A quantifier-elimination based heuristic for automatically generating inductive assertions for programs. Zbl 1115.68051
Kapur, Deepak
10
2006
On ground-confluence of term rewriting systems. Zbl 0699.68041
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich
10
1990
First-order theorem proving using conditional rewrite rules. Zbl 0645.68096
Zhang, Hantao; Kapur, Deepak
10
1988
Proof by induction using test sets. Zbl 0642.68034
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
10
1986
Termination analysis of C programs using compiler intermediate languages. Zbl 1236.68040
Falke, Stephan; Kapur, Deepak; Sinz, Carsten
9
2011
Dependency pairs for equational rewriting. Zbl 0981.68063
Giesl, Jürgen; Kapur, Deepak
9
2001
Extraneous factors in the Dixon resultant formulation. Zbl 0916.65052
Kapur, Deepak; Saxena, Tushar
9
1997
Automating inductionless induction using test sets. Zbl 0724.68079
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
9
1991
An ideal-theoretical approach to word problems and unification problems over finitely presented commutative algebras. Zbl 0581.68039
Kandri-Rody, Abdelilah; Kapur, Deepak; Narendran, Paliath
9
1985
An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537
Kapur, Deepak; Narendran, Paliath; Wang, Lida
8
2003
Conditions for exact resultants using the Dixon formulation. Zbl 1326.68347
Chtcherba, Arthur D.; Kapur, Deepak
8
2000
Program verification using automatic generation of invariants. Zbl 1108.68520
Rodríguez-Carbonell, Enric; Kapur, Deepak
7
2005
An abstract interpretation approach for automatic generation of polynomial invariants. Zbl 1104.68022
Rodríguez-Carbonell, Enric; Kapur, Deepak
7
2004
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. Zbl 1108.13313
Chtcherba, Arthur D.; Kapur, Deepak
7
2003
A new method for proving termination of AC-rewrite systems. Zbl 0736.68051
Kapur, Deepak; Sivakumar, G.; Zhang, Hantao
7
1990
The Knuth Bendix completion procedure and Thue systems. Zbl 0535.68012
Kapur, D.; Narendran, P.
7
1983
Operational termination of conditional rewriting with built-in numbers and semantic data structures. Zbl 1294.68096
Falke, Stephan; Kapur, Deepak
6
2009
Dependency pairs for rewriting with built-in numbers and semantic data structures. Zbl 1145.68445
Falke, Stephan; Kapur, Deepak
6
2008
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. Zbl 1137.13319
Chtcherba, A. D.; Kapur, D.
6
2005
An overview of the Tecton proof system. Zbl 0938.68823
Kapur, D.; Nie, X.; Musser, D. R.
6
1994
Matching, unification and complexity. Zbl 0626.68036
Kapur, Deepak; Narendran, Paliath
6
1987
A “hybrid” approach for synthesizing optimal controllers of hybrid systems: a case study of the oil pump industrial example. Zbl 1373.93125
Zhao, Hengjun; Zhan, Naijun; Kapur, Deepak; Larsen, Kim G.
5
2012
Rewriting induction + linear arithmetic = decision procedure. Zbl 1358.68252
Falke, Stephan; Kapur, Deepak
5
2012
Automated geometric reasoning: Dixon resultants, Gröbner bases, and characteristic sets. Zbl 0910.03010
Kapur, Deepak
5
1998
The Church-Rosser property and special Thue systems. Zbl 0586.03028
Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R.
5
1985
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. Zbl 1323.13004
Kapur, Deepak; Sun, Yao; Wang, Dingkang
4
2011
An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors. Zbl 1205.13032
Kapur, Deepak; Cai, Yongyang
4
2009
On the efficiency and optimality of Dixon-based resultant methods. Zbl 1072.68654
Chtcherba, Arthur D.; Kapur, Deepak
4
2002
Unnecessary inferences in associative-commutative completion procedures. Zbl 0707.68071
Zhang, Hantao; Kapur, Deepak
4
1990
Complexity of matching problems. Zbl 0576.68038
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
4
1985
Worst-case choice for the stable marriage problem. Zbl 0574.05039
Kapur, Deepak; Krishnamoorthy, Mukkai S.
4
1985
Rewrite rule theory and abstract data type analysis. Zbl 0571.68013
Musser, David R.; Kapur, Deepak
4
1982
A term rewriting approach to the automated termination analysis of imperative programs. Zbl 1250.68141
Falke, Stephan; Kapur, Deepak
3
2009
Constructing Sylvester-type resultant matrices using the Dixon formulation. Zbl 1137.13320
Chtcherba, Arthur D.; Kapur, Deepak
3
2005
A rewrite rule based framework for combining decision procedures (preliminary draft). Zbl 1057.68679
Kapur, Deepak
3
2002
Lemma discovery in automating induction. Zbl 1412.68239
Kapur, Deepak; Subramaniam, M.
3
1996
A transformational method for proving termination of logic programs. Zbl 0819.68032
Krishna Rao, M. R. K.; Kapur, D.; Shyamasundar, R. K.
3
1992
Problem corner: Proving equivalence of different axiomatizations of free groups. Zbl 0654.68102
Kapur, Deepak; Zhang, Hantao
3
1988
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm. Zbl 1376.13012
Kapur, Deepak
2
2017
Synthesizing switching controllers for hybrid systems by generating invariants. Zbl 1390.68316
Zhao, Hengjun; Zhan, Naijun; Kapur, Deepak
2
2013
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis. Zbl 1381.68264
Erbatur, Serdar; Escobar, Santiago; Kapur, Deepak; Liu, Zhiqiang; Lynch, Christopher A.; Meadows, Catherine; Meseguer, José; Narendran, Paliath; Santiago, Sonia; Sasse, Ralf
2
2013
Geometric quantifier elimination heuristics for automatically generating octagonal and max-plus invariants. Zbl 1385.68013
Kapur, Deepak; Zhang, Zhihai; Horbach, Matthias; Zhao, Hengjun; Lu, Qi; Nguyen, ThanhVu
2
2013
Unification over distributive exponentiation (sub)theories. Zbl 1345.68190
Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath
2
2011
Coverset induction with partiality and subsorts: a powerlist case study. Zbl 1291.68346
Hendrix, Joe; Kapur, Deepak; Meseguer, José
2
2010
Inductive decidability using implicit induction. Zbl 1165.03313
Falke, Stephan; Kapur, Deepak
2
2006
Automatic generation of generalization lemmas for proving properties of tail-recursive definitions. Zbl 1279.03034
Kapur, Deepak; Sakhanenko, Nikita A.
2
2003
Decidable classes of inductive theorems. Zbl 0988.03017
Giesl, Jürgen; Kapur, Deepak
2
2001
Transformational methodology for proving termination of logic programs. Zbl 0904.68040
Rao, M. R. K. Krishna; Kapur, Deepak; Shyamasundar, R. K.
2
1998
A total, ground path ordering for proving termination of AC-rewrite systems. Zbl 1379.68197
Kapur, Deepak; Sivakumar, G.
2
1997
A path ordering for proving termination of AC rewrite systems. Zbl 0819.68115
Kapur, Deepak; Sivakumar, G.; Zhang, Hantao
2
1995
Symbolic and numerical computation for artificial intelligence. Workshop on the Integration of numerical and symbolic computing methods, held in Saratoga Springs, NY, USA, July 1990. Zbl 0811.68053
Donald, Bruce Randall (ed.); Kapur, Deepak (ed.); Mundy, Joseph L. (ed.)
2
1992
Semi-unification. Zbl 0732.68063
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1991
Semi-unification. Zbl 0667.68042
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1988
Proceedings of a workshop on geometric reasoning, Keble College, Oxford University, June 30-July 3, 1986. Zbl 0656.00033
Kapur, D. (ed.); Mundy, J. L. (ed.)
2
1988
The generalized Rabinowitsch trick. Zbl 1396.13025
Kapur, Deepak; Sun, Yao; Wang, Dingkang; Zhou, Jie
1
2017
Interpolant synthesis for quadratic polynomial inequalities and combination with EUF. Zbl 06623262
Gan, Ting; Dai, Liyun; Xia, Bican; Zhan, Naijun; Kapur, Deepak; Chen, Mingshuai
1
2016
An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm. Zbl 1346.13059
Kapur, Deepak; Yang, Yiming
1
2015
On asymmetric unification and the combination problem in disjoint theories. Zbl 1405.68315
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath; Ringeissen, Christophe
1
2014
On invariant checking. Zbl 1310.68147
Zhang, Zhihai; Kapur, Deepak
1
2013
Hierarchical combination. Zbl 1381.68265
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
1
2013
Multivariate resultants in Bernstein basis. Zbl 1302.13029
Kapur, Deepak; Minimair, Manfred
1
2011
Termination of context-sensitive rewriting with built-in numbers and collection data structures. Zbl 1274.68149
Falke, Stephan; Kapur, Deepak
1
2010
Cayley-Dixon projection operator for multi-univariate composed polynomials. Zbl 1234.68470
Chtcherba, Arthur D.; Kapur, Deepak; Minimair, Manfred
1
2009
Dependency pairs for rewriting with non-free constructors. Zbl 1213.68346
Falke, Stephan; Kapur, Deepak
1
2007
Conditions for determinantal formula for resultant of a polynomial system. Zbl 1356.13043
Chtcherba, Arthur D.; Kapur, Deepak
1
2006
Deciding inductive validity of equations. Zbl 1278.68262
Giesl, Jürgen; Kapur, Deepak
1
2003
Extending decision procedures with induction schemes. Zbl 0963.03011
Kapur, Deepak; Subramaniam, Mahadevan
1
2000
Proving associative-commutative termination using RPO-compatible orderings. Zbl 0963.68089
Kapur, Deepak; Sivakumar, G.
1
2000
New uses of linear arithmetic in automated theorem proving by induction. Zbl 0851.03002
Kapur, Deepak; Subramaniam, M.
1
1996
Automated deduction – CADE-11. Proceedings of the 11th international conference held in Saratoga Springs, NY, USA, June 15–18, 1992. Zbl 0925.00071
Kapur, D. (ed.)
1
1992
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm. Zbl 1376.13012
Kapur, Deepak
2
2017
The generalized Rabinowitsch trick. Zbl 1396.13025
Kapur, Deepak; Sun, Yao; Wang, Dingkang; Zhou, Jie
1
2017
Interpolant synthesis for quadratic polynomial inequalities and combination with EUF. Zbl 06623262
Gan, Ting; Dai, Liyun; Xia, Bican; Zhan, Naijun; Kapur, Deepak; Chen, Mingshuai
1
2016
An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm. Zbl 1346.13059
Kapur, Deepak; Yang, Yiming
1
2015
On asymmetric unification and the combination problem in disjoint theories. Zbl 1405.68315
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Meadows, Catherine; Narendran, Paliath; Ringeissen, Christophe
1
2014
An efficient method for computing comprehensive Gröbner bases. Zbl 1283.13024
Kapur, Deepak; Sun, Yao; Wang, Dingkang
12
2013
An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system. Zbl 1255.13018
Kapur, Deepak; Sun, Yao; Wang, Dingkang
10
2013
Synthesizing switching controllers for hybrid systems by generating invariants. Zbl 1390.68316
Zhao, Hengjun; Zhan, Naijun; Kapur, Deepak
2
2013
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis. Zbl 1381.68264
Erbatur, Serdar; Escobar, Santiago; Kapur, Deepak; Liu, Zhiqiang; Lynch, Christopher A.; Meadows, Catherine; Meseguer, José; Narendran, Paliath; Santiago, Sonia; Sasse, Ralf
2
2013
Geometric quantifier elimination heuristics for automatically generating octagonal and max-plus invariants. Zbl 1385.68013
Kapur, Deepak; Zhang, Zhihai; Horbach, Matthias; Zhao, Hengjun; Lu, Qi; Nguyen, ThanhVu
2
2013
On invariant checking. Zbl 1310.68147
Zhang, Zhihai; Kapur, Deepak
1
2013
Hierarchical combination. Zbl 1381.68265
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
1
2013
A “hybrid” approach for synthesizing optimal controllers of hybrid systems: a case study of the oil pump industrial example. Zbl 1373.93125
Zhao, Hengjun; Zhan, Naijun; Kapur, Deepak; Larsen, Kim G.
5
2012
Rewriting induction + linear arithmetic = decision procedure. Zbl 1358.68252
Falke, Stephan; Kapur, Deepak
5
2012
Termination analysis of C programs using compiler intermediate languages. Zbl 1236.68040
Falke, Stephan; Kapur, Deepak; Sinz, Carsten
9
2011
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. Zbl 1323.13004
Kapur, Deepak; Sun, Yao; Wang, Dingkang
4
2011
Unification over distributive exponentiation (sub)theories. Zbl 1345.68190
Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath
2
2011
Multivariate resultants in Bernstein basis. Zbl 1302.13029
Kapur, Deepak; Minimair, Manfred
1
2011
A new algorithm for computing comprehensive Gröbner systems. Zbl 1321.68533
Kapur, Deepak; Sun, Yao; Wang, Dingkang
22
2010
Coverset induction with partiality and subsorts: a powerlist case study. Zbl 1291.68346
Hendrix, Joe; Kapur, Deepak; Meseguer, José
2
2010
Termination of context-sensitive rewriting with built-in numbers and collection data structures. Zbl 1274.68149
Falke, Stephan; Kapur, Deepak
1
2010
Operational termination of conditional rewriting with built-in numbers and semantic data structures. Zbl 1294.68096
Falke, Stephan; Kapur, Deepak
6
2009
An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors. Zbl 1205.13032
Kapur, Deepak; Cai, Yongyang
4
2009
A term rewriting approach to the automated termination analysis of imperative programs. Zbl 1250.68141
Falke, Stephan; Kapur, Deepak
3
2009
Cayley-Dixon projection operator for multi-univariate composed polynomials. Zbl 1234.68470
Chtcherba, Arthur D.; Kapur, Deepak; Minimair, Manfred
1
2009
Dependency pairs for rewriting with built-in numbers and semantic data structures. Zbl 1145.68445
Falke, Stephan; Kapur, Deepak
6
2008
Generating all polynomial invariants in simple loops. Zbl 1121.13034
Rodríguez-Carbonell, E.; Kapur, D.
19
2007
Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Zbl 1171.68555
Rodríguez-Carbonell, E.; Kapur, D.
12
2007
Dependency pairs for rewriting with non-free constructors. Zbl 1213.68346
Falke, Stephan; Kapur, Deepak
1
2007
A quantifier-elimination based heuristic for automatically generating inductive assertions for programs. Zbl 1115.68051
Kapur, Deepak
10
2006
Inductive decidability using implicit induction. Zbl 1165.03313
Falke, Stephan; Kapur, Deepak
2
2006
Conditions for determinantal formula for resultant of a polynomial system. Zbl 1356.13043
Chtcherba, Arthur D.; Kapur, Deepak
1
2006
Program verification using automatic generation of invariants. Zbl 1108.68520
Rodríguez-Carbonell, Enric; Kapur, Deepak
7
2005
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. Zbl 1137.13319
Chtcherba, A. D.; Kapur, D.
6
2005
Constructing Sylvester-type resultant matrices using the Dixon formulation. Zbl 1137.13320
Chtcherba, Arthur D.; Kapur, Deepak
3
2005
Automatic generation of polynomial loop invariants: algebraic foundations. Zbl 1108.13310
Rodríguez-Carbonell, Enric; Kapur, Deepak
13
2004
An abstract interpretation approach for automatic generation of polynomial invariants. Zbl 1104.68022
Rodríguez-Carbonell, Enric; Kapur, Deepak
7
2004
An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537
Kapur, Deepak; Narendran, Paliath; Wang, Lida
8
2003
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. Zbl 1108.13313
Chtcherba, Arthur D.; Kapur, Deepak
7
2003
Automatic generation of generalization lemmas for proving properties of tail-recursive definitions. Zbl 1279.03034
Kapur, Deepak; Sakhanenko, Nikita A.
2
2003
Deciding inductive validity of equations. Zbl 1278.68262
Giesl, Jürgen; Kapur, Deepak
1
2003
On the efficiency and optimality of Dixon-based resultant methods. Zbl 1072.68654
Chtcherba, Arthur D.; Kapur, Deepak
4
2002
A rewrite rule based framework for combining decision procedures (preliminary draft). Zbl 1057.68679
Kapur, Deepak
3
2002
Dependency pairs for equational rewriting. Zbl 0981.68063
Giesl, Jürgen; Kapur, Deepak
9
2001
Decidable classes of inductive theorems. Zbl 0988.03017
Giesl, Jürgen; Kapur, Deepak
2
2001
Conditions for exact resultants using the Dixon formulation. Zbl 1326.68347
Chtcherba, Arthur D.; Kapur, Deepak
8
2000
Extending decision procedures with induction schemes. Zbl 0963.03011
Kapur, Deepak; Subramaniam, Mahadevan
1
2000
Proving associative-commutative termination using RPO-compatible orderings. Zbl 0963.68089
Kapur, Deepak; Sivakumar, G.
1
2000
Automated geometric reasoning: Dixon resultants, Gröbner bases, and characteristic sets. Zbl 0910.03010
Kapur, Deepak
5
1998
Transformational methodology for proving termination of logic programs. Zbl 0904.68040
Rao, M. R. K. Krishna; Kapur, Deepak; Shyamasundar, R. K.
2
1998
Solving polynomial systems using a branch and prune approach. Zbl 0874.65039
Van Hentenryck, Pascal; McAllester, David; Kapur, Deepak
24
1997
Shostak’s congruence closure as completion. Zbl 1379.68196
Kapur, Deepak
15
1997
Extraneous factors in the Dixon resultant formulation. Zbl 0916.65052
Kapur, Deepak; Saxena, Tushar
9
1997
A total, ground path ordering for proving termination of AC-rewrite systems. Zbl 1379.68197
Kapur, Deepak; Sivakumar, G.
2
1997
Sparsity considerations in Dixon resultants. Zbl 0914.65055
Kapur, Deepak; Saxena, Tushar
11
1996
Lemma discovery in automating induction. Zbl 1412.68239
Kapur, Deepak; Subramaniam, M.
3
1996
New uses of linear arithmetic in automated theorem proving by induction. Zbl 0851.03002
Kapur, Deepak; Subramaniam, M.
1
1996
Comparison of various multivariate resultant formulations. Zbl 0916.65048
Kapur, Deepak; Saxena, Tushar
15
1995
A path ordering for proving termination of AC rewrite systems. Zbl 0819.68115
Kapur, Deepak; Sivakumar, G.; Zhang, Hantao
2
1995
Algebraic and geometric reasoning using Dixon resultants. Zbl 0964.68536
Kapur, Deepak; Saxena, Tushar; Yang, Lu
29
1994
An overview of the Tecton proof system. Zbl 0938.68823
Kapur, D.; Nie, X.; Musser, D. R.
6
1994
Complexity of unification problems with associative-commutative operators. Zbl 0781.68076
Kapur, Deepak; Narendran, Paliath
19
1992
A transformational method for proving termination of logic programs. Zbl 0819.68032
Krishna Rao, M. R. K.; Kapur, D.; Shyamasundar, R. K.
3
1992
Symbolic and numerical computation for artificial intelligence. Workshop on the Integration of numerical and symbolic computing methods, held in Saratoga Springs, NY, USA, July 1990. Zbl 0811.68053
Donald, Bruce Randall (ed.); Kapur, Deepak (ed.); Mundy, Joseph L. (ed.)
2
1992
Automated deduction – CADE-11. Proceedings of the 11th international conference held in Saratoga Springs, NY, USA, June 15–18, 1992. Zbl 0925.00071
Kapur, D. (ed.)
1
1992
Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032
Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao
17
1991
Automating inductionless induction using test sets. Zbl 0724.68079
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
9
1991
Semi-unification. Zbl 0732.68063
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1991
On ground-confluence of term rewriting systems. Zbl 0699.68041
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich
10
1990
A new method for proving termination of AC-rewrite systems. Zbl 0736.68051
Kapur, Deepak; Sivakumar, G.; Zhang, Hantao
7
1990
Unnecessary inferences in associative-commutative completion procedures. Zbl 0707.68071
Zhang, Hantao; Kapur, Deepak
4
1990
A completion procedure for computing a canonical basis for a k- subalgebra. Zbl 0692.13001
Kapur, Deepak; Madlener, Klaus
28
1989
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain. Zbl 0658.13016
Kandri-Rody, Abdelilah; Kapur, Deepak
21
1988
A mechanizable induction principle for equational specifications. Zbl 0657.68103
Zhang, Hantao; Kapur, Deepak; Krishnamoorthy, Mukkai S.
19
1988
A refutational approach to geometry theorem proving. Zbl 0678.68094
Kapur, Deepak
18
1988
Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029
Kapur, Deepak; Musser, David R.; Narendran, Paliath
16
1988
Wu’s method and its application to perspective viewing. Zbl 0664.68102
Kapur, Deepak; Mundy, Joseph L.
14
1988
First-order theorem proving using conditional rewrite rules. Zbl 0645.68096
Zhang, Hantao; Kapur, Deepak
10
1988
Problem corner: Proving equivalence of different axiomatizations of free groups. Zbl 0654.68102
Kapur, Deepak; Zhang, Hantao
3
1988
Semi-unification. Zbl 0667.68042
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1988
Proceedings of a workshop on geometric reasoning, Keble College, Oxford University, June 30-July 3, 1986. Zbl 0656.00033
Kapur, D. (ed.); Mundy, J. L. (ed.)
2
1988
Computability and implementability issues in abstract data types. Zbl 0632.68022
Kapur, Deepak; Srivas, Mandayam
1
1988
On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
25
1987
Proof by consistency. Zbl 0631.68073
Kapur, Deepak; Musser, David R.
23
1987
Complexity of matching problems. Zbl 0638.68036
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
17
1987
Matching, unification and complexity. Zbl 0626.68036
Kapur, Deepak; Narendran, Paliath
6
1987
Using Gröbner bases to reason about geometry problems. Zbl 0629.68087
Kapur, Deepak
30
1986
NP-completeness of the set unification and matching problems. Zbl 0643.68054
Kapur, Deepak; Narendran, Paliath
17
1986
Proof by induction using test sets. Zbl 0642.68034
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
10
1986
Complexity of sufficient-completeness. Zbl 0623.68047
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
1
1986
A finite Thue system with decidable word problem and without equivalent finite canonical system. Zbl 0588.03023
Kapur, Deepak; Narendran, Paliath
33
1985
The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010
Kapur, Deepak; Narendran, Paliath
23
1985
A path ordering for proving termination of term rewriting systems. Zbl 0567.68026
Kapur, D.; Narendran, P.; Sivakumar, G.
11
1985
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems. Zbl 0563.03018
Kapur, D.; Krishnamoorthy, M. S.; McNaughton, R.; Narendran, P.
11
1985
An ideal-theoretical approach to word problems and unification problems over finitely presented commutative algebras. Zbl 0581.68039
Kandri-Rody, Abdelilah; Kapur, Deepak; Narendran, Paliath
9
1985
The Church-Rosser property and special Thue systems. Zbl 0586.03028
Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R.
5
1985
Complexity of matching problems. Zbl 0576.68038
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
4
1985
Worst-case choice for the stable marriage problem. Zbl 0574.05039
Kapur, Deepak; Krishnamoorthy, Mukkai S.
4
1985
A rewrite rule based approach for synthesizing abstract data types. Zbl 0568.68016
Kapur, Deepak; Srivas, Mandayam
1
1985
Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings. Zbl 0564.13001
Kandri-Rody, Abdelilah; Kapur, Deepak
20
1984
...and 3 more Documents
all top 5

Cited by 755 Authors

40 Kapur, Deepak
25 Narendran, Paliath
19 Otto, Friedrich
12 Meseguer Guaita, José
9 Rusinowitch, Michaël
8 Giesl, Jürgen
7 Madlener, Klaus E.
7 Minimair, Manfred
7 Zhang, Hantao
6 Botana, Francisco
6 Fernández, Maribel
6 Fuhs, Carsten
6 Kobayashi, Yuji
6 Nieuwenhuis, Robert
6 Zhan, Naijun
5 Ayala-Rincón, Mauricio
5 Baader, Franz
5 Bouhoula, Adel
5 Dershowitz, Nachum
5 Kounalis, Emmanuel
5 L’vov, M. S.
5 McNaughton, Robert
5 Middeldorp, Aart
5 Ogata, Kazuhiro
5 Recio, Tomas
5 Rubio, Albert
5 Schneider-Kamp, Peter
5 Shank, R. James
5 Sobrinho, Daniele Nantes
5 Sun, Yao
5 Vágvölgyi, Sándor
5 Wang, Dingkang
5 Zeng, Zhenbing
4 Bachmair, Leo
4 Chtcherba, Arthur D.
4 Falke, Stephan
4 Frohn, Florian
4 Futatsugi, Kokichi
4 Guiraud, Yves
4 Hashemi, Amir
4 Hensel, Jera
4 Janičić, Predrag
4 Kirchner, Claude
4 Kirchner, Hélène
4 Kovács, Zoltán
4 Lewis, Robert H.
4 Lucas, Salvador
4 Malbos, Philippe
4 Quaresma, Pedro
4 Roanes-Lozano, Eugenio
4 Roanes-Macías, Eugenio
4 Ströder, Thomas
4 Wehlau, David Louis
4 Winkler, Sarah
4 Xia, Bican
4 Xu, Ming
4 Zhao, Hengjun
3 Bonacina, Maria Paola
3 Brockschmidt, Marc
3 Campbell, H. E. A. Eddy
3 Carrà Ferro, Giuseppa
3 Chevalier, Yannick
3 Chionh, Engwee
3 Comon, Hubert
3 Conchon, Sylvain
3 de Carvalho-Segundo, Washington
3 Dehghani Darmian, Mahdi
3 Geser, Alfons
3 Hermann, Miki
3 Jacquemard, Florent
3 Krishnamoorthy, Mukkai S.
3 Lescanne, Pierre
3 Li, Zhibin
3 Martin, Ursula
3 Mili, Ali
3 Montes, Antonio
3 Mora, Teo
3 Musser, David R.
3 Nabeshima, Katsusuke
3 Nakamura, Masaki
3 Nipkow, Tobias
3 Nishida, Naoki
3 Oliveras, Albert
3 Pichler, Reinhard
3 Qin, Xiaolin
3 Ranise, Silvio
3 Rao, M. R. K. Krishna
3 Reddy, Uday S.
3 Rodríguez-Carbonell, Enric
3 Snyder, Wayne
3 Sturmfels, Bernd
3 Van Hentenryck, Pascal
3 Waldmann, Uwe
3 Wang, Dongming
3 Weidenbach, Christoph
3 Yang, Lu
3 Zantema, Hans
3 Zhou, Jie
2 Abánades, Miguel Angel
2 Aharon, Shir
...and 655 more Authors
all top 5

Cited in 96 Serials

101 Journal of Symbolic Computation
78 Theoretical Computer Science
31 Journal of Automated Reasoning
24 Information and Computation
18 Information Processing Letters
18 Journal of Systems Science and Complexity
14 Artificial Intelligence
12 Annals of Mathematics and Artificial Intelligence
11 Mathematics in Computer Science
8 Journal of Algebra
8 Mathematics and Computers in Simulation
7 Formal Aspects of Computing
7 Cybernetics and Systems Analysis
6 Applied Mathematics and Computation
6 Mathematical Systems Theory
6 Applicable Algebra in Engineering, Communication and Computing
5 Acta Informatica
5 Journal of Pure and Applied Algebra
5 MSCS. Mathematical Structures in Computer Science
5 Journal of Logical and Algebraic Methods in Programming
4 Mathematics of Computation
4 Formal Methods in System Design
4 The Journal of Logic and Algebraic Programming
4 Theory and Practice of Logic Programming
3 Journal of Computer and System Sciences
3 Transactions of the American Mathematical Society
3 International Journal of Computer Mathematics
3 Journal of Applied Logic
3 Logical Methods in Computer Science
2 Computers & Mathematics with Applications
2 Discrete Applied Mathematics
2 Advances in Mathematics
2 BIT
2 Journal of Computational and Applied Mathematics
2 Journal of Computer Science and Technology
2 Computational Geometry
2 International Journal of Foundations of Computer Science
2 Journal of Functional Programming
2 Constraints
2 Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM
1 Computer Methods in Applied Mechanics and Engineering
1 International Journal of Control
1 International Journal of General Systems
1 Mathematical Methods in the Applied Sciences
1 Zhurnal Vychislitel’noĭ Matematiki i Matematicheskoĭ Fiziki
1 Bulletin of Mathematical Biology
1 Chaos, Solitons and Fractals
1 Automatica
1 Compositio Mathematica
1 Computing
1 Information Sciences
1 Journal of Combinatorial Theory. Series A
1 The Journal of Symbolic Logic
1 Mathematische Zeitschrift
1 Numerische Mathematik
1 Results in Mathematics
1 Semigroup Forum
1 SIAM Journal on Numerical Analysis
1 Topology and its Applications
1 Cryptologia
1 Advances in Applied Mathematics
1 Systems & Control Letters
1 Science of Computer Programming
1 Bulletin of the Iranian Mathematical Society
1 Computer Aided Geometric Design
1 Algorithmica
1 Journal of the American Mathematical Society
1 Mathematical and Computer Modelling
1 Science in China. Series A
1 International Journal of Algebra and Computation
1 Journal of Global Optimization
1 European Journal of Operational Research
1 RAIRO. Informatique Théorique et Applications
1 Mathematical Programming. Series A. Series B
1 Journal of Algebraic Combinatorics
1 Computational Optimization and Applications
1 Applied Categorical Structures
1 Journal of Mathematical Sciences (New York)
1 Computer Science Journal of Moldova
1 Transformation Groups
1 Multibody System Dynamics
1 Mechanism and Machine Theory
1 Higher-Order and Symbolic Computation
1 Journal of the European Mathematical Society (JEMS)
1 RAIRO. Theoretical Informatics and Applications
1 Journal of High Energy Physics
1 Optimization and Engineering
1 ACM Transactions on Computational Logic
1 Computational Management Science
1 Nonlinear Analysis. Hybrid Systems
1 ACM Communications in Computer Algebra
1 Science China. Information Sciences
1 Symmetry
1 Frontiers of Computer Science in China
1 Frontiers of Computer Science
1 Open Mathematics
all top 5

Cited in 41 Fields

444 Computer science (68-XX)
113 Commutative algebra (13-XX)
109 Mathematical logic and foundations (03-XX)
42 Group theory and generalizations (20-XX)
39 Numerical analysis (65-XX)
23 Algebraic geometry (14-XX)
16 Geometry (51-XX)
14 Associative rings and algebras (16-XX)
12 Field theory and polynomials (12-XX)
12 Information and communication theory, circuits (94-XX)
11 Operations research, mathematical programming (90-XX)
9 Linear and multilinear algebra; matrix theory (15-XX)
9 Systems theory; control (93-XX)
8 Category theory; homological algebra (18-XX)
7 General algebraic systems (08-XX)
6 Combinatorics (05-XX)
6 Mechanics of particles and systems (70-XX)
5 Order, lattices, ordered algebraic structures (06-XX)
5 Real functions (26-XX)
5 Ordinary differential equations (34-XX)
4 Functions of a complex variable (30-XX)
4 Calculus of variations and optimal control; optimization (49-XX)
4 Biology and other natural sciences (92-XX)
4 Mathematics education (97-XX)
3 Number theory (11-XX)
3 Nonassociative rings and algebras (17-XX)
3 Dynamical systems and ergodic theory (37-XX)
2 General and overarching topics; collections (00-XX)
2 History and biography (01-XX)
2 Several complex variables and analytic spaces (32-XX)
2 Mechanics of deformable solids (74-XX)
2 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
1 Partial differential equations (35-XX)
1 Difference and functional equations (39-XX)
1 Harmonic analysis on Euclidean spaces (42-XX)
1 Convex and discrete geometry (52-XX)
1 Differential geometry (53-XX)
1 General topology (54-XX)
1 Algebraic topology (55-XX)
1 Fluid mechanics (76-XX)
1 Quantum theory (81-XX)

Citations by Year