@inproceedings{Schrijvers2010,
  author    = {Schrijvers, Tom},
  title     = {Overview of the monadic constraint programming framework},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41411},
  year      = {2010},
  abstract  = {A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. Search and search strategies can then be defined as firstclass objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible.},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {Stationary generated models of generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41501},
  year      = {2010},
  abstract  = {The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the 'intended' partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91]. The presented preference criterion defines a partial model of a generalized logic program as intended if it is generated by a stationary chain. It turns out that the stationary generated models coincide with the stationary models on the class of normal logic programs. The general wellfounded semantics of such a program is defined as the set-theoretical intersection of its stationary generated models. For normal logic programs the general wellfounded semantics equals the wellfounded semantics.},
  language  = {en}
}
@inproceedings{AbdennadherIsmailKhoury2010,
  author    = {Abdennadher, Slim and Ismail, Haythem and Khoury, Frederick},
  title     = {Transforming imperative algorithms to constraint handling rules},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41533},
  year      = {2010},
  abstract  = {Different properties of programs, implemented in Constraint Handling Rules (CHR), have already been investigated. Proving these properties in CHR is fairly simpler than proving them in any type of imperative programming language, which triggered the proposal of a methodology to map imperative programs into equivalent CHR. The equivalence of both programs implies that if a property is satisfied for one, then it is satisfied for the other. The mapping methodology could be put to other beneficial uses. One such use is the automatic generation of global constraints, at an attempt to demonstrate the benefits of having a rule-based implementation for constraint solvers.},
  language  = {en}
}
@inproceedings{BetzRaiserFruehwirth2010,
  author    = {Betz, Hariolf and Raiser, Frank and Fr{\"u}hwirth, Thom},
  title     = {Persistent constraints in constraint handling rules},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41547},
  year      = {2010},
  abstract  = {In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.},
  language  = {en}
}
@inproceedings{GebserHinrichsSchaubetal.2010,
  author    = {Gebser, Martin and Hinrichs, Henrik and Schaub, Torsten H. and Thiele, Sven},
  title     = {xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41466},
  year      = {2010},
  abstract  = {We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.},
  language  = {en}
}
@inproceedings{OetschSchwengererTompits2010,
  author    = {Oetsch, Johannes and Schwengerer, Martin and Tompits, Hans},
  title     = {Kato: a plagiarism-detection tool for answer-set programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41485},
  year      = {2010},
  abstract  = {We present the tool Kato which is, to the best of our knowledge, the first tool for plagiarism detection that is directly tailored for answer-set programming (ASP). Kato aims at finding similarities between (segments of) logic programs to help detecting cases of plagiarism. Currently, the tool is realised for DLV programs but it is designed to handle various logic-programming syntax versions. We review basic features and the underlying methodology of the tool.},
  language  = {en}
}
@inproceedings{Zhou2010,
  author    = {Zhou, Neng-Fa},
  title     = {What I have learned from all these solver competitions},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41431},
  year      = {2010},
  abstract  = {In this talk, I would like to share my experiences gained from participating in four CSP solver competitions and the second ASP solver competition. In particular, I'll talk about how various programming techniques can make huge differences in solving some of the benchmark problems used in the competitions. These techniques include global constraints, table constraints, and problem-specific propagators and labeling strategies for selecting variables and values. I'll present these techniques with experimental results from B-Prolog and other CLP(FD) systems.},
  language  = {en}
}
@inproceedings{HanusKoschnicke2010,
  author    = {Hanus, Michael and Koschnicke, Sven},
  title     = {An ER-based framework for declarative web programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41447},
  year      = {2010},
  abstract  = {We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.},
  language  = {en}
}
@misc{StieglitzFuchssHillmannetal.2007,
  author    = {Stieglitz, Stefan and Fuchß, Christoph and Hillmann, Oliver and Lattemann, Christoph},
  title     = {Mobile learning by using ad hoc messaging network},
  issn      = {1867-5808},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-19960},
  year      = {2007},
  abstract  = {The requirements of modern e-learning techniques change. Aspects such as community interaction, flexibility, pervasive learning and increasing mobility in communication habits become more important. To meet these challenges e-learning platforms must provide support on mobile learning. Most approaches try to adopt centralised and static e-learning mechanisms to mobile devices. However, often technically it is not possible for all kinds of devices to be connected to a central server. Therefore we introduce an application of a mobile e-learning network which operates totally decentralised with the help of an underlying ad hoc network architecture. Furthermore the concept of ad hoc messaging network (AMNET) is used as basis system architecture for our approach to implement a platform for pervasive mobile e-learning.},
  language  = {en}
}
@inproceedings{GeskeWolf2010,
  author    = {Geske, Ulrich and Wolf, Armin},
  title     = {Preface},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41401},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), W{\"u}rzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and W{\"u}rzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.},
  language  = {en}
}