Pages that link to "Item:Q1198235"

The following pages link to A method for simultaneous search for refutations and models by equational constraint solving (Q1198235):

Displaying 18 items.

• Constructing infinite models represented by tree automata (Q1044230) (← 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)
• The first order theory of primal grammars is decidable (Q1882903) (← links)
• A meta-logic of inference rules: Syntax (Q2987742) (← links)
• Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview (Q3537540) (← links)
• Superposition for Fixed Domains (Q3540186) (← links)
• Deciding the Inductive Validity of ∀ ∃ * Queries (Q3644758) (← links)
• A fast saturation strategy for set-theoretic tableaux (Q4610319) (← links)
• Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
• A method for building models automatically. Experiments with an extension of OTTER (Q5210763) (← links)
• Semantically guided first-order theorem proving using hyper-linking (Q5210771) (← links)
• Partial matching for analogy discovery in proofs and counter-examples (Q5234724) (← links)
• Building proofs or counterexamples by analogy in a resolution framework (Q5235252) (← links)
• Automated Model Building: From Finite to Infinite Models (Q5505496) (← links)
• Analogy in Automated Deduction: A Survey (Q5739522) (← links)
• Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)