OpenAlex
PricingAboutJobs
Log inGet started
Work

Fast subsumption algorithms

HTML

Year: 1985
Type: conference-paper
Source: Lecture notes in computer science
Parent work: EUROCAL '85: European Conference on Computer Algebra Linz, Austria, April 1–3 1985 Proceedings Vol. 2: Research Contributions
DOI: 10.1007/3-540-15984-3_239
Authors: G. Gottlob, A. Leitsch
Institution: Vienna University of Economics and Business
Language: English

Topic: Logic, programming, and type systems
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Keywords: resolution theorem proving, DC algorithm, exponential lower bounds, polynomial complexity, time complexity analysis

Open Access status: closed
OpenAlex ID: W1769238021
FWCI: 0.27
Cites: 9
Cited by: 13
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
Supporters
Legal
Privacy
Accessibility
Terms
Security