Open AccessLogical derivation search with assumption traceability
Author(s) -
Adomas Birštunas,
Elena Reivytytė
Publication year - 2021
Publication title -
lietuvos matematikos rinkinys
Language(s) - English
Resource type - Journals
eISSN - 2335-898X
pISSN - 0132-2818
DOI - 10.15388/lmr.2021.25215
Subject(s) - traceability , set (abstract data type) , computer science , trace (psycholinguistics) , task (project management) , feature (linguistics) , base (topology) , propositional calculus , calculus (dental) , mathematics , theoretical computer science , algorithm , programming language , software engineering , engineering , systems engineering , medicine , mathematical analysis , linguistics , philosophy , dentistry
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.