Proof Compexity of Propositional Default Logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10057528" target="_blank" >RIV/00216208:11320/10:10057528 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Proof Compexity of Propositional Default Logic
Original language description
We study the proof complexity of Bonattiś and Olivettiś formalization of propositional default logic. we show that, depending on the kind of reasoning (credulous and skeptical), proofs in their system are as long as classical propositional logic ( thus the formalization cannot be improved) or of exponential size, respectively.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
THEORY AND APPLICATIONS OF MODELS OF SATISFIABILITY TESTING-SAT 2010
ISBN
978-3-642-14185-0
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
—
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Brno, ČR
Event date
Aug 23, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000281446500005