The following pages link to (Q4139711):
Displayed 47 items.
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- ABox abduction in the description logic \(\mathcal{ALC}\) (Q2429984) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- Book review of: S. Russell and P. Norvig, Artificial intelligence: a modern approach (Q2674210) (← links)
- The practicality of generating semantic trees for proofs of unsatisfiability (Q2710799) (← links)
- (Q2741521) (← links)
- Generalized Conflict-Clause Strengthening for Satisfiability Solvers (Q3007694) (← links)
- Answering atomic queries in indefinite deductive databases (Q3486861) (← links)
- Combining Instance Generation and Resolution (Q3655208) (← links)
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions (Q3916545) (← links)
- Subgoal alternation in model elimination (Q4610327) (← links)
- Simplifying and generalizing formulae in tableaux. Pruning the search space and building models (Q4610336) (← links)
- Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unification (Q4647498) (← links)
- SiCoTHEO: Simple competitive parallel theorem provers (Q4647520) (← links)
- XRay: A prolog technology theorem prover for default reasoning: A system description (Q4647525) (← links)
- A new method for knowledge compilation: The achievement by cycle search (Q4647543) (← links)
- Semantic trees revisited: Some new completeness results (Q4647548) (← links)
- Uniform and non uniform strategies for tableaux calculi for modal logics (Q4835516) (← links)
- A Resolution-based Model Building Algorithm for a Fragment of OCC1N = (Q4916224) (← links)
- 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) (← links)
- Goal directed strategies for paramodulation (Q5055756) (← links)
- Propositional calculus problems in CHIP (Q5096196) (← links)
- Local simplification (Q5096297) (← links)
- Simplifying clausal satisfiability problems (Q5096298) (← links)
- Embedding circumscriptive theories in general disjunctive programs (Q5101461) (← links)
- Building Theorem Provers (Q5191110) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Semantic tableaux with ordering restrictions (Q5210807) (← links)
- Automatic verification of cryptographic protocols with SETHEO (Q5234693) (← links)
- Lemma matching for a PTTP-based top-down theorem prover (Q5234698) (← links)
- Exact knowledge compilation in predicate calculus: The partial achievement case (Q5234699) (← links)
- A classification of non-liftable orders for resolution (Q5234716) (← links)
- An algorithm for the retrieval of unifiers from discrimination trees (Q5235251) (← links)
- Building proofs or counterexamples by analogy in a resolution framework (Q5235252) (← links)
- What you always wanted to know about rigid E-unification (Q5235253) (← links)
- Mode-Directed Inverse Entailment for Full Clausal Theories (Q5452095) (← links)
- An automatic proof of Gödel's incompleteness theorem (Q5906916) (← links)
- Controlled use of clausal lemmas in connection tableau calculi (Q5927985) (← links)
- Connection calculus theorem proving with multiple built-in theories (Q5927987) (← links)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (Q5946276) (← links)
- Fuzzy logic programming (Q5946475) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
- Subsumption-linear Q-resolution for QBF theorem proving (Q6199591) (← links)