Folgen
Deepak Kapur
Titel
Zitiert von
Zitiert von
Jahr
Solving polynomial systems using a branch and prune approach
P Van Hentenryck, D McAllester, D Kapur
SIAM Journal on Numerical Analysis 34 (2), 797-827, 1997
4211997
Algebraic and geometric reasoning using Dixon resultants
D Kapur, T Saxena, L Yang
Proceedings of the international symposium on Symbolic and algebraic …, 1994
2611994
Using Gröbner bases to reason about geometry problems
D Kapur
Journal of Symbolic Computation 2 (4), 399-408, 1986
1911986
Proof by consistency
D Kapur, DR Musser
Artificial Intelligence 31 (2), 125-157, 1987
1821987
NP-completeness of the set unification and matching problems
D Kapur, P Narendran
8th International Conference on Automated Deduction: Oxford, England, July …, 1986
1821986
An equational approach to theorem proving in first-order predicate calculus
D Kapur, P Narendran
ACM SIGSOFT Software Engineering Notes 10 (4), 63-66, 1985
1791985
Generating all polynomial invariants in simple loops
E Rodríguez-Carbonell, D Kapur
Journal of Symbolic Computation 42 (4), 443-476, 2007
1702007
On sufficient-completeness and related properties of term rewriting systems
D Kapur, P Narendran, H Zhang
Acta Informatica 24 (4), 395-415, 1987
1621987
A mechanizable induction principle for equational specifications
H Zhang, D Kapur, MS Krishnamoorthy
International Conference on Automated Deduction, 162-181, 1988
1601988
An overview of rewrite rule laboratory (RRL)
D Kapur, H Zhang
Computers & Mathematics with Applications 29 (2), 91-114, 1995
1571995
Automatic generation of polynomial loop invariants: Algebraic foundations
E Rodríguez-Carbonell, D Kapur
Proceedings of the 2004 international symposium on Symbolic and algebraic …, 2004
1492004
Geometry theorem proving using Hilbert's Nullstellensatz
D Kapur
Proceedings of the fifth ACM symposium on Symbolic and algebraic computation …, 1986
1491986
Complexity of matching problems
D Benanav, D Kapur, P Narendran
Journal of symbolic computation 3 (1-2), 203-216, 1987
1381987
A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra
D Kapur, K Madlener
Computers and mathematics, 1-11, 1989
1311989
Complexity of unification problems with associative-commutative operators
D Kapur, P Narendran
Journal of Automated Reasoning 9 (2), 261-288, 1992
1301992
Automatic generation of polynomial invariants of bounded degree using abstract interpretation
E Rodríguez-Carbonell, D Kapur
Science of Computer Programming 64 (1), 54-75, 2007
1262007
Interpolation for data structures
D Kapur, R Majumdar, CG Zarba
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations …, 2006
1212006
A new algorithm for computing comprehensive Gröbner systems
D Kapur, Y Sun, D Wang
Proceedings of the 2010 International Symposium on Symbolic and Algebraic …, 2010
1202010
Automatically generating loop invariants using quantifier elimination
D Kapur
Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2006
1202006
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Ä Kandri-Rody, D Kapur
Journal of symbolic computation 6 (1), 37-57, 1988
1201988
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20