Graded quantitative narrowing
From MaRDI portal
Cites work
- Abstract logical model checking of infinite-state systems using narrowing
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis
- Approximate reasoning by similarity-based SLD resolution.
- Certified first-order AC-unification and applications.
- Completeness results for basic narrowing
- Constraint solving over multiple similarity relations
- Folding variant narrowing and optimal variant termination
- Formalising nominal C-unification generalised with protected variables
- Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 1455621 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 7297850 (Why is no real title available?)
- Logic, rewriting, and concurrency. Essays dedicated to José Meseguer on the occasion of his 65th birthday
- Metric spaces, generalized logic, and closed categories
- Modular termination of basic narrowing and equational unification
- Narrowing and rewriting logic: from foundations to applications
- Nominal AC-matching
- Proximity-based unification theory
- Quantitative Algebraic Reasoning
- Quantitative Equational Reasoning
- Solving quantitative equations
- Term Rewriting and All That
- Termination of narrowing revisited
- Unification theory
This page was built for publication: Graded quantitative narrowing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856423)
