| Ditemukan 35 dokumen dengan kata kunci 4676 |
Simpan CSV  |
|
The complexity of handling minimal solutions in logic-based abduction
|
| Pengarang: Andreas Pfandler, Reinhard Pichler, Stefan Woltran | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 3 june 2015, p.805-825) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Recent complexity-theoretic results on P systems with active membranes
|
| Pengarang: Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 4 Agustus 2015, p. 1047- 1071) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Complexity for probability logic with quantifiers over propositions
|
| Pengarang: Stanislav O. Speranski | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 1035-1055 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Complexity of existential positive first-order logic
|
| Pengarang: Manuel Bodirsky, Miki Hermann, and Florian Richoux | No. Panggil: Journal of Logic and Computation August 2013, 23 (4), p. 753-760 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
The complexity of admissible rules of Łukasiewicz logic
|
| Pengarang: Emil Jeřábek | No. Panggil: Journal of Logic and Computation June 2013, 23 (3), p. 693-705 |
|
|
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 ::
|
|
|
Expressing versus Proving: Relating Forms of Complexity in Logic
|
| Pengarang: Antonina Kolokolova | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 267-280 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
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 ::
|
|
|
Complexity Issues in Axiomatic Extensions of Łukasiewicz Logic
|
| Pengarang: Petr Cintula and Petr Hájek | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 245-260 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Proof Complexity of the Cut-free Calculus of Structures
|
| Pengarang: Emil Jeřábek | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 323-339 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
