Foundations of Information and Knowledge Systems

DOI10.1007/11663881zbMATH Open1177.03037OpenAlexW4212786759MaRDI QIDQ5898535FDOQ5898535

Authors: Javier Álvez, P. Lucio 

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11663881

Recommendations

• A new proposal of quasi-solved form for equality constraint solving
• scientific article; zbMATH DE number 1341610
• Equational formulae with membership constraints
• Equational problems and disunification
• A constraint solver for equations over sequences and contexts

zbMATH Keywords

constraint satisfactionequalitysolverterm algebraanswer

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70)

Cited In (6)

• An universal termination condition for solving goals in equational languages
• Solving a class of higher-order equations over a group structure
• The solution equivalence to general models for the RIM quantifier problem
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
• Constrained equational deduction
• Title not available (Why is that?)

This page was built for publication: Foundations of Information and Knowledge Systems

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