×
Author ID: kapur.deepak Recent zbMATH articles by "Kapur, Deepak"
Published as: Kapur, Deepak; Kapur, D.
all top 5

Co-Authors

16 single-authored
29 Narendran, Paliath
12 Zhang, Hantao
10 Falke, Stephan
9 Chtcherba, Arthur D.
9 Subramaniam, Mahadevan
8 Musser, David R.
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 Ghilardi, Silvio
3 Gianola, Alessandro
3 Kandri-Rody, Abdelilah
3 Minimair, Manfred
3 Ringeissen, Christophe
3 Weidenbach, Christoph
3 Zhao, Hengjun
2 Baader, Franz
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 Naso, Chiara
1 Nguyen, Van- Duc
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 Open

114 Publications have been cited 1,041 times in 688 Documents Cited by Year
Algebraic and geometric reasoning using Dixon resultants. Zbl 0964.68536
Kapur, Deepak; Saxena, Tushar; Yang, Lu
39
1994
A finite Thue system with decidable word problem and without equivalent finite canonical system. Zbl 0588.03023
Kapur, Deepak; Narendran, Paliath
37
1985
Using Gröbner bases to reason about geometry problems. Zbl 0629.68087
Kapur, Deepak
37
1986
On sufficient-completeness and related properties of term rewriting systems. Zbl 0594.68035
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
36
1987
Solving polynomial systems using a branch and prune approach. Zbl 0874.65039
Van Hentenryck, Pascal; McAllester, David; Kapur, Deepak
29
1997
A new algorithm for computing comprehensive Gröbner systems. Zbl 1321.68533
Kapur, Deepak; Sun, Yao; Wang, Dingkang
28
2010
Proof by consistency. Zbl 0631.68073
Kapur, Deepak; Musser, David R.
27
1987
Generating all polynomial invariants in simple loops. Zbl 1121.13034
Rodríguez-Carbonell, E.; Kapur, D.
27
2007
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain. Zbl 0658.13016
Kandri-Rody, Abdelilah; Kapur, Deepak
24
1988
The Knuth-Bendix completion procedure and Thue systems. Zbl 0576.68010
Kapur, Deepak; Narendran, Paliath
24
1985
Complexity of unification problems with associative-commutative operators. Zbl 0781.68076
Kapur, Deepak; Narendran, Paliath
24
1992
Complexity of matching problems. Zbl 0638.68036
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
23
1987
Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029
Kapur, Deepak; Musser, David R.; Narendran, Paliath
23
1988
A mechanizable induction principle for equational specifications. Zbl 0657.68103
Zhang, Hantao; Kapur, Deepak; Krishnamoorthy, Mukkai S.
21
1988
Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032
Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao
20
1991
Shostak’s congruence closure as completion. Zbl 1379.68196
Kapur, Deepak
20
1997
A refutational approach to geometry theorem proving. Zbl 0678.68094
Kapur, Deepak
19
1988
Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Zbl 1171.68555
Rodríguez-Carbonell, E.; Kapur, D.
19
2007
Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings. Zbl 0564.13001
Kandri-Rody, Abdelilah; Kapur, Deepak
19
1984
Automatic generation of polynomial loop invariants: algebraic foundations. Zbl 1108.13310
Rodríguez-Carbonell, Enric; Kapur, Deepak
18
2004
Comparison of various multivariate resultant formulations. Zbl 0916.65048
Kapur, Deepak; Saxena, Tushar
17
1995
On proving uniform termination and restricted termination of rewriting systems. Zbl 0526.68036
Guttag, J. V.; Kapur, D.; Musser, D. R.
17
1983
Wu’s method and its application to perspective viewing. Zbl 0664.68102
Kapur, Deepak; Mundy, Joseph L.
16
1988
On ground-confluence of term rewriting systems. Zbl 0699.68041
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich
16
1990
An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system. Zbl 1255.13018
Kapur, Deepak; Sun, Yao; Wang, Dingkang
16
2013
NP-completeness of the set unification and matching problems. Zbl 0643.68054
Kapur, Deepak; Narendran, Paliath
15
1986
Extraneous factors in the Dixon resultant formulation. Zbl 0916.65052
Kapur, Deepak; Saxena, Tushar
14
1997
A path ordering for proving termination of term rewriting systems. Zbl 0567.68026
Kapur, D.; Narendran, P.; Sivakumar, G.
14
1985
A completion procedure for computing a canonical basis for a k- subalgebra. Zbl 0692.13001
Kapur, Deepak; Madlener, Klaus
14
1989
A quantifier-elimination based heuristic for automatically generating inductive assertions for programs. Zbl 1115.68051
Kapur, Deepak
13
2006
An efficient method for computing comprehensive Gröbner bases. Zbl 1283.13024
Kapur, Deepak; Sun, Yao; Wang, Dingkang
13
2013
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.
13
1985
Dependency pairs for equational rewriting. Zbl 0981.68063
Giesl, Jürgen; Kapur, Deepak
12
2001
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
12
1985
Proof by induction using test sets. Zbl 0642.68034
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
12
1986
Automating inductionless induction using test sets. Zbl 0724.68079
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
12
1991
Termination analysis of C programs using compiler intermediate languages. Zbl 1236.68040
Falke, Stephan; Kapur, Deepak; Sinz, Carsten
11
2011
Conditions for exact resultants using the Dixon formulation. Zbl 1326.68347
Chtcherba, Arthur D.; Kapur, Deepak
11
2000
Matching, unification and complexity. Zbl 0626.68036
Kapur, Deepak; Narendran, Paliath
10
1987
A new method for proving termination of AC-rewrite systems. Zbl 0736.68051
Kapur, Deepak; Sivakumar, G.; Zhang, Hantao
10
1990
Dependency pairs for rewriting with built-in numbers and semantic data structures. Zbl 1145.68445
Falke, Stephan; Kapur, Deepak
10
2008
Sparsity considerations in Dixon resultants. Zbl 0914.65055
Kapur, Deepak; Saxena, Tushar
9
1996
An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537
Kapur, Deepak; Narendran, Paliath; Wang, Lida
9
2003
An abstract interpretation approach for automatic generation of polynomial invariants. Zbl 1104.68022
Rodríguez-Carbonell, Enric; Kapur, Deepak
9
2004
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. Zbl 1108.13313
Chtcherba, Arthur D.; Kapur, Deepak
8
2003
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
8
2009
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. Zbl 1137.13319
Chtcherba, A. D.; Kapur, D.
8
2005
An overview of the Tecton proof system. Zbl 0938.68823
Kapur, D.; Nie, X.; Musser, D. R.
7
1994
On the efficiency and optimality of Dixon-based resultant methods. Zbl 1072.68654
Chtcherba, Arthur D.; Kapur, Deepak
7
2002
Program verification using automatic generation of invariants. Zbl 1108.68520
Rodríguez-Carbonell, Enric; Kapur, Deepak
7
2005
Operational termination of conditional rewriting with built-in numbers and semantic data structures. Zbl 1294.68096
Falke, Stephan; Kapur, Deepak
7
2009
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.
7
2012
The Knuth Bendix completion procedure and Thue systems. Zbl 0535.68012
Kapur, D.; Narendran, P.
7
1983
Automated geometric reasoning: Dixon resultants, Gröbner bases, and characteristic sets. Zbl 0910.03010
Kapur, Deepak
6
1998
First-order theorem proving using conditional rewrite rules. Zbl 0645.68096
Zhang, Hantao; Kapur, Deepak
6
1988
Conditional congruence closure over uninterpreted and interpreted symbols. Zbl 1417.68077
Kapur, Deepak
6
2019
The Church-Rosser property and special Thue systems. Zbl 0586.03028
Kapur, D.; Narendran, P.; Krishnamoorthy, M. S.; McNaughton, R.
5
1985
Unnecessary inferences in associative-commutative completion procedures. Zbl 0707.68071
Zhang, Hantao; Kapur, Deepak
5
1990
Complexity of matching problems. Zbl 0576.68038
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
5
1985
Rewriting induction + linear arithmetic = decision procedure. Zbl 1358.68252
Falke, Stephan; Kapur, Deepak
5
2012
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
5
2013
Constructing Sylvester-type resultant matrices using the Dixon formulation. Zbl 1137.13320
Chtcherba, Arthur D.; Kapur, Deepak
5
2005
Worst-case choice for the stable marriage problem. Zbl 0574.05039
Kapur, Deepak; Krishnamoorthy, Mukkai S.
4
1985
Interpolant synthesis for quadratic polynomial inequalities and combination with EUF. Zbl 1475.03072
Gan, Ting; Dai, Liyun; Xia, Bican; Zhan, Naijun; Kapur, Deepak; Chen, Mingshuai
4
2016
Unification over distributive exponentiation (sub)theories. Zbl 1345.68190
Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath
4
2011
A term rewriting approach to the automated termination analysis of imperative programs. Zbl 1250.68141
Falke, Stephan; Kapur, Deepak
4
2009
A transformational method for proving termination of logic programs. Zbl 0819.68032
Krishna Rao, M. R. K.; Kapur, D.; Shyamasundar, R. K.
4
1992
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. Zbl 1323.13004
Kapur, Deepak; Sun, Yao; Wang, Dingkang
4
2011
A rewrite rule based framework for combining decision procedures (preliminary draft). Zbl 1057.68679
Kapur, Deepak
3
2002
New uses of linear arithmetic in automated theorem proving by induction. Zbl 0851.03002
Kapur, Deepak; Subramaniam, M.
3
1996
Problem corner: Proving equivalence of different axiomatizations of free groups. Zbl 0654.68102
Kapur, Deepak; Zhang, Hantao
3
1988
Lemma discovery in automating induction. Zbl 1412.68239
Kapur, Deepak; Subramaniam, M.
3
1996
Interpolation and amalgamation for arrays with MaxDiff. Zbl 07410429
Ghilardi, Silvio; Gianola, Alessandro; Kapur, Deepak
3
2021
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
3
2013
Hierarchical combination. Zbl 1381.68265
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
3
2013
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm. Zbl 1376.13012
Kapur, Deepak
3
2017
Synthesizing switching controllers for hybrid systems by generating invariants. Zbl 1390.68316
Zhao, Hengjun; Zhan, Naijun; Kapur, Deepak
3
2013
An efficient algorithm for computing parametric multivariate polynomial GCD. Zbl 1467.13047
Kapur, Deepak; Lu, Dong; Monagan, Michael; Sun, Yao; Wang, Dingkang
3
2018
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
Extending decision procedures with induction schemes. Zbl 0963.03011
Kapur, Deepak; Subramaniam, Mahadevan
2
2000
A rewrite rule based approach for synthesizing abstract data types. Zbl 0568.68016
Kapur, Deepak; Srivas, Mandayam
2
1985
Semi-unification. Zbl 0732.68063
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1991
Proceedings of a workshop on geometric reasoning, Keble College, Oxford University, June 30-July 3, 1986. Zbl 0656.00033
2
1988
Semi-unification. Zbl 0667.68042
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
2
1988
Dependency pairs for rewriting with non-free constructors. Zbl 1213.68346
Falke, Stephan; Kapur, Deepak
2
2007
Unification and matching in hierarchical combinations of syntactic theories. Zbl 1471.68108
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
2
2015
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
2
1992
Cayley-Dixon projection operator for multi-univariate composed polynomials. Zbl 1234.68470
Chtcherba, Arthur D.; Kapur, Deepak; Minimair, Manfred
2
2009
Automatic generation of generalization lemmas for proving properties of tail-recursive definitions. Zbl 1279.03034
Kapur, Deepak; Sakhanenko, Nikita A.
2
2003
Coverset induction with partiality and subsorts: a powerlist case study. Zbl 1291.68346
Hendrix, Joe; Kapur, Deepak; Meseguer, José
2
2010
Deciding the word problem for ground identities with commutative and extensional symbols. Zbl 07614512
Baader, Franz; Kapur, Deepak
2
2020
Consider only general superpositions in completion procedures. Zbl 1503.68171
Zhang, Hantao; Kapur, Deepak
2
1989
Inductive decidability using implicit induction. Zbl 1165.03313
Falke, Stephan; Kapur, Deepak
2
2006
A total, ground path ordering for proving termination of AC-rewrite systems. Zbl 1379.68197
Kapur, Deepak; Sivakumar, G.
2
1997
When is a formula a loop invariant? Zbl 1321.68191
Falke, Stephan; Kapur, Deepak
2
2015
Automated deduction – CADE-11. Proceedings of the 11th international conference held in Saratoga Springs, NY, USA, June 15–18, 1992. Zbl 0925.00071
1
1992
Proving associative-commutative termination using RPO-compatible orderings. Zbl 0963.68089
Kapur, Deepak; Sivakumar, G.
1
2000
Complexity of sufficient-completeness. Zbl 0623.68047
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
1
1986
Computability and implementability issues in abstract data types. Zbl 0632.68022
Kapur, Deepak; Srivas, Mandayam
1
1988
Uniform interpolants in \(\mathcal{EUF}\): Algorithms using DAG-representations. Zbl 07566058
Ghilardi, Silvio; Gianola, Alessandro; Kapur, Deepak
1
2022
Interpolation and amalgamation for arrays with MaxDiff. Zbl 07410429
Ghilardi, Silvio; Gianola, Alessandro; Kapur, Deepak
3
2021
Deciding the word problem for ground identities with commutative and extensional symbols. Zbl 07614512
Baader, Franz; Kapur, Deepak
2
2020
Conditional congruence closure over uninterpreted and interpreted symbols. Zbl 1417.68077
Kapur, Deepak
6
2019
NIL: learning nonlinear interpolants. Zbl 07178976
Chen, Mingshuai; Wang, Jian; An, Jie; Zhan, Bohua; Kapur, Deepak; Zhan, Naijun
1
2019
An efficient algorithm for computing parametric multivariate polynomial GCD. Zbl 1467.13047
Kapur, Deepak; Lu, Dong; Monagan, Michael; Sun, Yao; Wang, Dingkang
3
2018
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm. Zbl 1376.13012
Kapur, Deepak
3
2017
Connecting program synthesis and reachability: automatic program repair using test-input generation. Zbl 1452.68052
Nguyen, Thanhvu; Weimer, Westley; Kapur, Deepak; Forrest, Stephanie
1
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 1475.03072
Gan, Ting; Dai, Liyun; Xia, Bican; Zhan, Naijun; Kapur, Deepak; Chen, Mingshuai
4
2016
Dependable software engineering: theories, tools, and applications. Second international symposium, SETTA 2016, Beijing, China, November 9–11, 2016. Proceedings. Zbl 1347.68007
1
2016
Unification and matching in hierarchical combinations of syntactic theories. Zbl 1471.68108
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
2
2015
When is a formula a loop invariant? Zbl 1321.68191
Falke, Stephan; Kapur, Deepak
2
2015
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 algorithm for computing a comprehensive Gröbner system of a parametric polynomial system. Zbl 1255.13018
Kapur, Deepak; Sun, Yao; Wang, Dingkang
16
2013
An efficient method for computing comprehensive Gröbner bases. Zbl 1283.13024
Kapur, Deepak; Sun, Yao; Wang, Dingkang
13
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
5
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
3
2013
Hierarchical combination. Zbl 1381.68265
Erbatur, Serdar; Kapur, Deepak; Marshall, Andrew M.; Narendran, Paliath; Ringeissen, Christophe
3
2013
Synthesizing switching controllers for hybrid systems by generating invariants. Zbl 1390.68316
Zhao, Hengjun; Zhan, Naijun; Kapur, Deepak
3
2013
On invariant checking. Zbl 1310.68147
Zhang, Zhihai; Kapur, Deepak
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.
7
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
11
2011
Unification over distributive exponentiation (sub)theories. Zbl 1345.68190
Erbatur, Serdar; Marshall, Andrew M.; Kapur, Deepak; Narendran, Paliath
4
2011
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. Zbl 1323.13004
Kapur, Deepak; Sun, Yao; Wang, Dingkang
4
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
28
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
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
8
2009
Operational termination of conditional rewriting with built-in numbers and semantic data structures. Zbl 1294.68096
Falke, Stephan; Kapur, Deepak
7
2009
A term rewriting approach to the automated termination analysis of imperative programs. Zbl 1250.68141
Falke, Stephan; Kapur, Deepak
4
2009
Cayley-Dixon projection operator for multi-univariate composed polynomials. Zbl 1234.68470
Chtcherba, Arthur D.; Kapur, Deepak; Minimair, Manfred
2
2009
Dependency pairs for rewriting with built-in numbers and semantic data structures. Zbl 1145.68445
Falke, Stephan; Kapur, Deepak
10
2008
Generating all polynomial invariants in simple loops. Zbl 1121.13034
Rodríguez-Carbonell, E.; Kapur, D.
27
2007
Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Zbl 1171.68555
Rodríguez-Carbonell, E.; Kapur, D.
19
2007
Dependency pairs for rewriting with non-free constructors. Zbl 1213.68346
Falke, Stephan; Kapur, Deepak
2
2007
A quantifier-elimination based heuristic for automatically generating inductive assertions for programs. Zbl 1115.68051
Kapur, Deepak
13
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
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. Zbl 1137.13319
Chtcherba, A. D.; Kapur, D.
8
2005
Program verification using automatic generation of invariants. Zbl 1108.68520
Rodríguez-Carbonell, Enric; Kapur, Deepak
7
2005
Constructing Sylvester-type resultant matrices using the Dixon formulation. Zbl 1137.13320
Chtcherba, Arthur D.; Kapur, Deepak
5
2005
Cayley-Dixon resultant matrices of multi-univariate composed polynomials. Zbl 1097.12005
Chtcherba, Arthur D.; Kapur, Deepak; Minimair, Manfred
1
2005
Automatic generation of polynomial loop invariants: algebraic foundations. Zbl 1108.13310
Rodríguez-Carbonell, Enric; Kapur, Deepak
18
2004
An abstract interpretation approach for automatic generation of polynomial invariants. Zbl 1104.68022
Rodríguez-Carbonell, Enric; Kapur, Deepak
9
2004
An E-unification algorithm for analyzing protocols that use modular exponentiation. Zbl 1043.94537
Kapur, Deepak; Narendran, Paliath; Wang, Lida
9
2003
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. Zbl 1108.13313
Chtcherba, Arthur D.; Kapur, Deepak
8
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
7
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
12
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
11
2000
Extending decision procedures with induction schemes. Zbl 0963.03011
Kapur, Deepak; Subramaniam, Mahadevan
2
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
6
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
29
1997
Shostak’s congruence closure as completion. Zbl 1379.68196
Kapur, Deepak
20
1997
Extraneous factors in the Dixon resultant formulation. Zbl 0916.65052
Kapur, Deepak; Saxena, Tushar
14
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
9
1996
New uses of linear arithmetic in automated theorem proving by induction. Zbl 0851.03002
Kapur, Deepak; Subramaniam, M.
3
1996
Lemma discovery in automating induction. Zbl 1412.68239
Kapur, Deepak; Subramaniam, M.
3
1996
Comparison of various multivariate resultant formulations. Zbl 0916.65048
Kapur, Deepak; Saxena, Tushar
17
1995
Algebraic and geometric reasoning using Dixon resultants. Zbl 0964.68536
Kapur, Deepak; Saxena, Tushar; Yang, Lu
39
1994
An overview of the Tecton proof system. Zbl 0938.68823
Kapur, D.; Nie, X.; Musser, D. R.
7
1994
Complexity of unification problems with associative-commutative operators. Zbl 0781.68076
Kapur, Deepak; Narendran, Paliath
24
1992
A transformational method for proving termination of logic programs. Zbl 0819.68032
Krishna Rao, M. R. K.; Kapur, D.; Shyamasundar, R. K.
4
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
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
1
1992
Sufficient-completeness, ground-reducibility and their complexity. Zbl 0721.68032
Kapur, Deepak; Narendran, Paliath; Rosenkrantz, Daniel J.; Zhang, Hantao
20
1991
Automating inductionless induction using test sets. Zbl 0724.68079
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao
12
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
16
1990
A new method for proving termination of AC-rewrite systems. Zbl 0736.68051
Kapur, Deepak; Sivakumar, G.; Zhang, Hantao
10
1990
Unnecessary inferences in associative-commutative completion procedures. Zbl 0707.68071
Zhang, Hantao; Kapur, Deepak
5
1990
Inference rules and proof procedures for inequations. Zbl 0705.68088
Mohan, Chilukuri K.; Srivas, Mandayam K.; Kapur, Deepak
1
1990
A completion procedure for computing a canonical basis for a k- subalgebra. Zbl 0692.13001
Kapur, Deepak; Madlener, Klaus
14
1989
Consider only general superpositions in completion procedures. Zbl 1503.68171
Zhang, Hantao; Kapur, Deepak
2
1989
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain. Zbl 0658.13016
Kandri-Rody, Abdelilah; Kapur, Deepak
24
1988
Only prime superpositions need be considered in the Knuth-Bendix completion procedure. Zbl 0651.68029
Kapur, Deepak; Musser, David R.; Narendran, Paliath
23
1988
A mechanizable induction principle for equational specifications. Zbl 0657.68103
Zhang, Hantao; Kapur, Deepak; Krishnamoorthy, Mukkai S.
21
1988
A refutational approach to geometry theorem proving. Zbl 0678.68094
Kapur, Deepak
19
1988
Wu’s method and its application to perspective viewing. Zbl 0664.68102
Kapur, Deepak; Mundy, Joseph L.
16
1988
First-order theorem proving using conditional rewrite rules. Zbl 0645.68096
Zhang, Hantao; Kapur, Deepak
6
1988
Problem corner: Proving equivalence of different axiomatizations of free groups. Zbl 0654.68102
Kapur, Deepak; Zhang, Hantao
3
1988
Proceedings of a workshop on geometric reasoning, Keble College, Oxford University, June 30-July 3, 1986. Zbl 0656.00033
2
1988
Semi-unification. Zbl 0667.68042
Kapur, Deepak; Musser, David; Narendran, Paliath; Stillman, Jonathan
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
36
1987
Proof by consistency. Zbl 0631.68073
Kapur, Deepak; Musser, David R.
27
1987
Complexity of matching problems. Zbl 0638.68036
Benanav, Dan; Kapur, Deepak; Narendran, Paliath
23
1987
Matching, unification and complexity. Zbl 0626.68036
Kapur, Deepak; Narendran, Paliath
10
1987
Using Gröbner bases to reason about geometry problems. Zbl 0629.68087
Kapur, Deepak
37
1986
NP-completeness of the set unification and matching problems. Zbl 0643.68054
Kapur, Deepak; Narendran, Paliath
15
1986
...and 14 more Documents
all top 5

Cited by 884 Authors

49 Kapur, Deepak
29 Narendran, Paliath
21 Otto, Friedrich
14 Meseguer Guaita, José
11 Giesl, Jürgen
11 Rusinowitch, Michaël
10 Baader, Franz
9 Nabeshima, Katsusuke
8 Escobar, Santiago
8 Tajima, Shinichi
8 Winkler, Sarah
8 Zhang, Hantao
7 Dershowitz, Nachum
7 Fernández, Maribel
7 Kovács, Laura Ildikó
7 Madlener, Klaus E.
7 Minimair, Manfred
7 Nieuwenhuis, Robert
7 Wang, Dingkang
7 Zhan, Naijun
6 Ayala-Rincón, Mauricio
6 Bachmair, Leo
6 Botana, Francisco
6 Fuhs, Carsten
6 Gao, Qingbin
6 Ghilardi, Silvio
6 Gianola, Alessandro
6 Kobayashi, Yuji
6 Recio, Tomas
6 Rubio, Albert
6 Schneider-Kamp, Peter
6 Sobrinho, Daniele Nantes
5 Bouhoula, Adel
5 Bündgen, Reinhard
5 Falke, Stephan
5 Frohn, Florian
5 Hashemi, Amir
5 Hofbauer, Dieter
5 Jouannaud, Jean-Pierre
5 Kirchner, Hélène
5 Kounalis, Emmanuel
5 Lucas, Salvador
5 L’vov, M. S.
5 McNaughton, Robert
5 Mora, Teo
5 Nishida, Naoki
5 Ogata, Kazuhiro
5 Reddy, Uday S.
5 Roanes-Lozano, Eugenio
5 Roanes-Macías, Eugenio
5 Sun, Yao
5 Vágvölgyi, Sándor
5 Zeng, Zhenbing
4 Chtcherba, Arthur D.
4 Comon, Hubert
4 de Carvalho-Segundo, Washington
4 Futatsugi, Kokichi
4 Gao, Xiaoshan
4 Guiraud, Yves
4 Hensel, Jera
4 Hermann, Miki
4 Janičić, Predrag
4 Kirchner, Claude
4 Kovács, Zoltán
4 Lewis, Robert H.
4 Malbos, Philippe
4 Martin, Ursula
4 Middeldorp, Aart
4 Montes, Antonio
4 Nipkow, Tobias
4 Qin, Xiaolin
4 Quaresma, Pedro
4 Rao, M. R. K. Krishna
4 Ringeissen, Christophe
4 Snyder, Wayne
4 Ströder, Thomas
4 Wang, Dongming
4 Weidenbach, Christoph
4 Xia, Bican
4 Xu, Ming
4 Yang, Lu
4 Zhao, Hengjun
3 Aoto, Takahito
3 Bonacina, Maria Paola
3 Brockschmidt, Marc
3 Cai, Jiazhi
3 Calvanese, Diego
3 Carra’Ferro, Giuseppa
3 Ceria, Michela
3 Chevalier, Yannick
3 Conchon, Sylvain
3 Dehghani Darmian, Mahdi
3 Durán, Francisco
3 Erbatur, Serdar
3 Geser, Alfons
3 Gramlich, Bernhard
3 Horbach, Matthias
3 Jacquemard, Florent
3 Klop, Jan Willem
3 Krishnamoorthy, Mukkai S.
...and 784 more Authors
all top 5

Cited in 105 Serials

88 Journal of Symbolic Computation
73 Theoretical Computer Science
37 Journal of Automated Reasoning
21 Information and Computation
20 Journal of Systems Science and Complexity
17 Mathematics in Computer Science
15 Information Processing Letters
12 Artificial Intelligence
12 Annals of Mathematics and Artificial Intelligence
11 Applicable Algebra in Engineering, Communication and Computing
8 Mathematics and Computers in Simulation
7 Formal Aspects of Computing
7 MSCS. Mathematical Structures in Computer Science
7 Cybernetics and Systems Analysis
7 Journal of Logical and Algebraic Methods in Programming
6 Applied Mathematics and Computation
6 Mathematical Systems Theory
6 Logical Methods in Computer Science
5 Acta Informatica
5 Formal Methods in System Design
4 Mathematics of Computation
4 Journal of Algebra
4 The Journal of Logic and Algebraic Programming
4 Theory and Practice of Logic Programming
3 Journal of the Franklin Institute
3 Journal of Computer and System Sciences
3 Journal of Pure and Applied Algebra
3 Mathematische Zeitschrift
3 Transactions of the American Mathematical Society
3 International Journal of Computer Mathematics
3 Journal of Applied Logic
2 Computers & Mathematics with Applications
2 Discrete Applied Mathematics
2 BIT
2 Information Sciences
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 Global Optimization
2 Journal of Functional Programming
2 Constraints
2 ACM Transactions on Computational Logic
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 Advances in Mathematics
1 Automatica
1 Compositio Mathematica
1 Computing
1 Journal of Combinatorial Theory. Series A
1 The Journal of Symbolic Logic
1 Meccanica
1 Numerische Mathematik
1 Proceedings of the American Mathematical Society
1 Results in Mathematics
1 Semigroup Forum
1 SIAM Journal on Numerical Analysis
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 Journal of the American Mathematical Society
1 Mathematical and Computer Modelling
1 Science in China. Series A
1 Machine Learning
1 International Journal of Algebra and Computation
1 Applied Mathematical Modelling
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 Journal of Graph Algorithms and Applications
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 JP Journal of Algebra, Number Theory and Applications
1 Computational Management Science
1 Contributions to Discrete Mathematics
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
...and 5 more Serials
all top 5

Cited in 40 Fields

556 Computer science (68-XX)
148 Mathematical logic and foundations (03-XX)
113 Commutative algebra (13-XX)
43 Numerical analysis (65-XX)
41 Group theory and generalizations (20-XX)
31 Algebraic geometry (14-XX)
20 Geometry (51-XX)
16 Systems theory; control (93-XX)
16 Information and communication theory, circuits (94-XX)
15 Operations research, mathematical programming (90-XX)
13 Field theory and polynomials (12-XX)
13 Category theory; homological algebra (18-XX)
12 Associative rings and algebras (16-XX)
11 Linear and multilinear algebra; matrix theory (15-XX)
9 Combinatorics (05-XX)
9 Mechanics of particles and systems (70-XX)
8 General algebraic systems (08-XX)
8 Ordinary differential equations (34-XX)
6 Biology and other natural sciences (92-XX)
5 Real functions (26-XX)
5 Several complex variables and analytic spaces (32-XX)
4 Order, lattices, ordered algebraic structures (06-XX)
4 Number theory (11-XX)
4 Functions of a complex variable (30-XX)
4 Calculus of variations and optimal control; optimization (49-XX)
4 Mathematics education (97-XX)
3 General and overarching topics; collections (00-XX)
3 History and biography (01-XX)
3 Nonassociative rings and algebras (17-XX)
3 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
2 Special functions (33-XX)
2 Dynamical systems and ergodic theory (37-XX)
2 Algebraic topology (55-XX)
2 Mechanics of deformable solids (74-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 Quantum theory (81-XX)

Citations by Year