Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Faster linear unification algorithm

From MaRDI portal
Publication:2102937
Jump to:navigation, search

DOI10.1007/s10817-022-09635-1OpenAlexW4290888552MaRDI QIDQ2102937

Dennis de Champeaux

Publication date: 12 December 2022

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-022-09635-1


zbMATH Keywords

theorem provinglinear unificationplanning action precondition checking


Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)



Uses Software

  • GitHub


Cites Work

  • Unnamed Item
  • About the Paterson-Wegman linear unification algorithm
  • Linear unification
  • An Efficient Unification Algorithm
  • A Proof Procedure Using Connection Graphs
  • A Machine-Oriented Logic Based on the Resolution Principle




This page was built for publication: Faster linear unification algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2102937&oldid=14588197"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki