TY - GEN
T1 - Canonicity!
AU - Dershowitz, Nachum
PY - 2008
Y1 - 2008
N2 - We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. This leads to robust notions of canonical presentation and redundancy. Fairness of deductive mechanisms - in this general framework - leads to completeness or saturation. The method has so far been applied to the equational, Horn-clause, and deduction-modulo cases.
AB - We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. This leads to robust notions of canonical presentation and redundancy. Fairness of deductive mechanisms - in this general framework - leads to completeness or saturation. The method has so far been applied to the equational, Horn-clause, and deduction-modulo cases.
UR - http://www.scopus.com/inward/record.url?scp=53049095204&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-71070-7_29
DO - 10.1007/978-3-540-71070-7_29
M3 - פרסום בספר כנס
AN - SCOPUS:53049095204
SN - 3540710698
SN - 9783540710691
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 327
EP - 331
BT - Automated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings
Y2 - 12 August 2008 through 15 August 2008
ER -