The following pages link to (Q2751360):
Displaying 50 items.
- On rules (Q266650) (← links)
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) (Q385070) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
- Incremental preprocessing methods for use in BMC (Q453488) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Proximity-based unification theory (Q529054) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- A geometric interpretation of LD-resolution (Q596040) (← links)
- Unification, finite duality and projectivity in varieties of Heyting algebras (Q598304) (← links)
- Admissible rules in the implication-negation fragment of intuitionistic logic (Q638480) (← links)
- Best unifiers in transitive modal logics (Q647403) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \) (Q831218) (← links)
- Non-disjoint combined unification and closure by equational paramodulation (Q831919) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Permutative rewriting and unification (Q876048) (← links)
- Formal correctness of a quadratic unification algorithm (Q877825) (← links)
- Tree tuple languages from the logic programming point of view (Q877842) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Tractable query answering and rewriting under description logic constraints (Q975872) (← links)
- Matching and alpha-equivalence check for nominal terms (Q980937) (← links)
- Flat matching (Q999086) (← links)
- Solving quantified verification conditions using satisfiability modulo theories (Q1037401) (← links)
- Context unification with one context variable (Q1041589) (← links)
- Superposition with completely built-in abelian groups (Q1432887) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- Variadic equational matching in associative and commutative theories (Q2029000) (← links)
- Equational theorem proving modulo (Q2055853) (← links)
- Faster linear unification algorithm (Q2102937) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Terminating non-disjoint combined unification (Q2119106) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- Multiagent temporal logics, unification problems, and admissibilities (Q2160194) (← links)
- Scheduling complexity of interleaving search (Q2163166) (← links)
- Multi-agent logics with dynamic accessibly relations, projective unifiers (Q2165613) (← links)
- Anti-unification and the theory of semirings (Q2215964) (← links)
- Commutative rational term rewriting (Q2232282) (← links)
- Unification in pretabular extensions of S4 (Q2239389) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques (Q2294604) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- Distributive bilattices from the perspective of natural duality theory. (Q2343033) (← links)
