The following pages link to (Q5679729):
Displaying 50 items.
- Evidence algorithm and inference search in first-order logics (Q286802) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Inverse subsumption for complete explanatory induction (Q439023) (← links)
- Reasoning about conditional probabilities in a higher-order-logic theorem prover (Q545151) (← links)
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases (Q549726) (← links)
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Number of models and satisfiability of sets of clauses (Q672138) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- The relative complexity of analytic tableaux and SL-resolution (Q687165) (← links)
- Parsing as non-Horn deduction (Q688151) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Automation methods for logical derivation and their application in the control of dynamic and intelligent systems (Q742012) (← links)
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- An efficient strategy for non-Horn deductive databases (Q753478) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- On the relation between resolution based and completion based theorem proving (Q758218) (← links)
- \((\alpha, \beta)\)-ordered linear resolution of intuitionistic fuzzy propositional logic (Q778417) (← links)
- Proof search algorithm in pure logical framework (Q779163) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Plausible inferences and plausible reasoning (Q805605) (← links)
- A resolution rule for well-formed formulae (Q808295) (← links)
- The reliability of reasoning with unreliable arguments (Q808732) (← links)
- A relevance restriction strategy for automated deduction (Q814429) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- On the decidability of open logic (Q848254) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- The ILTP problem library for intuitionistic logic (Q877897) (← links)
- Defining answer classes using resolution refutation (Q881832) (← links)
- A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic (Q894383) (← links)
- E-ccc: between ccc and topos, - its expressive power from the viewpoint of data type theory (Q908685) (← links)
- On the decomposition of datalog program mappings (Q915437) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Un-Skolemizing clause sets (Q920968) (← links)
- Strategies for modal resolution: Results and problems (Q920970) (← links)
- Optimal pattern recognition procedures and their application (Q941191) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- A simple deduction method for modal logic (Q1051628) (← links)
- Equational methods in first order predicate calculus (Q1065783) (← links)
- Maximal unifiable subsets and minimal non-unifiable subsets (Q1075061) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Completeness results for inequality provers (Q1079960) (← links)
