
doi: 10.5109/13428
Summary: Analogy is described in terms of predicate logic. The paper considers the complexity of analogical reasoning in which no function symbols except constants are allowed. We show that the problem of deciding whether a given atomic formula can be inferred by analogy is NP-hard.
Analysis of algorithms and problem complexity, NP-hard, analogical reasoning, Theorem proving (deduction, resolution, etc.)
Analysis of algorithms and problem complexity, NP-hard, analogical reasoning, Theorem proving (deduction, resolution, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
