OpenAlex
PricingAboutJobs
Log inGet started
Work

Resolution for logic programming with universal quantifiers

HTML

Year: 1997
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Programming Languages: Implementations, Logics, and Programs
DOI: 10.1007/bfb0033837
Authors: Antony F. Bowers, Patricia M. Hill, Francisco Ibañez
Institutions: University of Bristol, University of Leeds, National University of San Juan
Language: English

Topic: Logic, Reasoning, and Knowledge
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: SLD-resolution, universal quantification, logic programming, Horn clauses, negation as failure, first-order logic, procedural semantics, program specification

Open Access status: closed
OpenAlex ID: W1597022474
FWCI: 0.315
Cites: 17
Cited by: 2
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