Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On determining the causes of nonunifiability

From MaRDI portal
Jump to:navigation, search

DOI10.1016/0743-1066(87)90021-5zbMATH Open0626.68067OpenAlexW2021550537MaRDI QIDQ3030271FDOQ3030271


Authors: P. T. Cox Edit this on Wikidata


Publication date: 1987

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(87)90021-5




Recommendations

  • Maximal unifiable subsets and minimal non-unifiable subsets
  • scientific article; zbMATH DE number 3858458
  • scientific article; zbMATH DE number 3871321
  • Intractable unifiability problems and backtracking
  • On the sequential nature of unification


zbMATH Keywords

unificationlogic programmingnondeterministic pushdown automaton


Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)



Cited In (3)

  • Source-tracking unification
  • Intractable unifiability problems and backtracking
  • Maximal unifiable subsets and minimal non-unifiable subsets





This page was built for publication: On determining the causes of nonunifiability

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3030271&oldid=16066883"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:37. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki