Ditemukan 56 dokumen dengan kata kunci 4600 |
Simpan CSV  |
The Complexity of the Warranted Formula Problem in Propositional Argumentation
|
Pengarang: Robin Hirsch and Nikos Gorogiannis | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 481-499 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication
|
Pengarang: Grigoriy V. Bokov | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 2 April 2015, p. 341-353) |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Complexity Classifications for Propositional Abduction in Post's Framework
|
Pengarang: Nadia Creignou, Johannes Schmidt, and Michael Thomas | No. Panggil: Journal of Logic and Computation October 2012, 22 (5), p. 1145-1170 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Pseudojumps and Formula Classes
|
Pengarang: Douglas Cenzer, Geoffrey Laforte, and Guohua Wu | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 77-87 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Metalevel argumentation
|
Pengarang: Sanjay Modgil and Trevor J. M. Bench-Capon | No. Panggil: Journal of Logic and Computation December 2011, 21 (6), p. 959-1003 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Categorical Equivalences for Formula quasi-MV Algebras
|
Pengarang: Roberto Giuntini, Francesco Paoli, and Antonio Ledda | No. Panggil: Journal of Logic and Computation July 2010, 20 (4), p. 795-810 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
The cf2 argumentation semantics revisited
|
Pengarang: Sarah Alice Gaggl and Stefan Woltran | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 925-949 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
On the semantics of abstract argumentation
|
Pengarang: A.C. Kakas and P. Mancarella | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 991-1015 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Tractable and intractable classes of propositional schemata
|
Pengarang: Nicolas Peltier | No. Panggil: Journal of Logic and Computation (October 2014; 24 (5), p. 1111-1139) |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
On Computational Complexity of Semilinear Varieties
|
Pengarang: Enrico Marchioni | No. Panggil: Journal of Logic and Computation December 2008, 18 (6), p. 941-958 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|