BACK TO INDEX

Publications of year 2012
Books and proceedings
  1. Eighth IEEE World Congress on Services, SERVICES 2012, Honolulu, HI, USA, June 24-29, 2012, 2012. IEEE. ISBN: 978-1-4673-3053-4. 
    @proceedings{DBLP:conf/services/2012,
title = {Eighth IEEE World Congress on Services, SERVICES 2012, Honolulu, HI, USA, June 24-29, 2012},
booktitle = {SERVICES},
publisher = {IEEE},
year = {2012},
isbn = {978-1-4673-3053-4},
ee = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6273233},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  2. Stephen Muggleton, Alireza Tamaddoni-Nezhad, and Francesca A. Lisi, editors. Inductive Logic Programming - 21st International Conference, ILP 2011, Windsor Great Park, UK, July 31 - August 3, 2011, Revised Selected Papers, volume 7207 of Lecture Notes in Computer Science, 2012. Springer. ISBN: 978-3-642-31950-1. 
    @proceedings{DBLP:conf/ilp/2011,
editor = {Stephen Muggleton and Alireza Tamaddoni-Nezhad and Francesca A. Lisi},
title = {Inductive Logic Programming - 21st International Conference, ILP 2011, Windsor Great Park, UK, July 31 - August 3, 2011, Revised Selected Papers},
booktitle = {ILP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {7207},
year = {2012},
isbn = {978-3-642-31950-1},
ee = {http://dx.doi.org/10.1007/978-3-642-31951-8},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  3. Elena Simperl, Philipp Cimiano, Axel Polleres, Óscar Corcho, and Valentina Presutti, editors. The Semantic Web: Research and Applications - 9th Extended Semantic Web Conference, ESWC 2012, Heraklion, Crete, Greece, May 27-31, 2012. Proceedings, volume 7295 of Lecture Notes in Computer Science, 2012. Springer. ISBN: 978-3-642-30283-1. 
    @proceedings{DBLP:conf/esws/2012,
editor = {Elena Simperl and Philipp Cimiano and Axel Polleres and {\'O}scar Corcho and Valentina Presutti},
title = {The Semantic Web: Research and Applications - 9th Extended Semantic Web Conference, ESWC 2012, Heraklion, Crete, Greece, May 27-31, 2012. Proceedings},
booktitle = {ESWC},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {7295},
year = {2012},
isbn = {978-3-642-30283-1},
ee = {http://dx.doi.org/10.1007/978-3-642-30284-8},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  4. Jon Sneyers and Thom Frühwirth, editors. CHR '12: Proc. 9th Workshop on Constraint Handling Rules, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): CHR 2012. 
    @proceedings{pchr12,
title = CHR12l,
booktitle = CHR12,
year = {2012},
month = sep,
location = {Budapest, Hungary},
city = {Budapest, Hungary},
editor = {Jon Sneyers and Thom Fr{\"u}hwirth},
publisher = KULCW # {, Technical report CW 624},
pdf = {http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW624.pdf},
url = {http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW624.abs.html},
keywords = {CHR 2012},

}


Articles in journal, book chapters
  1. Stefano Bistarelli, Fabio Martinelli, and Francesco Santini. A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials. Computers & Mathematics with Applications, 64(4):447-462, 2012. 
    @article{DBLP:journals/cma/BistarelliMS12,
author = {Stefano Bistarelli and Fabio Martinelli and Francesco Santini},
title = {A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials},
journal = {Computers {\&} Mathematics with Applications},
volume = {64},
number = {4},
year = {2012},
pages = {447-462},
ee = {http://dx.doi.org/10.1016/j.camwa.2011.12.017},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  2. Stefano Bistarelli, Fabio Martinelli, and Francesco Santini. A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials. Computers & Mathematics with Applications, (0):-, 2012. ISSN: 0898-1221. [WWW] [doi:10.1016/j.camwa.2011.12.017] Keyword(s): abduction, applications. 
    @article{Bistarelli2012,
title = "A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials",
journal = "Computers \& Mathematics with Applications",
volume = "",
number = "0",
pages = " - ",
year = "2012",
note = "",
issn = "0898-1221",
doi = "10.1016/j.camwa.2011.12.017",
url = "http://www.sciencedirect.com/science/article/pii/S0898122111010728",
author = "Stefano Bistarelli and Fabio Martinelli and Francesco Santini",
keywords = "abduction, applications",

}


  3. Ruoyu Chen, Lejian Liao, and Zhi Fang. A Virtual Organization Model Based on Semantic Web Services and Its Application in Supply Chain for Agricultural Product. Advances in Control and Communication, 2012. 
    @article{ chen_acc12,
author = {Ruoyu Chen and Lejian Liao and Zhi Fang},
title = {A Virtual Organization Model Based on Semantic Web Services and Its Application in Supply Chain for Agricultural Product},
journal = {Advances in Control and Communication},
year = {2012},

}


  4. Gregory J. Duck. SMCHR: Satisfiability Modulo Constraint Handling Rules. CoRR, abs/1210.5307, 2012. 
    @article{DBLP:journals/corr/abs-1210-5307,
author = {Gregory J. Duck},
title = {SMCHR: Satisfiability Modulo Constraint Handling Rules},
journal = {CoRR},
volume = {abs/1210.5307},
year = {2012},
ee = {http://arxiv.org/abs/1210.5307},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  5. Rémy Haemmerlé. Diagrammatic Confluence for Constraint Handling Rules. Theory and Practice of Logic Programming, 12(4-5):737-753, September 2012. ISSN: 1471-0684. [WWW] [doi:10.1017/S1471068412000270] Keyword(s): confluence. 
    @article{HaemmerlE:2012:DCC:2431176.2431194,
author = {Haemmerl\'{e}, R\'{e}my},
title = {Diagrammatic Confluence for Constraint Handling Rules},
journal = TPLP,
issue_date = {September 2012},
volume = {12},
number = {4-5},
month = sep,
year = {2012},
issn = {1471-0684},
pages = {737--753},
numpages = {17},
url = {http://dx.doi.org/10.1017/S1471068412000270},
doi = {10.1017/S1471068412000270},
acmid = {2431194},
publisher = {Cambridge University Press},
address = {New York, NY, USA},
keywords = {confluence},

}


  6. Cleyton Rodrigues, Ryan Ribeiro de Azevedo, Fred Freitas, and Eric Dantas. LSVF: a New Search Heuristic to Reduce the Backtracking Calls for Solving Constraint Satisfaction Problem. (IJARAI) International Journal of Advanced Research in Artificial Intelligence, 1(9):20-25, 2012. 
    @article{ rodrigues2012,
author = {Cleyton Rodrigues and Ryan Ribeiro de Azevedo and Fred Freitas and Eric Dantas},
title = {LSVF: a New Search Heuristic to Reduce the Backtracking Calls for Solving Constraint Satisfaction Problem},
journal = {(IJARAI) International Journal of Advanced Research in Artificial Intelligence},
volume = {1},
number = {9} year = {2012},
pages = {20--25} 
}


  7. Kazunori Ueda and Seiji Ogawa. HyperLMNtal: An Extension of a Hierarchical Graph Rewriting Model. KI - Künstliche Intelligenz, pp 1-10, 2012. ISSN: 0933-1875. [WWW] Keyword(s): related formalisms. 
    @article {ueda_hyperLMNtal_KI12,
author = {Ueda, Kazunori and Ogawa, Seiji},
affiliation = {Department of Computer Science and Engineering, Waseda University, 3-4-1, Okubo, Shinjuku-ku, Tokyo, 169-8555 Japan},
title = {Hyper{LMN}tal: An Extension of a Hierarchical Graph Rewriting Model},
journal = {KI - K{\"u}nstliche Intelligenz},
publisher = {Springer Berlin / Heidelberg},
issn = {0933-1875},
keyword = {related formalisms},
pages = {1-10},
url = {http://dx.doi.org/10.1007/s13218-011-0162-3},
year = {2012} 
}


  8. Matje van de Camp and Henning Christiansen. Resolving relative time expressions in Dutch text with Constraint Handling Rules, pages 74-85. University of Orléans, 2012. 
    @inbook{0231bfd0e10f4e06a72a33f7be26e0b4,
title = {Resolving relative time expressions in Dutch text with Constraint Handling Rules},
publisher = {University of Orl\'{e}ans},
author = {{van de Camp}, Matje and Henning Christiansen},
year = {2012},
editor = {Denys Duchier and Yannick Parmentier},
pages = {74-85},
booktitle = {7th International Workshop on Constraint Solving and Language Processing (CSLP'12)} 
}


  9. M. Alberti, M. Gavanelli, and E. Lamma. Deon+: Abduction and Constraints for Normative Reasoning. In Alexander Artikis, Robert Craven, Nihan Kesim, Babak Sadighi, and Kostas Stathis, editors, Festschrift of Marek Sergot. Springer, 2012. 
    @incollection{ alberti_deonplus_12,
author = {M. Alberti and M. Gavanelli and E. Lamma},
title = {Deon+: Abduction and Constraints for Normative Reasoning},
booktitle = {Festschrift of Marek Sergot},
editor = {Alexander Artikis and Robert Craven and Nihan Kesim and Babak Sadighi and Kostas Stathis},
publisher = {Springer},
year = {2012},

}


  10. Stefano Bistarelli, Fabio Martinelli, Francesco Roperti, and Francesco Santini. Negotiation of Weighted RTML Credentials on Mobile Devices. In Marco De Marco, Dov Te'eni, Valentina Albano, and Stefano Za, editors, Information Systems: Crossroads for Organization, Management, Accounting and Engineering, pages 429-438. Physica-Verlag HD, 2012. ISBN: 978-3-7908-2788-0. [WWW] [doi:10.1007/978-3-7908-2789-7_47] 
    @incollection{Bistarelli-Martinelli-2012,
year={2012},
isbn={978-3-7908-2788-0},
booktitle={Information Systems: Crossroads for Organization, Management, Accounting and Engineering},
editor={De Marco, Marco and Te'eni, Dov and Albano, Valentina and Za, Stefano},
doi={10.1007/978-3-7908-2789-7_47},
title={Negotiation of Weighted RTML Credentials on Mobile Devices},
url={http://dx.doi.org/10.1007/978-3-7908-2789-7_47},
publisher={Physica-Verlag HD},
author={Bistarelli, Stefano and Martinelli, Fabio and Roperti, Francesco and Santini, Francesco},
pages={429-438},
language={English} 
}


Conference articles
  1. Slim Abdennadher and Nada Sharaf. Visualization of CHR through Source-to-Source Transformation. In Agostino Dovier and Vìtor Santos Costa, editors, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), volume 17 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pages 109-118, 2012. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. ISBN: 978-3-939897-43-9. ISSN: 1868-8969. [WWW] [doi:http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.109]
    Annotation:
    Keywords: Source-to-Source Transformation, Constraint Handling Rules, Visualization 

    @InProceedings{abdennadher_et_al:LIPIcs:2012:3614,
author = {Slim Abdennadher and Nada Sharaf},
title = {{Visualization of CHR through Source-to-Source Transformation}},
booktitle = {Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
pages = {109--118},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-43-9},
ISSN = {1868-8969},
year = {2012},
volume = {17},
editor = {Agostino Dovier and V{\'i}tor Santos Costa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3614},
URN = {urn:nbn:de:0030-drops-36148},
doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.109},
annote = {Keywords: Source-to-Source Transformation, Constraint Handling Rules, Visualization} 
}


  2. Alia El Bolock, Amira Zaki, and Thom Frühwirth. Substitution-based CHR Solver for Bivariate Binomial Equation Sets. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 41-50, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): applications, algorithms, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    Various methods for solving non-linear algebraic systems exist, as this question is amongst the most popular in both the realm of mathematics and computation. As most of these methods use approximations, this work focuses on finding and directly solving a tractable subset. Bivariate binomial systems of non-linear polynomial equations were chosen and solved through simulating the by hand method, using the declarative logic programming language Constraint Handling Rules. Substitution methods and different equation notations are used to extend the solvability of the subset. 

    @inproceedings{bolock_equations_chr12,
author = {Alia El Bolock and Amira Zaki and Thom Fr\"uhwirth},
title = {Substitution-based {CHR} Solver for Bivariate Binomial Equation Sets},
crossref = {pchr12},
pages={41--50},
abstract = { Various methods for solving non-linear algebraic systems exist, as this question is amongst the most popular in both the realm of mathematics and computation. As most of these methods use approximations, this work focuses on finding and directly solving a tractable subset. Bivariate binomial systems of non-linear polynomial equations were chosen and solved through simulating the by hand method, using the declarative logic programming language Constraint Handling Rules. Substitution methods and different equation notations are used to extend the solvability of the subset. },
keywords = {applications,algorithms},
pdf = PAPERSHOME # {chr2012/04-Bolock-chr12.pdf},

}


  3. Fabian Buettner and Jordi Cabot. Lightweight String Reasoning for OCL. In 8th European Conference on Modelling Foundations and Applications (ECMFA), 2012. 
    @inproceedings{ buettner_string_reasoning_ecmfa12,
author = {Fabian Buettner and Jordi Cabot},
title = {Lightweight String Reasoning for {OCL}},
booktitle = {8th European Conference on Modelling Foundations and Applications (ECMFA)},
year = {2012},

}


  4. Ruoyu Chen, Lejian Liao, and Zhi Fang. Contracting of Web Services with Constraint Handling Rules. In SERVICES, pages 211-218, 2012. IEEE. ISBN: 978-1-4673-3053-4. 
    @inproceedings{DBLP:conf/services/ChenLF12,
author = {Ruoyu Chen and Lejian Liao and Zhi Fang},
title = {Contracting of Web Services with Constraint Handling Rules},
booktitle = {SERVICES},
year = {2012},
pages = {211-218},
ee = {http://doi.ieeecomputersociety.org/10.1109/SERVICES.2012.36},
crossref = {DBLP:conf/services/2012},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  5. Henning Christiansen. An adaptation of Constraint Handling Rules for Interactive and Intelligent Installations. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 1-15, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): applications, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    Constraint Handling Rules, CHR, have proved to be effective for a large range of reasoning task, which is also interesting in different sorts of interactive installations. Typically, such an installation involves a large number of cooperating software components that need to refer to a common knowledge. Using CHR's constraint stores for knowledge representation may be appealing from a theoretical point of view, but suffers from the inherent limitation of CHR, that a constraint store disappears immediately after a query has been evaluated. An extension to CHR is proposed, which allows different processes to reason over and maintain a common knowledge base represented as text files containing constraints. Constraints are automatically read from and written to the files before and after a query has been executed, which means that the intended style of programming deviates only very little from traditional CHR programming. 

    @inproceedings{christiansen_iichr_chr12,
author = {Henning Christiansen},
title = {An adaptation of {C}onstraint {H}andling {R}ules for Interactive and Intelligent Installations},
crossref = {pchr12},
pages={1--15},
abstract = { Constraint Handling Rules, CHR, have proved to be effective for a large range of reasoning task, which is also interesting in different sorts of interactive installations. Typically, such an installation involves a large number of cooperating software components that need to refer to a common knowledge. Using CHR's constraint stores for knowledge representation may be appealing from a theoretical point of view, but suffers from the inherent limitation of CHR, that a constraint store disappears immediately after a query has been evaluated. 

An extension to CHR is proposed, which allows different processes to reason over and maintain a common knowledge base represented as text files containing constraints. Constraints are automatically read from and written to the files before and after a query has been executed, which means that the intended style of programming deviates only very little from traditional CHR programming. },
keywords = {applications},
pdf = PAPERSHOME # {chr2012/01-Christiansen-chr12.pdf},

}


  6. János Csorba, Zsolt Zombori, and Péter Szeredi. Pros and Cons of Using CHR for Type Inference. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 16-31, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): type systems, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    We report on using logic programming and in particular the Constraint Handling Rules extension of Prolog to provide static type analysis for the Q functional language. We discuss some of the merits and difficulties of CHR that we came across during implementation of a type inference tool. 

    @inproceedings{csorba_chr_for_type_inference_chr12,
author = {J\'anos Csorba and Zsolt Zombori and P\'eter Szeredi},
title = {Pros and Cons of Using {CHR} for Type Inference},
crossref = {pchr12},
pages={16--31},
abstract = { We report on using logic programming and in particular the Constraint Handling Rules extension of Prolog to provide static type analysis for the Q functional language. We discuss some of the merits and difficulties of CHR that we came across during implementation of a type inference tool. },
keywords = {type systems},
pdf = PAPERSHOME # {chr2012/02-Csorba-chr12.pdf},

}


  7. Veronica Dahl, Bradley Coleman, J. Emilio Miralles, and Erez Maharshak. CHR for Social Responsibility. In Agostino Dovier and Vìtor Santos Costa, editors, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), volume 17 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pages 370-380, 2012. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. ISBN: 978-3-939897-43-9. ISSN: 1868-8969. [WWW] [doi:http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.370]
    Annotation:
    Keywords: Constraint handling rules, principled decision making, informed voting, client directed voting, social responsibility. 

    @InProceedings{dahl_et_al:LIPIcs:2012:3637,
author = {Veronica Dahl and Bradley Coleman and J. Emilio Miralles and Erez Maharshak},
title = {{CHR for Social Responsibility}},
booktitle = {Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
pages = {370--380},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-43-9},
ISSN = {1868-8969},
year = {2012},
volume = {17},
editor = {Agostino Dovier and V{\'i}tor Santos Costa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3637},
URN = {urn:nbn:de:0030-drops-36374},
doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.370},
annote = {Keywords: Constraint handling rules, principled decision making, informed voting, client directed voting, social responsibility.} 
}


  8. Veronica Dahl and Juan Emilio Miralles. Womb Grammars: Constraint Solving for Grammar Induction. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 32-40, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): linguistics, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    We present Womb Grammars, a novel constraint-based framework implemented in CHRG and particularly useful for inducing, from known linguistic constraints that describe phrases in a language called the source, the linguistic constraints that describe phrases in another language, called the target. We present as well an application that uses as source an existing language fairly related to the target. Next we propose and motivate an intriguing research thread that uses as source language a (non-natural but coupled with our framework, generatively very powerful) universal language of our own device. Finally, we discuss further ramifications of our work. 

    @inproceedings{dahl_womb_grammars_chr12,
author = {Veronica Dahl and Juan Emilio Miralles},
title = {Womb Grammars: Constraint Solving for Grammar Induction},
crossref = {pchr12},
pages={32--40},
abstract = { We present Womb Grammars, a novel constraint-based framework implemented in CHRG and particularly useful for inducing, from known linguistic constraints that describe phrases in a language called the source, the linguistic constraints that describe phrases in another language, called the target. We present as well an application that uses as source an existing language fairly related to the target. Next we propose and motivate an intriguing research thread that uses as source language a (non-natural but coupled with our framework, generatively very powerful) universal language of our own device. Finally, we discuss further ramifications of our work. },
keywords = {linguistics},
pdf = PAPERSHOME # {chr2012/03-Dahl-chr12.pdf},

}


  9. Veronica Dahl, Emilio Miralles, and Leonor Becerra-Bonache. On Language Acquisition through Womb Grammars. In Proceedings of the 7th International Workshop on Constraint Solving and Language Processing, France, pages 99-105, 2012. [WWW] [PDF]
    Abstract:
    We propose to automate the field of language acquisition evaluation through Constraint Solving; in particular through the use of Womb Grammars. Womb Grammar Parsing is a novel constraint based paradigm that was devised mainly to induce grammatical structure from the description of its syntactic constraints in a related language. In this paper we argue that it is also ideal for automating the evaluation of language acquisition, and present as proof of concept a CHRG system for detecting which of fourteen levels of morphological proficiency a child is at, from a representative sample of the child's expressions. Our results also uncover ways in which the linguistic constraints that characterize a grammar need to be tailored to language acquisition applications. We also put forward a proposal for discovering in what order such levels are typically acquired in other languages than English. Our findings have great potential practical value, in that they can help educators tailor the games, stories, songs, etc. that can aid a child (or a second language learner) to progress in timely fashion into the next level of proficiency, and can as well help shed light on the processes by which languages less studied than English are acquired. 

    @inproceedings{dahl:hal-00751850,
hal_id = {hal-00751850},
url = {http://hal.archives-ouvertes.fr/hal-00751850},
title = {{On Language Acquisition through Womb Grammars}},
author = {Dahl, Veronica and Miralles, Emilio and Becerra-Bonache, Leonor},
abstract = {{We propose to automate the field of language acquisition evaluation through Constraint Solving; in particular through the use of Womb Grammars. Womb Grammar Parsing is a novel constraint based paradigm that was devised mainly to induce grammatical structure from the description of its syntactic constraints in a related language. In this paper we argue that it is also ideal for automating the evaluation of language acquisition, and present as proof of concept a CHRG system for detecting which of fourteen levels of morphological proficiency a child is at, from a representative sample of the child's expressions. Our results also uncover ways in which the linguistic constraints that characterize a grammar need to be tailored to language acquisition applications. We also put forward a proposal for discovering in what order such levels are typically acquired in other languages than English. Our findings have great potential practical value, in that they can help educators tailor the games, stories, songs, etc. that can aid a child (or a second language learner) to progress in timely fashion into the next level of proficiency, and can as well help shed light on the processes by which languages less studied than English are acquired.}},
language = {Anglais},
affiliation = {School of Computing Science , LAboratoire Hubert Curien - LAHC},
booktitle = {{Proceedings of the 7th International Workshop on Constraint Solving and Language Processing}},
pages = {99-105},
address = {France},
audience = {internationale },
year = {2012},
pdf = {http://hal.archives-ouvertes.fr/hal-00751850/PDF/dmb\_CSLP12.pdf} 
}


  10. Rémy Haemmerlé. Coinductive Proof over Streams as CHR Confluence Proofs. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 51-65, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): confluence, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    Coinduction is an important theoretical tool for defining and reasoning about unbound data structures (such as streams, graphs, infinite trees, rational numbers ...), and infinite-behavior systems. Confluence is a fundamental property of {C}onstraint {H}andling {R}ules ({CHR}) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper, we illustrate how the confluence of CHR can be used to prove universal coinductive properties. In particular, we give several examples of bisimulation proofs over streams. 

    @inproceedings{haemmerle_coinductive_proofs_chr12,
author = {R\'emy Haemmerl\'e},
title = {Coinductive Proof over Streams as {CHR} Confluence Proofs},
crossref = {pchr12},
pages={51--65},
abstract = { Coinduction is an important theoretical tool for defining and reasoning about unbound data structures (such as streams, graphs, infinite trees, rational numbers ...), and infinite-behavior systems. Confluence is a fundamental property of {C}onstraint {H}andling {R}ules ({CHR}) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper, we illustrate how the confluence of CHR can be used to prove universal coinductive properties. In particular, we give several examples of bisimulation proofs over streams. },
keywords = {confluence},
pdf = PAPERSHOME # {chr2012/05-Haemmerle-chr12.pdf},

}


  11. Ester Martìnez-Martin, M. Teresa Escrig, and Angel P. Del Pobil. Qualitative Velocity Model: Representation, Reasoning and Application. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 66-81, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): applications, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    On the way to autonomous systems, one of the key issues concerns spatial reasoning for solving problems dealing with uncertainty. From the starting point of human nature, information must be represented in a way that any system can reason with imprecise knowledge about different physical aspects and make correct decisions from them. Keeping this idea in mind, this paper presents the qualitative model of velocity including representation, reasoning process and a real robotic application. 

    @inproceedings{martinez_qualitative_velocity_chr12,
author = {Ester Mart\'inez-Martin and M. Teresa Escrig and Angel P. Del Pobil},
title = {Qualitative Velocity Model: Representation, Reasoning and Application},
crossref = {pchr12},
pages={66--81},
abstract = { On the way to autonomous systems, one of the key issues concerns spatial reasoning for solving problems dealing with uncertainty. From the starting point of human nature, information must be represented in a way that any system can reason with imprecise knowledge about different physical aspects and make correct decisions from them. Keeping this idea in mind, this paper presents the qualitative model of velocity including representation, reasoning process and a real robotic application. },
keywords = {applications},
pdf = PAPERSHOME # {chr2012/06-Martinez-Martin-chr12.pdf},

}


  12. Colin Nicholson and Danny De Schreye. Relevancy analysis as a basis for improved tabling in CHRiSM. In Elvira Albert, editor, Proceedings of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation,, pages 100-114, Septempber 2012. [WWW] 
    @inproceedings{369440,
author = {Nicholson, Colin and De Schreye, Danny},
title = {Relevancy analysis as a basis for improved tabling in {CHR}i{SM}},
booktitle = {Proceedings of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation, },
editor = {Albert, Elvira},
pages = {100--114},
month = {Septempber},
year = {2012},
url = {https://lirias.kuleuven.be/handle/123456789/369440} 
}


  13. Amira Zaki, Thom Frühwirth, and Ilvar Geller. Parallel Execution of Constraint Handling Rules on a Graphical Processing Unit. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 82-90, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): parallelism, implementation, CHR 2012, CHR 2012, CHR 2012, CHR 2012.
    Abstract:
    Graphical Processing Units (GPUs) consist of hundreds of small cores, collectively operating to provide massive computation capabilities. The aim of this work is to utilize this technology to execute Constraint Handling Rules (CHR) which are inherently parallel. A translation scheme is defined to transform a subset of CHR to C++, then to use a GPU to fire the rules on all combinations of constraints. As proof of concept, the scheme was performed on several CHR examples. 

    @inproceedings{zaki_parallel_gpu_chr12,
author = {Amira Zaki and Thom Fr{\"u}hwirth and Ilvar Geller},
title = {Parallel Execution of {C}onstraint {H}andling {R}ules on a {G}raphical {P}rocessing {U}nit},
crossref = {pchr12},
pages={82--90},
abstract = { Graphical Processing Units (GPUs) consist of hundreds of small cores, collectively operating to provide massive computation capabilities. The aim of this work is to utilize this technology to execute Constraint Handling Rules (CHR) which are inherently parallel. A translation scheme is defined to transform a subset of CHR to C++, then to use a GPU to fire the rules on all combinations of constraints. As proof of concept, the scheme was performed on several CHR examples. },
keywords = {parallelism,implementation},
pdf = PAPERSHOME # {chr2012/07-Zaki-chr12.pdf},

}


  14. Viktor de Boer, Jan Wielemaker, Judith van Gent, Michiel Hildebrand, Antoine Isaac, Jacco van Ossenbruggen, and Guus Schreiber. Supporting Linked Data Production for Cultural Heritage Institutes: The Amsterdam Museum Case Study. In Elena Simperl, Philipp Cimiano, Axel Polleres, Óscar Corcho, and Valentina Presutti, editors, ESWC, volume 7295 of Lecture Notes in Computer Science, pages 733-747, 2012. Springer. ISBN: 978-3-642-30283-1. 
    @inproceedings{DBLP:conf/esws/BoerWGHIOS12,
author = {Viktor de Boer and Jan Wielemaker and Judith van Gent and Michiel Hildebrand and Antoine Isaac and Jacco van Ossenbruggen and Guus Schreiber},
title = {Supporting Linked Data Production for Cultural Heritage Institutes: The Amsterdam Museum Case Study},
booktitle = {ESWC},
year = {2012},
pages = {733-747},
ee = {http://dx.doi.org/10.1007/978-3-642-30284-8_56},
crossref = {DBLP:conf/esws/2012},
bibsource = {DBLP, http://dblp.uni-trier.de} 
}


  15. Victor de Boer, Jan Wielemaker, Judith van Gent, Michiel Hildebrand, Antoine Isaac, Jacco van Ossenbruggen, and Guus Schreiber. Supporting Linked Data Production for Cultural Heritage institutes: The Amsterdam Museum Case Study. In 9th Extended Semantic Web Conference (ESWC 2012), May 2012. 
    @inproceedings{ deboer_amsterdam_museum_eswc12,
author = {Victor {de Boer} and Jan Wielemaker and Judith {van Gent} and Michiel Hildebrand and Antoine Isaac and Jacco {van Ossenbruggen} and Guus Schreiber},
title = {Supporting Linked Data Production for Cultural Heritage institutes: The {A}msterdam Museum Case Study},
booktitle = {9th Extended Semantic Web Conference (ESWC 2012)},
location = { Heraklion, Greece},
month = {May},
year = {2012},

}


Miscellaneous
  1. Rafael Caballero, Yolanda Garcia-Ruiz, and Fernando Saenz-Perez. Debugging Datalog Programs Through CHRs, 2012. 
    @misc{ caballero_debugging_datalog,
author = {Rafael Caballero and Yolanda Garcia-Ruiz and Fernando Saenz-Perez},
title = {Debugging Datalog Programs Through {CHR}s},
year = {2012} 
}



BACK TO INDEX

Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

The contents of this webpage is provided by the authors stated below. KU Leuven is not bound by the information provided. It is possible that the information is not or no longer completely accurate. Where necessary, the authors can adjust and update faulty information. The authors have taken all reasonable care to ensure that all information available on this website is accurate at the time of publication and on the basis of the current state of knowledge. KU Leuven nor the authors are responsible for the content of any links to external organisations that are referred to on this website.

Last modified: Mon Dec 16 13:19:46 2013
This bibliography was compiled by the following authors: Please send BibTEX entries of missing CHR-related publications to Jon Sneyers.

This document was translated from BibTEX by bibtex2html