- Authors:
-
Bonacina, Maria Paola; Nachum, Dershowitz
- Title:
-
Abstract canonical inference
- Year:
-
2007
- Type of item:
-
Articolo in Rivista
- Tipologia ANVUR:
- Articolo su rivista
- Language:
-
Inglese
- Format:
-
A Stampa
- Referee:
-
Sì
- Name of journal:
- ACM Transactions on Computational Logic
- ISSN of journal:
- 1529-3785
- N° Volume:
-
8
- Number or Folder:
-
1
- :
- ACM
- Page numbers:
-
180-208
- Keyword:
-
Inference; completeness; completion; canonicity; saturation; redundancy; fairness; proof orderings
- Short description of contents:
- An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) ``fairness,'' which yields completeness, and ``uniform fairness,'' which yields saturation.
- Web page:
-
http://dx.doi.org/10.1145/1182613.1182619; http://profs.sci.univr.it/~bonacina
- Product ID:
-
20974
- Handle IRIS:
-
11562/20974
- Deposited On:
-
March 15, 2012
- Last Modified:
-
August 7, 2022
- Bibliographic citation:
-
Bonacina, Maria Paola; Nachum, Dershowitz,
Abstract canonical inference
«ACM Transactions on Computational Logic»
, vol.
8
, n.
1
,
2007
,
pp. 180-208
Consulta la scheda completa presente nel
repository istituzionale della Ricerca di Ateneo 
