Pages that link to "Item:Q4880540"
From MaRDI portal
The following pages link to Hyperresolution and automated model building (Q4880540):
Displayed 16 items.
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Tree tuple languages from the logic programming point of view (Q877842) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- A calculus combining resolution and enumeration for building finite models (Q1404976) (← 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)
- Efficient model generation through compilation. (Q1854374) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- The model evolution calculus as a first-order DPLL method (Q2389629) (← links)
- The ground-negative fragment of first-order logic is -complete (Q4934025) (← links)
- Decidability Results for Saturation-Based Model Building (Q5191116) (← links)
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)