The following pages link to (Q5541351):
Displaying 50 items.
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs (Q286731) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Parsing as non-Horn deduction (Q688151) (← 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)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Steps toward a computational metaphysics (Q877243) (← links)
- Completeness of resolution revisited (Q914411) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Theorem proving with abstraction (Q1149799) (← links)
- Lower bounds for increasing complexity of derivations after cut elimination (Q1167721) (← links)
- The Earley algorithm as a problem representation (Q1212802) (← links)
- Experimental tests of resolution-based theorem-proving strategies (Q1230669) (← links)
- An implementation of hyper-resolution (Q1231393) (← links)
- Analytic resolution in theorem proving (Q1233325) (← links)
- Mechanizing \(\omega\)-order type theory through unification (Q1239309) (← links)
- Metamathematical approach to proving theorems of discrete mathematics (Q1255328) (← links)
- Basic research problems: The problem of strategy and hyperresolution (Q1332645) (← links)
- The rue theorem-proving system: The complete set of LIM+ challenge problems (Q1337564) (← links)
- The problem of hyperparamodulation (Q1337565) (← links)
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction (Q1344881) (← links)
- The application of automated reasoning to questions in mathematics and logic (Q1354049) (← links)
- Hyperresolution for guarded formulae (Q1404983) (← links)
- A new fuzzy resolution principle based on the antonym (Q1568493) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Presenting inequations in mathematical proofs (Q1818758) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- The anatomy of vampire. Implementing bottom-up procedures with code trees (Q1904404) (← links)
- Jean van Heijenoort's contributions to proof theory and its history (Q1942094) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Contradiction separation based dynamic multi-clause synergized automated deduction (Q2198231) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← links)
- Hyperresolution for Gödel logic with truth constants (Q2328910) (← links)
- Finding resolution proofs and using duplicate goals in AND/OR trees (Q2549243) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- Beweisalgorithmen für die Prädikatenlogik (Q2558006) (← links)
- The application of the methods of the theory of logical derivation to graph theory (Q2558225) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- A Modal-Layered Resolution Calculus for K (Q3455770) (← links)
- Semantical Completeness Theorems in Logic and Algebra (Q3900058) (← links)
- Unsatisfiable Formulae of Gödel Logic with Truth Constants and $$\varDelta $$ Are Recursively Enumerable (Q4557171) (← links)
- Tableaux for diagnosis applications (Q4610316) (← links)
- Minimal model generation with positive unit hyper-resolution tableaux (Q4645233) (← links)
- Advanced indexing operations on substitution trees (Q4647547) (← links)
