Програмування наборами відповідей (Ukrainian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Програмування наборами відповідей" in Ukrainian language version.

refsWebsite

Global rank Ukrainian rank

6books.google.com

3^rd place

11^th place

2web.archive.org

1^st place

2hut.fi

low place

2doi.org

2^nd place

4^th place

1ttu.edu

6,762^nd place

4,284^th place

1ucla.edu

782^nd place

1,942^nd place

1lanl.gov

3,495^th place

low place

1aalto.fi

low place

1bath.ac.uk

low place

4,135^th place

1arxiv.org

69^th place

188^th place

1utexas.edu

916^th place

1,136^th place

1archive.today

14^th place

18^th 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 квітня 2015. Процитовано 18 грудня 2016.

arxiv.org

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

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 березня 2016. Процитовано 21 грудня 2016.

books.google.com

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. Elsevier. с. 285—316. ISBN 978-0-08-055702-1. as PDF [Архівовано 3 березня 2016 у Wayback Machine.]
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 листопада 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. (January 2005). Weight constraints as nested expressions (PDF). Theory and Practice of Logic Programming. 5 (1-2): 45—74. doi:10.1017/S1471068403001923. as Postscript

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 квітня 2015. Процитовано 18 грудня 2016.

ttu.edu

depts.ttu.edu

Gelfond, Michael (2008). Answer sets. У van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce (ред.). Handbook of Knowledge Representation. Elsevier. с. 285—316. ISBN 978-0-08-055702-1. as PDF [Архівовано 3 березня 2016 у Wayback Machine.]

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

utexas.edu

cs.utexas.edu

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

web.archive.org

Gelfond, Michael (2008). Answer sets. У van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce (ред.). Handbook of Knowledge Representation. Elsevier. с. 285—316. ISBN 978-0-08-055702-1. as PDF [Архівовано 3 березня 2016 у Wayback Machine.]
Crick, Tom (2009). Superoptimisation: Provably Optimal Code Generation using Answer Set Programming (PDF) (Ph.D.). University of Bath. Docket 20352. Архів оригіналу (PDF) за 4 березня 2016. Процитовано 21 грудня 2016.