Pages that link to "Item:Q1100924"
From MaRDI portal
The following pages link to Explicit representation of terms defined by counter examples (Q1100924):
Displayed 14 items.
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- The DNF exception problem (Q818117) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- Equational problems and disunification (Q1124372) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- On the complexity of equational problems in CNF (Q1404988) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Explicit versus implicit representations of subsets of the Herbrand universe. (Q1853582) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Decidability Results for Saturation-Based Model Building (Q5191116) (← links)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)