✦ LIBER ✦

On the complexity of extension checking in default logic

✍ Scribed by Paolo Liberatore

Book ID: 108153447
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 71 KB
Volume: 98
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.12.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of predicate default logi

The complexity of predicate default logic over a countable domain

✍ Robert Saxon Milnikel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Operational characterization of extensio

Operational characterization of extensions in some logics for default reasoning

✍ Grigoris Antoniou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Complexity of tests checking the operati

Complexity of tests checking the operation of logic diagram inputs

✍ V. N. Noskov 📂 Article 📅 1975 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 566 KB

A directly cautious theory of defeasible

A directly cautious theory of defeasible consequence for default logic via the notion of general extension

✍ G.Aldo Antonelli 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 306 KB

On the computational complexity of assum

On the computational complexity of assumption-based argumentation for default reasoning

✍ Yannis Dimopoulos; Bernhard Nebel; Francesca Toni 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Bondarenko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, the framework extends these formalisms by generalising the semantics of admissible and preferred arguments, origina

On the Beth Property in Extension of Luk

On the Beth Property in Extension of Lukasiewicz Logics

✍ D.E. Tishkovsky 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 142 KB