Structural Resolution for Logic Programming

Patricia Johann, Ekaterina Komendantskaya, Vladimir Komendantskiy · arXiv (Cornell University) · 2015

We introduce a Three Tier Tree Calculus (3TC) that defines in a systematic way three tiers of tree structures underlying proof search in logic programming. We use 3TC to define a new -- structural -- version of resolution for logic programming.

Read the paper · More papers on PaperTik