Canonicity!

Nachum Dershowitz

doi:10.1007/978-3-540-71070-7_29

Canonicity!

Nachum Dershowitz^*

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Automated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings
Pages	327-331
Number of pages	5
DOIs	https://doi.org/10.1007/978-3-540-71070-7_29
State	Published - 2008
Event	4th International Joint Conference on Automated Reasoning, IJCAR 2008 - Sydney, NSW, Australia Duration: 12 Aug 2008 → 15 Aug 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5195 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Joint Conference on Automated Reasoning, IJCAR 2008
Country/Territory	Australia
City	Sydney, NSW
Period	12/08/08 → 15/08/08

Access to Document

10.1007/978-3-540-71070-7_29

Cite this

@inproceedings{63847d5c2aba4a8d9a28c5c28fd3bb2b,

title = "Canonicity!",

abstract = "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.",

author = "Nachum Dershowitz",

year = "2008",

doi = "10.1007/978-3-540-71070-7_29",

language = "אנגלית",

isbn = "3540710698",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "327--331",

booktitle = "Automated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings",

note = "null ; Conference date: 12-08-2008 Through 15-08-2008",

}

Dershowitz, N 2008, Canonicity! in Automated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5195 LNAI, pp. 327-331, 4th International Joint Conference on Automated Reasoning, IJCAR 2008, Sydney, NSW, Australia, 12/08/08. https://doi.org/10.1007/978-3-540-71070-7_29

Canonicity! / Dershowitz, Nachum.

Automated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings. 2008. p. 327-331 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5195 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

Canonicity!

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this