Linear-input subset analysis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are performed. Three methods of detecting these situations are described in this paper. The first method (Horn subset analysis) focuses on Horn input chains while the second (LISS analysis) and third (LISL analysis) are successive generalisations of the first method. A significant benefit that may be derived from detecting linear-input subdeductions is the applicability of a truth value deletion strategy in such subdeductions. The completeness of the deletion strategy is proved, and its efficacy indicated.

Original languageEnglish (US)
Title of host publicationAutomated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings
PublisherSpringer Verlag
Pages268-280
Number of pages13
Volume607 LNAI
ISBN (Print)9783540556022
StatePublished - 1992
Externally publishedYes
Event11th International Conference on Automated Deduction, CADE, 1992 - Saratoga Springs, United States
Duration: Jun 15 1992Jun 18 1992

Publication series

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

Other

Other11th International Conference on Automated Deduction, CADE, 1992
CountryUnited States
CitySaratoga Springs
Period6/15/926/18/92

Fingerprint

Linear systems
Deletion
Subset
Deduction
Efficacy
Completeness
Strategy
Syntax
Generalization
Truth

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sutcliffe, G. (1992). Linear-input subset analysis. In Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings (Vol. 607 LNAI, pp. 268-280). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 607 LNAI). Springer Verlag.

Linear-input subset analysis. / Sutcliffe, Geoffrey.

Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. Vol. 607 LNAI Springer Verlag, 1992. p. 268-280 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 607 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sutcliffe, G 1992, Linear-input subset analysis. in Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. vol. 607 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 607 LNAI, Springer Verlag, pp. 268-280, 11th International Conference on Automated Deduction, CADE, 1992, Saratoga Springs, United States, 6/15/92.
Sutcliffe G. Linear-input subset analysis. In Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. Vol. 607 LNAI. Springer Verlag. 1992. p. 268-280. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sutcliffe, Geoffrey. / Linear-input subset analysis. Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. Vol. 607 LNAI Springer Verlag, 1992. pp. 268-280 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{da627769541d48ea8f9ee3bba414a016,
title = "Linear-input subset analysis",
abstract = "There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are performed. Three methods of detecting these situations are described in this paper. The first method (Horn subset analysis) focuses on Horn input chains while the second (LISS analysis) and third (LISL analysis) are successive generalisations of the first method. A significant benefit that may be derived from detecting linear-input subdeductions is the applicability of a truth value deletion strategy in such subdeductions. The completeness of the deletion strategy is proved, and its efficacy indicated.",
author = "Geoffrey Sutcliffe",
year = "1992",
language = "English (US)",
isbn = "9783540556022",
volume = "607 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "268--280",
booktitle = "Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings",

}

TY - GEN

T1 - Linear-input subset analysis

AU - Sutcliffe, Geoffrey

PY - 1992

Y1 - 1992

N2 - There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are performed. Three methods of detecting these situations are described in this paper. The first method (Horn subset analysis) focuses on Horn input chains while the second (LISS analysis) and third (LISL analysis) are successive generalisations of the first method. A significant benefit that may be derived from detecting linear-input subdeductions is the applicability of a truth value deletion strategy in such subdeductions. The completeness of the deletion strategy is proved, and its efficacy indicated.

AB - There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are performed. Three methods of detecting these situations are described in this paper. The first method (Horn subset analysis) focuses on Horn input chains while the second (LISS analysis) and third (LISL analysis) are successive generalisations of the first method. A significant benefit that may be derived from detecting linear-input subdeductions is the applicability of a truth value deletion strategy in such subdeductions. The completeness of the deletion strategy is proved, and its efficacy indicated.

UR - http://www.scopus.com/inward/record.url?scp=85029583934&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029583934&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540556022

VL - 607 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 280

BT - Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings

PB - Springer Verlag

ER -