Programação de conjunto de resposta (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Programação de conjunto de resposta" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

6books.google.com

3^rd place

6^th place

3hut.fi

low place

2doi.org

2^nd place

4^th place

1ttu.edu

6,762^nd place

low place

1web.archive.org

1^st place

1ucla.edu

782^nd place

923^rd place

1lanl.gov

3,495^th place

3,605^th place

1bath.ac.uk

low place

1rogeliodavila.com

low place

1arxiv.org

69^th place

195^th place

1utexas.edu

916^th place

796^th place

1dlvsystem.com

low place

arxiv.org

Ferraris, P.; Lifschitz, V. (janeiro de 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. Expediente: 20352

books.google.com

Baral, Chitta (2003). Knowledge Representation, Reasoning and Declarative Problem Solving. [S.l.]: Cambridge University Press. ISBN 978-0-521-81802-5
Gelfond, Michael (2008). «Answer sets». In: van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce. Handbook of Knowledge Representation. [S.l.]: Elsevier. pp. 285–316. ISBN 978-0-08-055702-1 as PDF Arquivado em 3 de março de 2016, no Wayback Machine.
Dimopoulos, Y.; Nebel, B.; Köhler, J. (1997). «Encoding planning problems in non-monotonic logic programs». In: Steel, Sam; Alami, Rachid. Recent Advances in AI Planning: 4th European Conference on Planning, ECP'97, Toulouse, France, September 24–26, 1997, Proceedings. Col: Lecture notes in computer science: Lecture notes in artificial intelligence. 1348. [S.l.]: Springer. pp. 273–285. ISBN 978-3-540-63912-1 as Postscript
Subrahmanian, V.S.; Zaniolo, C. (1995). «Relating stable models and AI planning domains». In: Sterling, Leon. Logic Programming: Proceedings of the Twelfth International Conference on Logic Programming. [S.l.]: MIT Press. pp. 233–247. ISBN 978-0-262-69177-2 as Postscript
Marek, V.; Truszczyński, M. (1999). «Stable models and an alternative logic programming paradigm». In: Apt, Krzysztof R. The Logic programming paradigm: a 25-year perspective (PDF). [S.l.]: Springer. pp. 169–181. ISBN 978-3-540-65463-6
Niemelä, I.; Simons, P.; Soinenen, T. (2000). «Stable model semantics of weight constraint rules». In: 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. Col: Lecture notes in computer science: Lecture notes in artificial intelligence. 1730. [S.l.]: Springer. pp. 317–331. ISBN 978-3-540-66749-0 as Postscript

dlvsystem.com

«DLV System company page». DLVSYSTEM s.r.l. Consultado em 16 de novembro de 2011

doi.org

dx.doi.org

Niemelä, I. (1999). «Logic programs with stable model semantics as a constraint programming paradigm» (Postscript). Annals of Mathematics and Artificial Intelligence. 25: 241–273. doi:10.1023/A:1018930122475
Ferraris, P.; Lifschitz, V. (janeiro de 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». institution=Laboratory of Information Processing Science, Helsinki University of Technology (TKO-B142) !CS1 manut: Falta pipe (link)
Niemelä, I. (1999). «Logic programs with stable model semantics as a constraint programming paradigm» (Postscript). Annals of Mathematics and Artificial Intelligence. 25: 241–273. doi:10.1023/A:1018930122475
Niemelä, I.; Simons, P.; Soinenen, T. (2000). «Stable model semantics of weight constraint rules». In: 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. Col: Lecture notes in computer science: Lecture notes in artificial intelligence. 1730. [S.l.]: Springer. pp. 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». In: Apt, Krzysztof R. The Logic programming paradigm: a 25-year perspective (PDF). [S.l.]: Springer. pp. 169–181. ISBN 978-3-540-65463-6

rogeliodavila.com

Rogelio Davila. «AnsProlog, an overview» (PowerPoint)

ttu.edu

depts.ttu.edu

Gelfond, Michael (2008). «Answer sets». In: van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce. Handbook of Knowledge Representation. [S.l.]: Elsevier. pp. 285–316. ISBN 978-0-08-055702-1 as PDF Arquivado em 3 de março de 2016, no Wayback Machine.

ucla.edu

cs.ucla.edu

Subrahmanian, V.S.; Zaniolo, C. (1995). «Relating stable models and AI planning domains». In: Sterling, Leon. Logic Programming: Proceedings of the Twelfth International Conference on Logic Programming. [S.l.]: MIT Press. pp. 233–247. ISBN 978-0-262-69177-2 as Postscript

utexas.edu

cs.utexas.edu

Ferraris, P.; Lifschitz, V. (janeiro de 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». In: van Harmelen, Frank; Lifschitz, Vladimir; Porter, Bruce. Handbook of Knowledge Representation. [S.l.]: Elsevier. pp. 285–316. ISBN 978-0-08-055702-1 as PDF Arquivado em 3 de março de 2016, no Wayback Machine.