5550 search results - page 23 / 1110 » Different Approaches to Proof Systems |
146
click to vote
APVIS
2011
13 years 10 months ago
2011
Many data sets exist that contain both geospatial and temporal elements. Within such data sets, it can be difficult to determine how the data have changed over spatial and tempor...
ENTCS
2006
14 years 10 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
CADE
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
ISDA
2006
IEEE
15 years 4 months ago
2006
IEEE
The last decade has witnessed an exponential growth of sequence information in the field of biological macromolecules such as proteins and nucleic acids and their interactions wit...
133
click to vote
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...