SATCHMO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Completeness of hyper-resolution via the semantics of disjunctive logic programs
- LeanT A P: Lean tableau-based theorem proving
- Automating Coherent Logic
- I-SATCHMO: An improvement of SATCHMO
- Problems on the generation of finite models
- MACE4 and SEM: a comparison of finite model generators
- Structuring and automating hardware proofs in a higher-order theorem- proving environment
- The model evolution calculus as a first-order DPLL method
- Logic for Programming, Artificial Intelligence, and Reasoning
- Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving
- Efficient model generation through compilation
- History and prospects for first-order automated deduction
- Short Conjunctive Normal Forms in Finitely Valued Logics
- Generating relevant models
- Proving with BDDs and control of information
- The crisis in finite mathematics: Automated reasoning as cause and cure
- SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
- Programming in logic without logic programming
- A method for building models automatically. Experiments with an extension of OTTER
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Soft typing for ordered resolution
- A relevance restriction strategy for automated deduction
- Hyperresolution and automated model building
- Hyper tableaux
- The hyper tableaux calculus with equality and an application to finite model computation
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models
- A new method for automated finite model building exploiting failures and symmetries
- Efficient model generation through compilation.
- The anatomy of vampire. Implementing bottom-up procedures with code trees
- Blocking and other enhancements for bottom-up model generation methods
- Blocking and Other Enhancements for Bottom-Up Model Generation Methods
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- scientific article; zbMATH DE number 753769 (Why is no real title available?)
- scientific article; zbMATH DE number 559756 (Why is no real title available?)
- A tableau calculus for minimal model reasoning
- Minimal model generation with positive unit hyper-resolution tableaux
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
- Positive unit hyperresolution tableaux and their application to minimal model generation
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Lemma matching for a PTTP-based top-down theorem prover
- Theorem proving techniques for view deletion in databases
- scientific article; zbMATH DE number 1301750 (Why is no real title available?)
- Automated reasoning with analytic tableaux and related methods. 20th international conference, TABLEAUX 2011, Bern, Switzerland, July 4--8, 2011. Proceedings
- Abductive logic programming agents with destructive databases
- Eliminating redundant search space on backtracking for forward chaining theorem proving
- \(\mathcal I\)-SATCHMORE: An improvement of \(\mathcal A\)-SATCHMORE
- scientific article; zbMATH DE number 515732 (Why is no real title available?)
- scientific article; zbMATH DE number 1926616 (Why is no real title available?)
- SATCHMORE: SATCHMO with RElevancy
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- scientific article; zbMATH DE number 1950264 (Why is no real title available?)
- System description generating models by SEM
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
- scientific article; zbMATH DE number 1348483 (Why is no real title available?)
- scientific article; zbMATH DE number 51274 (Why is no real title available?)
- Nonmonotonic reasoning: Towards efficient calculi and implementations
- KI 2004: Advances in Artificial Intelligence
- Semantically-guided goal-sensitive reasoning: inference system and completeness
- Automated deduction techniques for the management of personalized documents. (Extended abstract)
- A fixpoint characterization of abductive logic programs
- Superposition for bounded domains
- Reasoning under minimal upper bounds in propositional logic
- Representing and building models for decidable subclasses of equational clausal logic
- Some techniques for proving termination of the hyperresolution calculus
- System Description: E- KRHyper
- About knowledge and inference in logical and relational learning
- Simplifying and generalizing formulae in tableaux. Pruning the search space and building models
- Computer supported mathematics with MEGA
- Semantically guided first-order theorem proving using hyper-linking
- Model building with ordered resolution: Extracting models from saturated clause sets
- The disconnection tableau calculus
- scientific article; zbMATH DE number 1341618 (Why is no real title available?)
- Computing answers with model elimination
- Constructing a normal form for property theory
- Model generation and state generation for disjunctive logic programs
- SETHEO
- HYPROLOG
- OTTER
- Darwin
- FINDER
- DCTP
- DWAM
- GrAnDe
- I-SATCHMO
- R-SATCHMO
- SATCHMOREBID
- SCOTT
- wamcc
- E-Darvin
- E-SETHEO
- iProver-Eq
- MGTP
- aleanTAP
- leanTAP
- linTAP
- FALCON
- CLIN
- SNARK
- Waldmeister
- Doris
This page was built for software: SATCHMO
