22 search results - page 1 / 5 » Common subproofs in proof pairs |
ENGL
2007
13 years 4 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
EUROCAST
2007
Springer
13 years 10 months ago
2007
Springer
CADE
2004
Springer
13 years 10 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...
TACAS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
PERCOM
2004
ACM
14 years 4 months ago
2004
ACM
RFID (Radio-Frequency Identification) tags are small, inexpensive microchips capable of transmitting unique identifiers wirelessly over a short distance. Thanks to their utility i...