Canonicity!

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAutomated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings
Pages327-331
Number of pages5
DOIs
StatePublished - 2008
Event4th International Joint Conference on Automated Reasoning, IJCAR 2008 - Sydney, NSW, Australia
Duration: 12 Aug 200815 Aug 2008

Publication series

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

Conference

Conference4th International Joint Conference on Automated Reasoning, IJCAR 2008
Country/TerritoryAustralia
CitySydney, NSW
Period12/08/0815/08/08

Fingerprint

Dive into the research topics of 'Canonicity!'. Together they form a unique fingerprint.

Cite this