Nominal equational problems

DOI10.1007/978-3-030-71995-1_2MaRDI QIDQ2233392zbMATH OpenOpenAlexFDO

Authors Mauricio Ayala-Rincón, Maribel Fernández, Deivid Vale, Daniele Nantes-Sobrinho

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-71995-1_2

zbMATH Keywords

disunificationnominal syntaxunification

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• AC complement problems: Satisfiability and negation elimination
• An efficient nominal unification algorithm
• Asymmetric unification and disunification
• Combination techniques and decision problems for disunification
• Equational problems and disunification
• Higher order disunification: some decidable cases
• scientific article; zbMATH DE number 176149 (Why is no real title available?)
• scientific article; zbMATH DE number 512857 (Why is no real title available?)
• Logic Programming
• Matching and alpha-equivalence check for nominal terms
• Narrowing based procedures for equational disunification
• Negation elimination in empty or permutative theories
• Negation elimination in equational formulae (extended abstract)
• Nominal (universal) algebra: equational logic with names and binding
• Nominal rewriting
• Nominal sets. Names and symmetry in computer science
• Nominal unification
• On solving equations and disequations
• On solving nominal disunification constraints
• α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic

Cited in

(3)

• Nominal equational logic
• Strong nominal semantics for fixed-point constraints
• A nominal approach to equational problems in languages with binders

This page was built for publication: Nominal equational problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233392)