Ditemukan 30 dokumen dengan kata kunci 4602 |
Simpan CSV  |
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 ::
|
|
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 ::
|
|
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 ::
|
|
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 ::
|
|
Labelled calculi of resources
|
Pengarang: Maribel Fernández and Nikolaos Siafakas | No. Panggil: Journal of Logic and Computation June 2014; 24 (3), p. 591-613 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Logic for coalitions with bounded resources
|
Pengarang: Natasha Alechina, Brian Logan, Hoang Nga Nguyen, and Abdur Rakib | No. Panggil: Journal of Logic and Computation December 2011, 21 (6), p. 907-937 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
The Effects of Bounding Syntactic Resources on Presburger LTL
|
Pengarang: Stéphane Demri and Régis Gascon | No. Panggil: Journal of Logic and Computation December 2009, 19 (6), p. 1541-1575 |
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|