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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
17
click to vote
CADE
2005
Springer
favorite
Email
discuss
report
100
views
Logical Reasoning
»
more
CADE 2005
»
On the Complexity of Equational Horn Clauses
14 years 8 months ago
Download
www2.cs.tum.edu
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentic
Real-time Traffic
Automated Reasoning
|
CADE 2005
|
Equational Horn Clauses
|
claim paper
Related Content
»
A MaximalLiteral Unit Strategy for Horn Clauses
»
Horn clauses and functional dependencies in complexvalue databases
»
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
»
Flat and onevariable clauses Complexity of verifying cryptographic protocols with single b...
»
A Semiautomatic Method to Ontology Design by Using FCA
»
Tree Automata with Equality Constraints Modulo Equational Theories
»
On the Complexity of Fragments of Modal Logics
»
ControlFlow Analysis in Cubic Time
»
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2005
Where
CADE
Authors
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
Comments
(0)
Researcher Info
Logical Reasoning Study Group
Computer Vision