@article{hema:2004:cupcam2003-otraruta,
  author = {{{\'{A}}ngel} Herranz and Julio Mari{\~{n}}o},
  title = {Por otra ruta, por favor (CUPCAM 2003, problema E,
                  soluci{\'{o}}n)},
  journal = {Novatica},
  year = {2004},
  volume = {1},
  number = {170},
  pages = {73},
  month = jul,
  note = {Secci{\'{o}}n ``Programar es crear''},
  url = {http://www.ati.es/novatica/2004/170/170-73.pdf}
}
@article{lehe:2004:cupcam2003-refactor,
  author = {Jos{\'{e}} A. Leiva and {{\'{A}}ngel} Herranz},
  title = {Un refactorizador simple (CUPCAM 2003, problema D,
                  soluci{\'{o}}n)},
  journal = {Novatica},
  year = {2004},
  volume = {1},
  number = {169},
  pages = {74},
  month = may,
  note = {Secci{\'{o}}n ``Programar es crear''},
  url = {http://www.ati.es/novatica/2004/169/169-74.pdf}
}
@article{Guadarrama2004127,
  title = {Fuzzy Prolog: a new approach using soft constraints propagation},
  journal = {Fuzzy Sets and Systems (FSS)},
  volume = {144},
  number = {1},
  pages = {127 - 150},
  year = {2004},
  note = {Possibilistic Logic and Related Issues},
  issn = {0165-0114},
  doi = {DOI: 10.1016/j.fss.2003.10.017},
  url = {http://www.sciencedirect.com/science/article/B6V05-49YH3XJ-C/2/77e1ea993165ce225e7a954dc324a92e},
  author = {S. Guadarrama and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and C. Vaucheret},
  keywords = {Fuzzy Prolog, Modeling uncertainty, Fuzzy logic programming, Constraint programming application, Implementation of fuzzy prolog},
  key = {GS-14},
  abstract = {We present a definition of a Fuzzy Prolog Language that models -valued Fuzzy Logic, and subsumes former approaches because it uses a truth value representation based on a union of sub-intervals on [0,1] and is defined using general operators that can model different logics. This extension to Prolog is implemented by interpreting fuzzy reasoning as a set of constraints that are propagated through the rules by means of aggregation operators. Declarative and procedural semantics for Fuzzy Logic programs are given and their equivalence is proven. In addition, we present the implementation of an interpreter for this conceived language using constraint logic programming over real numbers.}
}
@inproceedings{DBLP:conf/iclp/Munoz-HernandezM04,
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and
               Juan Jos{\'e} Moreno-Navarro},
  title = {Implementation Results in Classical Constructive Negation},
  booktitle = {ICLP},
  year = {2004},
  pages = {284-298},
  ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3132{\&}spage=284},
  crossref = {DBLP:conf/iclp/2004},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/iclp/2004,
  editor = {Bart Demoen and Vladimir Lifschitz},
  opteditor = {Mireille Ducassie},
  title = {Logic Programming, 20th International Conference, ICLP 2004,
               Saint-Mal{\'o}, France, September 6-10, 2004, Proceedings},
  booktitle = {ICLP},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science (LNCS)},
  volume = {3132},
  year = {2004},
  isbn = {3-540-22671-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{SusanaFLOPS04,
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana and J. Mari{\~n}o and Moreno-Navarro, Juan Jos{\'e}},
  title = {Constructive Intensional Negation},
  optcrossref = {},
  optkey = {},
  booktitle = {Proceedings of the 7th International Symposiun in Functional and Logic Programming, FLOPS'04},
  pages = {39-54},
  year = {2004},
  opteditor = {Y. Kameyama and P.J. Stuckey},
  optvolume = {},
  number = {2998},
  series = {LNCS},
  address = {Nara, Japan},
  optmonth = {April},
  optorganization = {},
  optpublisher = {},
  optnote = {},
  optannote = {}
}
@inproceedings{carro:marinno:herranz:moreno:2004:tfm,
  author = {Manuel Carro and Julio Mari{\~{n}}o and \'{A}ngel Herranz and Juan
                  Jos{\'{e}} {Moreno-Navarro}},
  title = {Teaching How to Derive Correct Concurrent Programs (from
                  State-based Specifications and Code Patterns)},
  booktitle = {Teaching Formal Methods, CoLogNET/FME Symposium, TFM 2004,
                  Ghent, Belgium},
  pages = {85--106},
  year = 2004,
  editor = {C.N. Dean and R.T. Boute},
  volume = 3294,
  series = {LNCS},
  publisher = {Springer},
  note = {ISBN 3-540-23611-2}
}
@inproceedings{2004flops,
  author = {Julio Mari{\~{n}}o and Juan Jos{\'{e}} {Moreno-Navarro} and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Constructive Intensional Negation},
  booktitle = {Functional and Logic Programming Symposium},
  pages = {39--54},
  year = 2004,
  editor = {Stuckey and Kameyama},
  number = 2998,
  series = {LNCS},
  address = {Nara, Japan},
  month = apr,
  publisher = {Springer}
}
@article{herranz:marinno:2004:novatica,
  author = {\'{A}ngel Herranz and Julio Mari{\~{n}}o},
  title = {Por otra ruta, por favor},
  journal = {Nov{\'{a}}tica},
  year = 2004,
  month = aug,
  volume = {1},
  number = 170,
  pages = {73--75},
  note = {Contribuci{\'{o}}n a la columna "Programar es Crear"}
}
@unpublished{camahemo:2004:fulltcp,
  author = {Manuel Carro and Julio Mari{\~{n}}o and {{\'{A}}ngel} Herranz and Juan
                  Jos{\'{e}} {Moreno-Navarro}},
  title = {Teaching How to Derive Correct Concurrent Programs from
                  State-Based Specifications},
  note = {Full paper},
  year = {2004},
  abstract = { The fun of teaching and learning concurrent programming is
                  sometimes darkened by the difficulty in getting concurrent
                  programs to work right.  In line with other programming
                  subjects in our department, we advocate the use of formal
                  specifications to state clearly how a concurrent program
                  must behave, to reason about this behavior, and to be able
                  to produce code from specifications in a semi-automatic
                  fashion.  We argue that a mild form of specification not
                  only makes it possible to get programs running easier, but
                  it also introduces students to a quite systematic way of
                  approaching programming: reading and understanding
                  specifications is seen as an unavoidable step in the
                  programming process, as they are really the only place where
                  the expected conduct of the system is completely described.
                  By using formal techniques in these cases, where it is
                  undoubtedly appropriate, we introduce formality without the
                  need to resort to justifications with artificial or overly
                  complicated examples.  },
  optkey = {},
  month = sep,
  optannote = {},
  postscript = {http://babel.ls.fi.upm.es/~angel/papers/tfm2004-full.ps.gz}
}

This file was generated by bibtex2html 1.98.