Procedimiento de refutación para un conjunto de restricciones sobre documentos XML
View/ Open
Date
2014-10-15Author
Albors Iruretagoyena, Javier
Metadata
Show full item recordAbstract
We present a prototype that implements a set of logical rules to prove the
satis ability for a class of speci cations on XML documents. Speci cations
are given by means of constraints built on Boolean XPath patterns. The
main goal of this tool is to test if a given speci cation is satis able or not,
showing the history of the execution. It can also be used to test if a given
document is a model of a given speci cation and, as a subproduct, it allows
to look for all the relations (monomorphisms) between two patterns or the
result of doing some operations by combining patterns in di erent ways. The
results of these operations are visually shown and therefore the tool makes
these operations more understandable. The implementation of the algorithm
has been written in Prolog but the prototype has a Java interface for an easy
and friendly use.