@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
  year      = {2007},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Debugging ASP programs by means of ASP},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaubTompitsetal.2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A preference-based framework for updating logic programs},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{MileoSchaub2007,
  author    = {Mileo, Alessandra and Schaub, Torsten H.},
  title     = {Qualitative constraint enforcement in advanced policy specification},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeLangSchaub2007,
  author    = {Delgrande, James Patrick and Lang, J{\´e}r{\^o}me and Schaub, Torsten H.},
  title     = {Belief change based on global minimisation},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaubThiele2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Thiele, Sven},
  title     = {GrinGo : a new grounder for answer set programming},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserLiuNamasivayametal.2007,
  author    = {Gebser, Martin and Liu, Lengning and Namasivayam, Gayathri and Neumann, Andr{\´e} and Schaub, Torsten H. and Truszczynski, Miroslaw},
  title     = {The first answer set programming system competition},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.},
  title     = {Conflict-driven answer set enumeration},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserLeeLierler2007,
  author    = {Gebser, Martin and Lee, Joohyung and Lierler, Yuliya},
  title     = {Head-elementary-set-free logic programs},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.},
  title     = {Conflict-driven answer set solving},
  isbn      = {978-1-57735-323-2},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeLiuSchaubetal.2007,
  author    = {Delgrande, James Patrick and Liu, Daphne H. and Schaub, Torsten H. and Thiele, Sven},
  title     = {COBA 2.0 : a consistency-based belief change system},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaub2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based framework for merging knowledge bases},
  issn      = {1570-8683},
  year      = {2007},
  language  = {en}
}
@article{GebserGharibSchaub2007,
  author    = {Gebser, Martin and Gharib, Mona and Schaub, Torsten H.},
  title     = {Incremental answer sets and their computation},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaub2007,
  author    = {Gebser, Martin and Schaub, Torsten H.},
  title     = {Generic tableaux for answer set programming},
  year      = {2007},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.},
  title     = {Clasp : a conflict-driven answer set solver},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A general framework for expressing preferences in causal reasoning and planning},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exm046},
  year      = {2007},
  abstract  = {We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3.},
  language  = {en}
}
@article{GharibSchaubMercer2007,
  author    = {Gharib, Mona and Schaub, Torsten H. and Mercer, Robert E.},
  title     = {Incremental answer set programming : a preliminary report},
  year      = {2007},
  language  = {en}
}
@article{BrainFaberMarateaetal.2007,
  author    = {Brain, Martin and Faber, Wolfgang and Maratea, Marco and Polleres, Axel and Schaub, Torsten H. and Schindlauer, Roman},
  title     = {What should an ASP solver output? : a multiple position paper},
  year      = {2007},
  language  = {en}
}
@article{SchneidenbachSchnor2007,
  author    = {Schneidenbach, Lars and Schnor, Bettina},
  title     = {Design Issues in the Implementation of MPI2 One Sided Communication in Ethernet based Networks},
  isbn      = {978-0-88986-637-9},
  year      = {2007},
  abstract  = {In current research, one sided communication of the MPI2 standard is pushed as a promising technique [6, 7, 10, 18]. But measurements of applications and MPI2 primitives show a different picture [17]. In this paper we analyze de sign issues of MPI2 one sided communication and its im plementations. We focus on asynchronous communication for parallel applications in Ethernet cluster environments. Further, one sided communication is compared to two sided communication. This paper will prove that the key problem to performance is not only the implementation of MPI2 one sided communication - it is the design.},
  language  = {en}
}
@article{HoheiselMuellerSchnor2007,
  author    = {Hoheisel, A. and M{\"u}ller, S. and Schnor, Bettina},
  title     = {Fine-grained Security Management in a Service-oriented Grid Architecture},
  isbn      = {978-0-387-72811-7},
  year      = {2007},
  language  = {en}
}
@article{JeskeLuckowSchnor2007,
  author    = {Jeske, Janin and Luckow, Andr{\´e} and Schnor, Bettina},
  title     = {Reservation-based Resource-Brokering for Grid Computing},
  year      = {2007},
  abstract  = {In this paper we present the design and implementation of the Migol brokering framework. Migol is a Grid middleware, which addresses the fault-tolerance of long-running and compute-intensive applications. The framework supports e. g. the automatic and transparent recovery respectively the migration of applications. Another core feature of Migol is the discovery, selection, and allocation of resources using advance reservation. Grid broker systems can significantly benefit from advance reservation. With advance reservation brokers and users can obtain execution guarantees from local resource management systems (LRM) without requiring detailed knowledge of current and future workloads or of the resource owner's policies. Migol's Advance Reservation Service (ARS) provides an adapter layer for reservation capabilities of different LRMs, which is currently not provided by existing Grid middleware platforms. Further, we propose a shortest expected delay (SED) strategy for scheduling of advance reservations within the Job Broker Service. SED needs information about the earliest start time of an application. This is currently not supported by LRMs. We added this feature for PBSPro. Migol depends on Globus and its security infrastructure. Our performance experiments show the substantial overhead of this serviceoriented approach.},
  language  = {en}
}