scientific article; zbMATH DE number 3988746

From MaRDI portal
Publication:3751043





[For the entire collection see Zbl 0568.00019.] This paper presents a generalization of resolution methods, named path resolution, which operates on a representation of formulas in negation normal form (NNF) called by the authors semantic graphs. Path resolution is a synthesized work of the most influential ideas in the field of automated deduction, i.e. Robinson's clash resolution, Kowalski's connection-graph procedure, Andrews and Bibel's ideas, Stickel's non- clausal systems and ideas of Waldinger and Manna. After a short introduction, in which automated deduction efforts are classified according to a space defined by two scales (one is a measure of normalization that a system requires of its formulas, the other is a measure of the size of inferences allowed), the notation and terminology used to express formulas and their semantics are introduced. The formalism is developed in the next section. Then path resolution is introduced. The final section contains two examples. Most of the proofs are omitted, but they can be found in a technical report of the authors.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751043)