Pages that link to "Item:Q1100924"
From MaRDI portal
The following pages link to Explicit representation of terms defined by counter examples (Q1100924):
Displaying 33 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)
- Multilevel counterfactuals for generalizations of relational concepts and productions (Q1145515) (← links)
- Flattening and saturation: Two representation changes for generalization (Q1326585) (← links)
- Explicit representation of concept negation (Q1326586) (← 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)
- Equational formulas and pattern operations in initial order-sorted algebras (Q2628298) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Q2964454) (← links)
- First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation (Q2964455) (← links)
- (Q3761721) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
- Open problems in rewriting (Q5055780) (← links)
- The negation elimination from syntactic equational formula is decidable (Q5055804) (← links)
- AC complement problems: Satisfiability and negation elimination (Q5055807) (← links)
- More problems in rewriting (Q5055812) (← links)
- Negation elimination in equational formulae (Q5096830) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Decidability Results for Saturation-Based Model Building (Q5191116) (← links)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355) (← links)
- Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras (Q5743584) (← links)
- Computing linearizations using test sets (Q5881192) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)