Name
Abstract | ||
|---|---|---|
Kapur and Subramaniam [12] defined syntactical classes of equations where inductive validity can be decided automatically. However, these classes are quite restrictive, since defined function symbols with recursive definitions may only appear on one side of the equations. In this paper, we expand the decidable class of equations significantly by allowing both sides of equations to be expressed using defined function symbols. The definitions of these function symbols must satisfy certain restrictions which can be checked mechanically. These results are crucial to increase the applicability of decision procedures for induction. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-45085-6_3 | Lecture Notes in Artificial Intelligence |
Keywords | Field | DocType |
satisfiability | Discrete mathematics,Computer science,Algorithm,Decidability,Recursive functions,Recursion | Conference |
Volume | ISSN | Citations |
2741 | 0302-9743 | 7 |
PageRank | References | Authors |
0.49 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Giesl | 1 | 2048 | 124.90 |
| Deepak Kapur | 2 | 2282 | 235.00 |