Hasil Pencarian
Ditemukan 125 dokumen dengan kata kunci 4378 Simpan CSV Simpan CSV
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  ::
A Complete Deductive System for Probability Logic
Pengarang: Chunlai Zhou | No. Panggil: Journal of Logic and Computation December 2009, 19 (6), p. 1427-1454 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Modal Operators over Constructive Logic
Pengarang: Evgeny Yu. Sherkhonov | No. Panggil: Journal of Logic and Computation December 2008, 18 (6), p. 815-829 |
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  ::
Quantifiers in logic and proof-search using permissive-nominal terms and sets
Pengarang: Murdoch J. Gabbay, Claus-Peter Wirth | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 2 April 2015, p. (473-523) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
Pengarang: Franco Montagna and Carles Noguera | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 399-424 |
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  ::
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  ::
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  ::
Prev   1 2 3 4 5 6 7 8 9 10  Next