from an interface design created by the user is a func-
tionality offered by some solutions. Nevertheless, as
far as we know none of them manages FDs nor do
they generate UML models. In this way, the user can
generate better quality applications and we overcome
some of the limitations of other automated application
generators. This differentiates CBD from the other
tools available, as by using the forms designed by the
user, systems analysts can obtain requirements in the
initial development phases of an information system.
Therefore, CBD is extremely useful as a tool for gath-
ering requirements as it allows extracting knowledge
and exporting it for analysis and design processes.
The second contribution of this work is the use
of SL
FD
logic to eliminate redundancy in the XML
database, which works as a data dictionary of CBD.
This efficient use is possible using an inference sys-
tem, which provides not only soundness, but also al-
lows us to explain the reasoning which has been fol-
lowed in the execution of the application. Our goal
when designing the SL
FD
logic was to clear the way
for future construction of an automatic technique that
systematizes the use of rules of the axiomatic sys-
tem. In our opinion, it is not enough to know simply
whether a FD is redundant or not, we also need to be
able to report on which FDs allow that deduction and
the SL
FD
rules used, something that is not possible if
we use the indirect methods that are commonplace in
the literature.
As regards future work, we have begun work in
two areas:
• We are working to produce a second version of
CBD that will generate web applications from its
model. This application can be deployed in the
user servers, or hosted in CBD servers in a com-
bination of PaaS (Platform as a Service) and SaaS
(Software as a Service) models.
• We wish to incorporate the debugging algorithms
of the SL
FD
logic into the CBD. The objective of
this integration is not only to make the tool easier
to use, but to be able to use the information the
algorithms provide on the reasoning to help the
analyst explain the overlaps in the different views
of the model.
REFERENCES
Armstrong, W. W. (1974). Dependency structures of data
base relationships. In IFIP Congress, pages 580–583.
Carrillo, A. L., Falgueras, J., Dianes, J. A., and Guevara, A.
(2008). A guided interface for web interaction. In Pro-
ceedings of ICEIS 2008 - 10TH International Confer-
ence On Enterprise Information Systems., pages 70–
77.
Codd, E. F. (1970). A relational model of data for large
shared data banks. Commun. ACM, 13(6):377–387.
Cordero, P., Enciso, M., Guzm
´
an, I. P., and Mora, A.
(2002). Slfd logic: Elimination of data redundancy in
knowledge representation. Lecture Notes in Artificial
Intelligence, 2527:141–150.
Evaluation, B. (1000). This is a paper written by one of
the authors of this paper. In We have remove this data
following the submission guidelines for authors. Pub-
lished.
Fagin, R. (1977). Functional dependencies in a relational
database and propositional logic. IBM. Journal of re-
search and development, 21 (6):534–544.
FormLogix.com (2010). http://www.formlogix.com.
FormSpring LLC (2010). www.formspring.com.
Groupe W4 S.A (2010). http://www.lyria.com.
Guevara, A., Caro, J. L., Leiva, J. L., and Gmez, J. L.
(2007). I. comis: Cooperative methodology for in-
formation systems. In Proceedings of ENC’2007 Ad-
vances in Computer Science, pages 81–87.
Infinity Box Inc. (2010). http://wufoo.com/.
Interlogy LLC (2010). http://www.jotform.com/.
Jacobson, I., Booch, G., and J., R. (2000). El proceso unifi-
cado de desarrollo de software. Addison Wesley.
Martin, R. (2003). Agile software development : principles,
patterns, and practices. Prentice Hall.
Mora, A., Aguilera, G., Enciso, M., Cordero, P., and
Guzm
´
an, I. P. (2006). A new closure algorithm based
in logic: Slfd-closure versus classical closures. In-
teligencia Artificial. Revista Iberoamericana de IA,
31:31–40.
Mora, A., Enciso, M., Cordero, P., and Guzm
´
an, I. P.
(2004). The functional dependence implication prob-
lem: optimality and minimality. An efficient pre-
processing transformation based on the substitution
paradigm. Lect. Notes in Artificial Intelligence,
3040:136–146.
Nelson, H. J., Poels, G., Genero, M., and Piattini, M.
(2005). Quality in conceptual modeling: five ex-
amples of the state of the art. Data Knowl. Eng.,
55(3):237–242.
Paredaens, J. (1982). A universal formalism to express de-
compositions, functional dependencies and other con-
straints in a relational database. Theoretical Computer
Science, 19 (2):143–160.
Pressman, R. (2006). Ingenieria del Software. McGraw
Hill.
Veer West LLC (2010). www.formassembly.com.
ICSOFT 2010 - 5th International Conference on Software and Data Technologies
200