No label defined (Q3751043)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3988746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3988746 |
Statements
1985
0 references
rule of inference
0 references
deduction system
0 references
quantifier-free predicate calculus
0 references
automated deduction
0 references
0.828767716884613
0 references
0.8067222237586975
0 references
[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.
0 references