| Ditemukan 44 dokumen dengan kata kunci 4357 |
Simpan CSV  |
|
Reasoning about delegation and revocation schemes in answer set programming
|
| Pengarang: Steve Barker, Guido Boella, Dov Gabbay, and Valerio Genovese | No. Panggil: Journal of Logic and Computation February 2014; 24 (1), p.89-116 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Answer Set Programming with Resources
|
| Pengarang: Stefania Costantini and Andrea Formisano | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 533-571 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Monotonic Answer Set Programming
|
| Pengarang: Martin Gebser, Mona Gharib, Robert Mercer, and Torsten Schaub | No. Panggil: Journal of Logic and Computation August 2009, 19 (4), p. 539-564 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
From (Quantified) Boolean Formulae to Answer Set Programming
|
| Pengarang: Igor Stéphan, Benoit Da Mota, and Pascal Nicolas | No. Panggil: Journal of Logic and Computation August 2009, 19 (4), p. 565-590 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Efficiently Querying RDF(S) Ontologies with Answer Set Programming
|
| Pengarang: Giovambattista Ianni, Alessandra Martello, Claudio Panetta, and Giorgio Terracina | No. Panggil: Journal of Logic and Computation August 2009, 19 (4), p. 671-695 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
The Significance of Memory Costs in Answer Set Solver Implementation
|
| Pengarang: Martin Brain and Marina De Vos | No. Panggil: Journal of Logic and Computation August 2009, 19 (4), p. 615-641 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
A formalization of argumentation schemes for legal case-based reasoning in ASPIC+
|
| Pengarang: Henry Prakken,Adam Wyner,Trevor Bench-Capon,Katie Atkinson | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 5 Oktober 2015, p. 1141-1166) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Approximate reasoning about logic circuits with single-fan-out unreliable gates
|
| Pengarang: A. Sernadas, J. Rasga, C. Sernadas, and P. Mateus | No. Panggil: Journal of Logic and Computation (October 2014; 24 (5), p. 1023-1069) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Opening the black box of trust: reasoning about trust models in a BDI agent
|
| Pengarang: Andrew Koster, Marco Schorlemmer, and Jordi Sabater-Mir | No. Panggil: Journal of Logic and Computation February 2013, 23 (1), p. 25-58 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
|
| Pengarang: Giuliano Grossi, Massimo Marchi, Enrico Pontelli, and Alessandro Provetti | No. Panggil: Journal of Logic and Computation August 2009, 19 (4), p. 697-715 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
