The following pages link to (Q3829089):
Displaying 39 items.
- Automated reasoning in social choice theory: some remarks (Q475377) (← links)
- Learning-assisted theorem proving with millions of lemmas (Q485842) (← links)
- A curious new result in switching theory (Q582260) (← links)
- Parsing as non-Horn deduction (Q688151) (← links)
- Automation methods for logical derivation and their application in the control of dynamic and intelligent systems (Q742012) (← links)
- A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains (Q759491) (← links)
- The absence and the presence of fixed point combinators (Q807612) (← links)
- Basic research problems: The problem of choosing the representation, inference rule, and strategy (Q809627) (← links)
- The problem of choosing the type of subsumption to use (Q809628) (← links)
- Meeting the challenge of fifty years of logic (Q911807) (← links)
- Automated theorem proving methods (Q1057850) (← links)
- Using automated reasoning tools: A study of the semigroup \(F_ 2B_ 2\) (Q1095680) (← links)
- A case study in automated theorem proving: Finding sages in combinatory logic (Q1098333) (← links)
- Inconsistency check of a set of clauses using Petri net reductions (Q1100906) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- Hybrid reasoning using universal attachment (Q1329365) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- The application of automated reasoning to questions in mathematics and logic (Q1354049) (← links)
- Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system (Q1364068) (← links)
- Solving problems with automated reasoning, expert systems and neural networks (Q1366217) (← links)
- Using tactics to reformulate formulae for resolution theorem proving (Q1380410) (← links)
- Automated deduction. A basis for applications. Vol. 1: Foundations, calculi and methods (Q1581358) (← links)
- Automated deduction. A basis for applications. Vol. 2: Systems and implementation techniques (Q1581359) (← links)
- Structuring and automating hardware proofs in a higher-order theorem- proving environment (Q1801500) (← links)
- The problem of guaranteeing the existence of a complete set of reductions (Q1823015) (← links)
- Running time experiments on some algorithms for solving propositional satisfiability problems (Q1897402) (← links)
- Automated Reasoning in the Wild (Q3454081) (← links)
- Machines Reasoning About Machines: 2015 (Q3460540) (← links)
- (Q3738607) (← links)
- (Q4003525) (← links)
- Using resolution for deciding solvable classes and building finite models (Q4560350) (← links)
- Paraconsistency and word puzzles (Q4593052) (← links)
- On sets, types, fixed points, and checkerboards (Q4645222) (← links)
- Propositional calculus problems in CHIP (Q5096196) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- The jobs puzzle: Taking on the challenge via controlled natural language processing (Q5398290) (← links)
- Hyper resolution and equality axioms without function substitutions (Q6488551) (← links)
- Automated reasoning contributes to mathematics and logic (Q6488553) (← links)
