<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE rdf:RDF [
 <!ENTITY rdf 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'>
 <!ENTITY rdfs 'http://www.w3.org/2000/01/rdf-schema#'>
 <!ENTITY owl 'http://www.w3.org/2002/07/owl#'>
 <!ENTITY swrc 'http://swrc.ontoware.org/ontology#'>
 <!ENTITY xsd 'http://www.w3.org/2001/XMLSchema#'>
]>



<rdf:RDF
xml:base="http://www.bibsonomy.org/author/Orejas"
 xmlns:rdf="&rdf;"
 xmlns:rdfs="&rdfs;"
 xmlns:owl="&owl;"
 xmlns:swrc="&swrc;"
 xmlns:xsd="&xsd;"
 >

 

<owl:Ontology rdf:about="">
  <rdfs:comment>BibSonomy publications for/author/Orejas</rdfs:comment>
  <owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/>
</owl:Ontology>
  <rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/268f2c8a011b8f4d79f524904d53016d7/pdeleenh">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:booktitle>Proc. Int&#039;l Workshop on Graph and Model Transformation (GraMoT)</swrc:booktitle><swrc:title>Efficient detection of conflicts in graph-based model transformation</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:date>2008-07-07 16:45:32.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="timestamp" swrc:value="2008.05.15"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="owner" swrc:value="pdeleenh"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Leen Lambers" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hartmut Ehrig" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Fernando Orejas" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f50b0e6d1439a98157b3ee6d8c3950a0/dblp">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:journal>Electr. Notes Theor. Comput. Sci.</swrc:journal><swrc:pages>17-26</swrc:pages><swrc:title>Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs.</swrc:title><swrc:volume>211</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-06-11 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1016/j.entcs.2008.04.026"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-06-11"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Leen Lambers" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hartmut Ehrig" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Fernando Orejas" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b96a8212fd455b1c8f852db3ec9cbb28/dblp">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:journal>Electr. Notes Theor. Comput. Sci.</swrc:journal><swrc:pages>111-131</swrc:pages><swrc:title>Architectural Connectors for Sequence Diagrams.</swrc:title><swrc:volume>206</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-06-11 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1016/j.entcs.2008.03.078"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-06-11"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Fernando Orejas" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Sonia Pérez" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/200da19e5bcb99c241fe0e405d375f386/dblp">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:journal>Applied Categorical Structures</swrc:journal><swrc:number>3</swrc:number><swrc:pages>421-450</swrc:pages><swrc:title>A Functorial Framework for Constraint Normal Logic Programming.</swrc:title><swrc:volume>16</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-05-26 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/s10485-008-9128-5"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-05-26"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Paqui Lucio" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Fernando Orejas" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Edelmira Pasarella" /></rdf:_3>
  <rdf:_4><swrc:Person swrc:name="Elvira Pino" /></rdf:_4>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2556d1cd011087a179e2805ae5ecad7d7/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>FASE</swrc:booktitle><swrc:crossref>conf/fase/2008</swrc:crossref><swrc:pages>179-198</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>A Logic of Graph Constraints.</swrc:title><swrc:volume>4961</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2008-04-21 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-78743-3_14"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-78742-6"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2008-04-21"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Fernando Orejas" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hartmut Ehrig" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Ulrike Prange" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="José Luiz Fiadeiro" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Paola Inverardi" /></rdf:_2>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f5414dd1d688a001b13baefbd690c610/kimmens">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:booktitle>Proc. Int&#039;l Workshop on Graph and Model Transformation (GraMoT)</swrc:booktitle><swrc:journal>Electronic Notes in Theoretical Computer Science</swrc:journal><swrc:publisher><swrc:Organization swrc:name="Elsevier"/></swrc:publisher><swrc:title>Efficient detection of conflicts in graph-based model transformation</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:date>2007-09-26 12:09:12.0</swrc:date><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Leen Lambers" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hartmut Ehrig" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Fernando Orejas" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f5414dd1d688a001b13baefbd690c610/evol">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:booktitle>Proc. Int&#039;l Workshop on Graph and Model Transformation (GraMoT)</swrc:booktitle><swrc:journal>Electronic Notes in Theoretical Computer Science</swrc:journal><swrc:publisher><swrc:Organization swrc:name="Elsevier Science"/></swrc:publisher><swrc:title>Efficient detection of conflicts in graph-based model transformation</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:date>2007-09-26 10:37:27.0</swrc:date><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Leen Lambers" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hartmut Ehrig" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Fernando Orejas" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f5414dd1d688a001b13baefbd690c610/tommens">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:booktitle>Proc. Int&#039;l Workshop on Graph and Model Transformation (GraMoT)</swrc:booktitle><swrc:journal>Electronic Notes in Theoretical Computer Science</swrc:journal><swrc:publisher><swrc:Organization swrc:name="Elsevier Science"/></swrc:publisher><swrc:title>Efficient detection of conflicts in graph-based model transformation</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>imported </swrc:keywords><swrc:date>2007-09-25 21:44:52.0</swrc:date><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Leen Lambers" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Hartmut Ehrig" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Fernando Orejas" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25416753510ae2f6976ddd607bc5f6b7a/dblp">
    <rdf:type rdf:resource="&swrc;Article"/>
    <swrc:journal>Electr. Notes Theor. Comput. Sci.</swrc:journal><swrc:pages>1-2</swrc:pages><swrc:title>Preface.</swrc:title><swrc:volume>188</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2007-09-21 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1016/j.entcs.2006.05.048"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2007-09-21"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Paqui Lucio" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Fernando Orejas" /></rdf:_2>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  </rdf:Seq>
</swrc:editor></rdf:Description>
<rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2cd05bddd304a8c3fc752034d2861188a/dblp">
    <rdf:type rdf:resource="&swrc;InProceedings"/>
    <swrc:booktitle>CSL</swrc:booktitle><swrc:crossref>conf/csl/2007</swrc:crossref><swrc:pages>481-495</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>A Cut-Free and Invariant-Free Sequent Calculus for PLTL.</swrc:title><swrc:volume>4646</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2007-08-29 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://dx.doi.org/10.1007/978-3-540-74915-8_36"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="978-3-540-74914-1"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2007-08-29"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Joxe Gaintzarain" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Montserrat Hermo" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Paqui Lucio" /></rdf:_3>
  <rdf:_4><swrc:Person swrc:name="Marisa Navarro" /></rdf:_4>
  <rdf:_5><swrc:Person swrc:name="Fernando Orejas" /></rdf:_5>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Jacques Duparc" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Thomas A. Henzinger" /></rdf:_2>
  </rdf:Seq>
</swrc:editor></rdf:Description>
</rdf:RDF>