𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof complexity of propositional default logic

✍ Scribed by Olaf Beyersdorff; Arne Meier; Sebastian Müller; Michael Thomas; Heribert Vollmer

Publisher
Springer
Year
2011
Tongue
English
Weight
551 KB
Volume
50
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New proofs in default logic theory
New proofs in default logic theory
✍ G. Antoniou; E. Langetepe; V. Sperschneider 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 903 KB
Cumulative default logic: Finite charact
Cumulative default logic: Finite characterization, algorithms, and complexity
✍ Georg Gottlob; Mingyi Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 959 KB

Brewka's Cumulative Default Logic (CDL), a new version of Reiter's default logic, puts emphasis on the joint consistency among the justifications of all applied defaults to obtain cumulativity. In this paper, a finite characterization of CDL extensions using sets of generating defaults is given. Fro

Optimization complexity of linear logic
Optimization complexity of linear logic proof games
✍ Patrick D. Lincoln; John C. Mitchell; Andre Scedrov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the NP-complete multiplicative fragment (MLL) extended with additive constants and the PS