✦ LIBER ✦

Dialectic proof procedures for assumption-based, admissible argumentation

✍ Scribed by P.M. Dung; R.A. Kowalski; F. Toni

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 267 KB
Volume: 170
Category: Article
ISSN: 0004-3702
DOI: 10.1016/j.artint.2005.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Admissibility of a test procedure based

Admissibility of a test procedure based on preliminary test of significance for life data

✍ S.K. Singh; S.K. Upadhyay; Umesh Singh 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Graph-based proof procedures for Horn cl

Graph-based proof procedures for Horn clauses : S. Raatz, Birkhäuser, Boston, 1990. 147 pp., Sfr.52, ISBN 0-8176-3530-0 (Boston), 3-7643-3530-0 (Basel)

📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 243 KB

This collection of 39 original research articies highlights current research on mathematical modelling and numerical methods for free boundary problems of parabolic and hyperbolic type. Contributions to the control and inverse problems related to free boundaries are also presented. ?Jany numerical t

Graph-based proof procedures for horn cl

Graph-based proof procedures for horn clauses : Stan Raatz, (Birkhäuser, Basel, Switzerland, 1990), Price SFr. 52.00/DM 62.00, ISBN 3-7643-3530-0, 0-8176-3530-0 (paperback).

✍ Åke Hansson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 331 KB