The following pages link to SATCHMO (Q18707):
Displaying 39 items.
- (Q4412862) (← links)
- Programming in logic without logic programming (Q4593027) (← links)
- MGTP: A model generation theorem prover — Its advanced features and applications — (Q4610311) (← links)
- Tableaux for diagnosis applications (Q4610316) (← links)
- Projection: A unification procedure for tableaux in Conceptual Graphs (Q4610329) (← links)
- Simplifying and generalizing formulae in tableaux. Pruning the search space and building models (Q4610336) (← links)
- Minimal model generation with positive unit hyper-resolution tableaux (Q4645233) (← links)
- A tableau calculus for minimal model reasoning (Q4645243) (← links)
- System description generating models by SEM (Q4647530) (← links)
- Efficient model generation through compilation (Q4647539) (← links)
- (Q4694705) (← links)
- (Q4698602) (← links)
- (Q4707748) (← links)
- Hyperresolution and automated model building (Q4880540) (← links)
- Superposition for Bounded Domains (Q4913861) (← links)
- MACE4 and SEM: A Comparison of Finite Model Generators (Q4913862) (← links)
- A Resolution-based Model Building Algorithm for a Fragment of OCC1N = (Q4916224) (← links)
- The crisis in finite mathematics: Automated reasoning as cause and cure (Q5210758) (← 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)
- Proving with BDDs and control of information (Q5210793) (← links)
- Problems on the generation of finite models (Q5210810) (← links)
- LeanT A P: Lean tableau-based theorem proving (Q5210813) (← links)
- Lemma matching for a PTTP-based top-down theorem prover (Q5234698) (← links)
- Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving (Q5234700) (← links)
- Constructing a normal form for Property Theory (Q5234704) (← links)
- Soft typing for ordered resolution (Q5234715) (← links)
- Hyper tableaux (Q5235250) (← links)
- About Knowledge and Inference in Logical and Relational Learning (Q5305720) (← links)
- Automating Coherent Logic (Q5387843) (← links)
- KI 2004: Advances in Artificial Intelligence (Q5450782) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479279) (← links)
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic (Q5504659) (← links)
- Automated Model Building: From Finite to Infinite Models (Q5505496) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705930) (← links)
- Mechanizing Mathematical Reasoning (Q5717443) (← links)
- Theorem proving techniques for view deletion in databases (Q5927980) (← links)
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)
- I-SATCHMO: An improvement of SATCHMO (Q5956123) (← links)
