OpenAlex
PricingAboutJobs
Log inGet started
Work

A Deduction Method Complete for Refutation and Finite Satisfiability

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Logics in Artificial Intelligence: European Workshop, JELIA '96 Évora, Portugal September 30 – October 3, 1996 Proceedings
DOI: 10.1007/3-540-49545-2_9
Authors: François Bry, Sunna Torge
Institution: Ludwig-Maximilians-Universität München
Language: English

Topic: Logic, Reasoning, and Knowledge
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: refutation completeness, finite satisfiability, existential quantifier, Skolemization, first-order logic, database applications, artificial intelligence applications

Open Access status: closed
OpenAlex ID: W1576898581
FWCI: 1.644
Cites: 38
Cited by: 46
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