Logical derivation search with assumption traceability
Articles
Adomas Birštunas
Vilnius University
https://orcid.org/0000-0003-4574-1534
Elena Reivytytė
Vilnius University
Published 2021-12-15
https://doi.org/10.15388/LMR.2021.25215
PDF

Keywords

propositional logic
traceability
loop checking

How to Cite

Birštunas A. and Reivytytė E. (2021) “Logical derivation search with assumption traceability”, Lietuvos matematikos rinkinys, 62(A), pp. 16-22. doi: 10.15388/LMR.2021.25215.

Abstract

In this paper authors research the problem of traceability of assumptions in logical derivation. The essence of this task is to trace which assumptions from the available knowledge base of assumptions are necessary to derive a certain conclusion. The paper presents a new derivation procedure for propositional logic, which ensures traceability feature. For the derivable conclusion formula derivation procedure also returns the smallest set of assumptions those are enough to get derivation of the conclusion formula. Verification of the procedure were performed using authors implementation.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy