J. Albors (2014):
Procedimiento de refutación para un conjunto de restricciones sobre documentos XML.
Facultad de Informática, San Sebastián.
Available at http://www.sc.ehu.es/jiwnagom/PaginaWebLorea/Javier_Albors_PFC.pdf.
Michael Benedikt, Wenfei Fan & Floris Geerts (2008):
XPath Satisfiability in the Presence of DTDs.
J. ACM 55(2),
pp. 8:1–8:79,
doi:10.1145/1346330.1346333.
Michael Benedikt & Christoph Koch (2009):
XPath Leashed.
ACM Comput. Surv. 41(1),
pp. 3:1–3:54,
doi:10.1145/1456650.1456653.
William F. Clocksin & Christopher S. Mellish (1994):
Programming in Prolog (4. ed.).
Springer,
doi:10.1007/978-3-642-97596-7.
Gerome Miklau & Dan Suciu (2004):
Containment and Equivalence for a Fragment of XPath.
J. ACM 51(1),
pp. 2–45,
doi:10.1145/962446.962448.
Marisa Navarro & Fernando Orejas (2010):
Proving Satisfiability of Constraint Specifications on XML Documents.
In: X Jornadas sobre Programación y Lenguajes (PROLE2010).
Available at http://www.sc.ehu.es/jiwnagom/PaginaWebLorea/cedi.pdf.
Fernando Orejas, Hartmut Ehrig & Ulrike Prange (2008):
A Logic of Graph Constraints.
In: José Luiz Fiadeiro & Paola Inverardi: Fundamental Approaches to Software Engineering, 11th International Conference, FASE 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings,
Lecture Notes in Computer Science 4961.
Springer,
pp. 179–198,
doi:10.1007/978-3-540-78743-3_14.
WORLD WIDE WEB CONSORTIUM (2007):
XML path language (XPath) 2.0..
eptcs@eptcs.org