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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
89
click to vote
CTRS
1990
68
views
Theoretical Computer Science
»
more
CTRS 1990
»
A Maximal-Literal Unit Strategy for Horn Clauses
15 years 7 months ago
Download
www.cs.tau.ac.il
A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paxamodulation to potentiallymaximal sides of equations. Completeness is shown using proof orderings.
Nachum Dershowitz
Real-time Traffic
CTRS 1990
|
CTRS 1992
|
Equational Horn Clauses
|
Positive-unit Theorem-proving Procedure
|
Potentiallymaximal Sides
|
claim paper
Post Info
More Details (n/a)
Added
11 Aug 2010
Updated
11 Aug 2010
Type
Conference
Year
1990
Where
CTRS
Authors
Nachum Dershowitz
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision