Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms

Alan Bundy; Kwabena Nuamah

doi:10.1007/978-3-031-16681-5_15

Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms

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

Abstract / Description of output

We introduce Unified Decomposition-Aggregation (UDA) rules. They are a family of axiom schemata that are instantiated at run-time to add new axioms to a logical theory. These new axioms are implications, whose preconditions will be constructed from an analysis of the goal to be proved and the theory in which it is to be proved. We illustrate their application to query answering using the FRANK system.

Original language	English
Title of host publication	Intelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings
Editors	Kevin Buzzard, Temur Kutsia
Pages	209-221
Number of pages	14
ISBN (Electronic)	978-3-031-16681-5
DOIs	https://doi.org/10.1007/978-3-031-16681-5_15
Publication status	Published - 17 Sept 2022
Event	15th Conference on Intelligent Computer Mathematics - Georgia, Tbilisi, Georgia Duration: 19 Sept 2022 → 23 Sept 2022 https://cicm-conference.org/2022/cicm.php

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Cham
Volume	13467
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th Conference on Intelligent Computer Mathematics
Abbreviated title	CICM 2022
Country/Territory	Georgia
City	Tbilisi
Period	19/09/22 → 23/09/22
Internet address	https://cicm-conference.org/2022/cicm.php

Keywords / Materials (for Non-textual outputs)

UDA rules
query answering
hybrid reasoning

Access to Document

10.1007/978-3-031-16681-5_15Licence: All Rights Reserved

CICM_2022_Decomposition_RulesAccepted author manuscript, 869 KBLicence: Creative Commons: Attribution (CC-BY)

https://link.springer.com/chapter/10.1007/978-3-031-16681-5_15Licence: All Rights Reserved

FRANK: Research Collaboration on Query Answering Systems
Bundy, A. & Fan, W.
Non-EU industry, commerce and public corporations
1/02/18 → 31/01/21
Project: Research

Cite this

Bundy, A., & Nuamah, K. (2022). Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms. In K. Buzzard, & T. Kutsia (Eds.), Intelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings (pp. 209-221). (Lecture Notes in Computer Science; Vol. 13467). https://doi.org/10.1007/978-3-031-16681-5_15

@inproceedings{fb9c7a2ede3042eda900c7549c798344,

title = "Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms",

abstract = "We introduce Unified Decomposition-Aggregation (UDA) rules. They are a family of axiom schemata that are instantiated at run-time to add new axioms to a logical theory. These new axioms are implications, whose preconditions will be constructed from an analysis of the goal to be proved and the theory in which it is to be proved. We illustrate their application to query answering using the FRANK system.",

keywords = "UDA rules, query answering, hybrid reasoning",

author = "Alan Bundy and Kwabena Nuamah",

note = "Funding Information: Acknowledgements. Thanks to Nicholas Ferguson, Thomas Fletcher, Xue Li, Ruqui Zhu and five anonymous reviewers for feedback on an earlier draft. This research has been supported by Huawei grants CIENG4721/LSC and HO2017050001B8s. For the purpose of open access, the author has applied a Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising from this submission. Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 15th Conference on Intelligent Computer Mathematics, CICM 2022 ; Conference date: 19-09-2022 Through 23-09-2022",

year = "2022",

month = sep,

day = "17",

doi = "10.1007/978-3-031-16681-5_15",

language = "English",

isbn = "978-3-031-16680-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer Cham",

pages = "209--221",

editor = "Kevin Buzzard and Temur Kutsia",

booktitle = "Intelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings",

url = "https://cicm-conference.org/2022/cicm.php",

}

Bundy, A & Nuamah, K 2022, Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms. in K Buzzard & T Kutsia (eds), Intelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13467, pp. 209-221, 15th Conference on Intelligent Computer Mathematics, Tbilisi, Georgia, 19/09/22. https://doi.org/10.1007/978-3-031-16681-5_15

Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms. / Bundy, Alan ; Nuamah, Kwabena.
Intelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings. ed. / Kevin Buzzard; Temur Kutsia. 2022. p. 209-221 (Lecture Notes in Computer Science; Vol. 13467).

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

TY - GEN

T1 - Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms

AU - Bundy, Alan

AU - Nuamah, Kwabena

N1 - Funding Information: Acknowledgements. Thanks to Nicholas Ferguson, Thomas Fletcher, Xue Li, Ruqui Zhu and five anonymous reviewers for feedback on an earlier draft. This research has been supported by Huawei grants CIENG4721/LSC and HO2017050001B8s. For the purpose of open access, the author has applied a Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising from this submission. Publisher Copyright: © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

PY - 2022/9/17

Y1 - 2022/9/17

N2 - We introduce Unified Decomposition-Aggregation (UDA) rules. They are a family of axiom schemata that are instantiated at run-time to add new axioms to a logical theory. These new axioms are implications, whose preconditions will be constructed from an analysis of the goal to be proved and the theory in which it is to be proved. We illustrate their application to query answering using the FRANK system.

AB - We introduce Unified Decomposition-Aggregation (UDA) rules. They are a family of axiom schemata that are instantiated at run-time to add new axioms to a logical theory. These new axioms are implications, whose preconditions will be constructed from an analysis of the goal to be proved and the theory in which it is to be proved. We illustrate their application to query answering using the FRANK system.

KW - UDA rules

KW - query answering

KW - hybrid reasoning

U2 - 10.1007/978-3-031-16681-5_15

DO - 10.1007/978-3-031-16681-5_15

M3 - Conference contribution

SN - 978-3-031-16680-8

T3 - Lecture Notes in Computer Science

SP - 209

EP - 221

BT - Intelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings

A2 - Buzzard, Kevin

A2 - Kutsia, Temur

T2 - 15th Conference on Intelligent Computer Mathematics

Y2 - 19 September 2022 through 23 September 2022

ER -

Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms

Abstract / Description of output

Publication series

Conference

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Projects

FRANK: Research Collaboration on Query Answering Systems

Cite this