OpenAlex
PricingAboutJobs
Log inGet started
Work

A rule-based algorithm for rigid E-unification

HTML

Year: 2005
Type: conference-paper
Source: Springer eBooks
Parent work: Computational Logic and Proof Theory: Third Kurt Gödel Colloquium, KGC'93 Brno, Czech Republic, August 24–27, 1993 Proceedings
DOI: 10.1007/bfb0022569
Author: Jean Goubault
Language: English

Topic: Logic, programming, and type systems
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: rule-based algorithm, congruence closure, term rewriting, NP-completeness, unification, term structure, termination proofs, soundness and completeness

Open Access status: closed
OpenAlex ID: W1499814173
FWCI: 0.175
Cites: 15
Cited by: 19
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security