Одговор сет програмирање (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Одговор сет програмирање" in Serbian language version.

refsWebsite

Global rank Serbian rank

6books.google.com

3^rd place

2^nd place

3web.archive.org

1^st place

2hut.fi

low place

2doi.org

2^nd place

4^th place

1ttu.edu

6,762^nd place

low place

1ucla.edu

782^nd place

873^rd place

1lanl.gov

3,495^th place

2,924^th place

1aalto.fi

low place

1bath.ac.uk

low place

1rogeliodavila.com

low place

1arxiv.org

69^th place

240^th place

1archive.today

14^th place

22^nd place

1loqtek.com

low place

1dlvsystem.com

low place

aalto.fi

users.ics.aalto.fi

Niemelä, I. (1999). „Logic programs with stable model semantics as a constraint programming paradigm” (Postscript,gzipped). Annals of Mathematics and Artificial Intelligence. 25: 241—273. doi:10.1023/A:1018930122475.

archive.today

„Dependency parsing”. Архивирано из оригинала 15. 4. 2015. г. Приступљено 28. 11. 2015.

arxiv.org

Ferraris, P.; Lifschitz, V. (2005). „Weight constraints as nested expressions” (PDF). Theory and Practice of Logic Programming. 5 (1-2): 45—74. doi:10.1017/S1471068403001923.

bath.ac.uk

opus.bath.ac.uk

Crick, Tom (2009). Superoptimisation: Provably Optimal Code Generation using Answer Set Programming (PDF) (Ph.D.). University of Bath. Docket 20352. Архивирано из оригинала (PDF) 4. 3. 2016. г. Приступљено 28. 11. 2015.

books.google.com

Baral 2003. Baral, Chitta (2003). Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press. ISBN 978-0-521-81802-5.
Gelfond, Michael (2008). „Answer sets”. Ур.: van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce. Handbook of Knowledge Representation (PDF). Elsevier. стр. 285—316. ISBN 978-0-08-055702-1. Архивирано из оригинала 03. 03. 2016. г. as PDF
Dimopoulos, Y.; Nebel, B.; Köhler, J. (1997). „Encoding planning problems in non-monotonic logic programs”. Ур.: Steel, Sam; Alami, Rachid. Recent Advances in AI Planning: 4th European Conference on Planning, ECP'97, Toulouse, France, September 24–26, 1997, Proceedings. Lecture notes in computer science: Lecture notes in artificial intelligence. 1348. Springer. стр. 273—285. ISBN 978-3-540-63912-1. as Postscript
Subrahmanian, V.S.; Zaniolo, C. (1995). „Relating stable models and AI planning domains”. Ур.: Sterling, Leon. Logic Programming: Proceedings of the Twelfth International Conference on Logic Programming. MIT Press. стр. 233—247. ISBN 978-0-262-69177-2. as Postscript
Marek, V.; Truszczyński, M. (1999). „Stable models and an alternative logic programming paradigm”. Ур.: Apt, Krzysztof R. The Logic programming paradigm: a 25-year perspective (PDF). Springer. стр. 169—181. ISBN 978-3-540-65463-6.
Niemelä, I.; Simons, P.; Soinenen, T. (2000). „Stable model semantics of weight constraint rules”. Ур.: Gelfond, Michael; Leone, Nicole; Pfeifer, Gerald. Logic Programming and Nonmonotonic Reasoning: 5th International Conference, LPNMR '99, El Paso, Texas, USA, December 2–4, 1999 Proceedings. Lecture notes in computer science: Lecture notes in artificial intelligence. 1730. Springer. стр. 317—331. ISBN 978-3-540-66749-0. as Postscript

dlvsystem.com

„DLV System company page”. DLVSYSTEM s.r.l. Приступљено 16. 11. 2011.

doi.org

Niemelä, I. (1999). „Logic programs with stable model semantics as a constraint programming paradigm” (Postscript,gzipped). Annals of Mathematics and Artificial Intelligence. 25: 241—273. doi:10.1023/A:1018930122475.
Ferraris, P.; Lifschitz, V. (2005). „Weight constraints as nested expressions” (PDF). Theory and Practice of Logic Programming. 5 (1-2): 45—74. doi:10.1017/S1471068403001923.

hut.fi

tcs.hut.fi

Soininen, T.; Niemelä, I. (1998), Formalizing configuration knowledge using rules with choices (Postscript) (TKO-B142), Laboratory of Information Processing Science, Helsinki University of Technology
Niemelä, I.; Simons, P.; Soinenen, T. (2000). „Stable model semantics of weight constraint rules”. Ур.: Gelfond, Michael; Leone, Nicole; Pfeifer, Gerald. Logic Programming and Nonmonotonic Reasoning: 5th International Conference, LPNMR '99, El Paso, Texas, USA, December 2–4, 1999 Proceedings. Lecture notes in computer science: Lecture notes in artificial intelligence. 1730. Springer. стр. 317—331. ISBN 978-3-540-66749-0. as Postscript

lanl.gov

xxx.lanl.gov

Marek, V.; Truszczyński, M. (1999). „Stable models and an alternative logic programming paradigm”. Ур.: Apt, Krzysztof R. The Logic programming paradigm: a 25-year perspective (PDF). Springer. стр. 169—181. ISBN 978-3-540-65463-6.

loqtek.com

„Dependency parsing”. Архивирано из оригинала 15. 4. 2015. г. Приступљено 28. 11. 2015.

rogeliodavila.com

Davila, Rogelio. „AnsProlog, an overview”. Архивирано из оригинала (PowerPoint) 08. 12. 2015. г. Приступљено 28. 11. 2015.

ttu.edu

depts.ttu.edu

Gelfond, Michael (2008). „Answer sets”. Ур.: van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce. Handbook of Knowledge Representation (PDF). Elsevier. стр. 285—316. ISBN 978-0-08-055702-1. Архивирано из оригинала 03. 03. 2016. г. as PDF

ucla.edu

cs.ucla.edu

Subrahmanian, V.S.; Zaniolo, C. (1995). „Relating stable models and AI planning domains”. Ур.: Sterling, Leon. Logic Programming: Proceedings of the Twelfth International Conference on Logic Programming. MIT Press. стр. 233—247. ISBN 978-0-262-69177-2. as Postscript

web.archive.org

Gelfond, Michael (2008). „Answer sets”. Ур.: van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce. Handbook of Knowledge Representation (PDF). Elsevier. стр. 285—316. ISBN 978-0-08-055702-1. Архивирано из оригинала 03. 03. 2016. г. as PDF
Crick, Tom (2009). Superoptimisation: Provably Optimal Code Generation using Answer Set Programming (PDF) (Ph.D.). University of Bath. Docket 20352. Архивирано из оригинала (PDF) 4. 3. 2016. г. Приступљено 28. 11. 2015.
Davila, Rogelio. „AnsProlog, an overview”. Архивирано из оригинала (PowerPoint) 08. 12. 2015. г. Приступљено 28. 11. 2015.