A nondeterministic polynomial-time unification algorithm for bags, sets and trees

DOI10.1007/3-540-49019-1_13MaRDI QIDQ4260706zbMATH OpenFDO

Authors E. Ya. Dantsin, Andrei Voronkov

Publication date 1 September 1999

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

Full work available at URL https://doi.org/10.1007/3-540-49019-1_13

zbMATH Keywords

logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• An algorithm for general set unification and its complexity
• Set unification
• scientific article; zbMATH DE number 3995082
• scientific article; zbMATH DE number 1140684
• scientific article; zbMATH DE number 1337735

Cited in

(8)

• An algorithm for general set unification and its complexity
• An efficient labelled nested multiset unification algorithm
• Efficient unification of quantified terms
• scientific article; zbMATH DE number 1337735 (Why is no real title available?)
• scientific article; zbMATH DE number 1140684 (Why is no real title available?)
• scientific article; zbMATH DE number 1508935 (Why is no real title available?)
• Building Theorem Provers
• Set-term unification in a logic database language

Describes a project that uses

Uses Software

• Lilac

This page was built for publication: A nondeterministic polynomial-time unification algorithm for bags, sets and trees

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