liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A trichotomy in the complexity of propositional circumscription
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
2005 (English)In: Logic for Programming, Artificial Intelligence, and Reasoning: 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005. Proceedings / [ed] Franz Baader and Andrei Voronkov, Springer Berlin/Heidelberg, 2005, Vol. 3452, 257-269 p.Chapter in book (Refereed)
Abstract [en]

Circumscription is one of the most important and well studied formalisms in the realm of nonmonotonic reasoning. The inference problem for propositional circumscription has been extensively studied from the viewpoint of computational complexity. We prove that there exists a trichotomy for the complexity of the inference problem in propositional variable circumscription. More specifically we prove that every restricted case of the problem is either &UPi,(P)(2)-complete, coNP-complete, or in P.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2005. Vol. 3452, 257-269 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 3452
Series
Lecture Notes in Computer Science,, ISSN 0302-9743 ; 3452
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-48214DOI: 10.1007/978-3-540-32275-7_18ISBN: 3-540-25236-3 (print)ISBN: 978-3-540-25236-8 (print)ISBN: e-978-3-540-32275-7 OAI: oai:DiVA.org:liu-48214DiVA: diva2:269110
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2013-10-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textfind book at a swedish library/hitta boken i ett svenskt bibliotek

Authority records BETA

Nordh, Gustav

Search in DiVA

By author/editor
Nordh, Gustav
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf