Summarizing knowledge base with modal conditionals

Authors:
Grzegorz Skorupa;Radosław Katarzyniak
Affiliations:
Institute of Informatics, Wroclaw University of Technology, Poland;Institute of Informatics, Wroclaw University of Technology, Poland
Venue:
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Year:
2012

Citing 4
Cited 0

The symbol grounding problem

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Applying possibility and belief operators to conditional statements

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Conditional statements grounded in past, present and future

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
Modelling relationship between antecedent and consequent in modal conditional statements

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Work proposes and evaluates a method of summarizing transaction base with conditional formulas and their modal extensions. Modality expresses certainty levels using phrases 'It is possible, that' and 'I believe, that'. Method is based on previous works on grounding of natural language statements. Semantics of conditionals, as opposed to associative rules, are consistent with their conventional natural language meaning. A software simulation is described and implemented. Some interesting results are discussed showing methods pros and cons.