Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
On the computational complexity of quantified Horn clauses

On the computational complexity of quantified Horn clauses

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 329/1988
BookCSL '87
DOI10.1007/3-540-50241-6
Copyright1988
ISBN978-3-540-50241-8
DOI10.1007/3-540-50241-6_34
Pages129-137
Subject CollectionComputer Science
SpringerLink DateFriday, January 20, 2006
Add to marked items

On the computational complexity of quantified Horn clauses

Marek Karpinski1, Hans Kleine Büning2 and Peter H. Schmitt3

(1)  Department of Computer Science, University of Bonn, Germany
(2)  Institut für angewandte Informatik und formale Beschreibungsverfahren, University of Karlsruhe, Germany
(3)  Scientific Center of IBM Germany, Heidelberg
Abstract
A polynomial time algorithm is presented for the evaluation problem for quantified propositional Horn clauses. This answers an open problem posed by Itai and Makowski in (IM 87).
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.112 • Server: mpweb19
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)