Hasil Pencarian
Ditemukan 31 dokumen dengan kata kunci 4692 Simpan CSV Simpan CSV
Model-theoretic and Computational Properties of Modal Dependence Logic
Pengarang: Merlijn Sevenster | No. Panggil: Journal of Logic and Computation December 2009, 19 (6), p. 1157-1173 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
The complexity of reasoning for fragments of default logic
Pengarang: Olaf Beyersdorff, Arne Meier, Michael Thomas, and Heribert Vollmer | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p. 587-604 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Triviality and Minimality in the Degrees of Monotone Complexity
Pengarang: William C. Calhoun | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 197-206 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Narrative similarity as common summary: Evaluation of behavioral and computational aspects
Pengarang: Elektra Kypridemou and Loizos Michael | No. Panggil: Literary and Linguistic Computing (Volume 29 Issue 4 Desember 2014, p. 532-560) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
On structural completeness versus almost structural completeness problem: A discriminator varieties case study
Pengarang: Miguel Campercholi, Michał M. Stronkowski, and Diego Vaggione | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 2 April 2015, p. 235-246) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
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  ::
Prev   1 2 3 4  Next