The following pages link to N. K. Zamov (Q583186):
Displaying 50 items.
- Model evolution with equality -- revised and implemented (Q429586) (← links)
- Analytic tableaux for higher-order logic with choice (Q438561) (← links)
- Matching - a special case of unification? (Q582272) (← links)
- Maslov's inverse method and decidable classes (Q583187) (← links)
- (Q587551) (redirect page) (← links)
- (Q592079) (redirect page) (← links)
- On decidability of the decomposability problem for finite theories (Q630293) (← links)
- Lightweight hybrid tableaux (Q631086) (← links)
- Best unifiers in transitive modal logics (Q647403) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Guide to scientific computing in C++ (Q764852) (← links)
- Binary resolution over Boolean lattices (Q853473) (← links)
- Equilibrium logic (Q854969) (← links)
- A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
- Application of isograms in the search for inference (Q1102128) (← links)
- Restriction of term complexity in derivations and decidable fragments of predicate calculus (Q1102933) (← links)
- One modification of the ordering strategy in the resolution method (Q1115411) (← links)
- Decision tactics for derivation search in the resolution method (Q1115412) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Order-sorted completion: The many-sorted way (Q1177935) (← links)
- The linked inference principle. I: The formal treatment (Q1189727) (← links)
- SLDNF-resolution with equality (Q1189731) (← links)
- Complete extension of general logic programs (Q1190477) (← links)
- A method for simultaneous search for refutations and models by equational constraint solving (Q1198235) (← links)
- Probabilistic logic programming (Q1207942) (← links)
- On a bound for the complexity of terms in the resolution method (Q1217465) (← links)
- Proof search in intuitionistic logic with equality, or back to simultaneous rigid \(E\)-unification (Q1272615) (← links)
- Resolution and model building in the infinite-valued calculus of Łukasiewicz (Q1276262) (← links)
- A proof procedure for the logic of hereditary Harrop formulas (Q1311397) (← links)
- A declarative approach for first-order built-in's of Prolog (Q1328181) (← links)
- Resolution theorem proving in reified modal logics (Q1332644) (← links)
- The semantics of answer literals (Q1357665) (← links)
- Proof theory and automated deduction (Q1379289) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Efficient resource management for linear logic proof search (Q1575929) (← links)
- Deciding the \(E^+\)-class by an a posteriori, liftable order (Q1577484) (← links)
- Qualitative spatial reasoning with topological information (Q1600087) (← links)
- Safe beliefs for propositional theories (Q1779312) (← links)
- Logic programming '88. Proceedings of the 7th conference, Tokyo, Japan, April 11-14, 1988 (Q1801279) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- On the logic of unification (Q1823935) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- Comparing approaches to resolution based higher-order theorem proving (Q1868166) (← links)
- Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus (Q1869616) (← links)
- A simplified form of condensed detachment (Q1903086) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Embedding and automating conditional logics in classical higher-order logic (Q1935597) (← links)
- Best solving modal equations (Q1971794) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
