Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Basic Completion with E-cycle Simplification
Sort
relevance
views
votes
recent
update
View
thumb
title
93
Voted
AISC
1998
Springer
127
views
Artificial Intelligence
»
more
AISC 1998
»
Basic Completion with E-cycle Simplification
15 years 7 months ago
Download
csis.pace.edu
Christopher Lynch, Christelle Scharff
claim paper
Read More »
112
Voted
CADE
1998
Springer
88
views
Logical Reasoning
»
more
CADE 1998
»
Strict Basic Superposition
15 years 7 months ago
Download
www.doc.ic.ac.uk
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »