Ditemukan 117 dokumen dengan kata kunci 4503 |
Simpan CSV  |
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 ::
|
|
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction
|
Pengarang: Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p. 643-660 |
|
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 ::
|
|
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 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 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 ::
|
|
Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations
|
Pengarang: Paul E. Oppenheimer and Edward N. Zalta | No. Panggil: Journal of Logic and Computation April 2011, 21 (3), p. 351-374 |
|
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 ::
|
|