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

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

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.
Original languageEnglish
Title of host publicationIntelligent Computer Mathematics: 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings
EditorsKevin Buzzard, Temur Kutsia
Pages209-221
Number of pages14
ISBN (Electronic)978-3-031-16681-5
DOIs
Publication statusPublished - 17 Sep 2022
Event15th Conference on Intelligent Computer Mathematics - Georgia, Tbilisi, Georgia
Duration: 19 Sep 202223 Sep 2022
https://cicm-conference.org/2022/cicm.php

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Cham
Volume13467
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th Conference on Intelligent Computer Mathematics
Abbreviated titleCICM 2022
Country/TerritoryGeorgia
CityTbilisi
Period19/09/2223/09/22
Internet address

Keywords

  • UDA rules
  • query answering
  • hybrid reasoning

Fingerprint

Dive into the research topics of 'Unified Decomposition-Aggregation (UDA) Rules: Dynamic, Schematic, Novel Axioms'. Together they form a unique fingerprint.

Cite this