In this paper, we present GIDL, a grounder for FO+. FO+ is a very expressive extension of first-order logic with sev-eral constructs such as inductive definitions, aggregates and arithmetic. We describe the input and output language of GIDL, and provide details about its architecture. In partic

Abstract not found

"Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation. In this article, we define this new field. First, we review the "Grid problem," which we define as flexible, secure, coordinated resource sharing among dynamic collections of individuals, institutions, and resources---what we refer to as virtual organizations. In such settings, we encounter unique authentication, authorization, resource access, resource discovery, and other challenges. It is this class of problem that is addressed by Grid technologies. Next, we present an extensible and open Grid architecture,inwhich protocols, services, application programming interfaces, and software development kits are categorized according to their roles in enabling resource sharing. We describe requirements that we believe any such mechanisms must satisfy and we discuss the importance of defining a compact set of intergrid protocols to enable interoperability among different Grid systems. Finally, we discuss how Grid technologies relate to other contemporary technologies, including enterprise integration, application service provider, storage service provider, and peer-to-peer computing. We maintain that Grid concepts and technologies complement and have much to contribute to these other approaches.

problems of lower complexity in a simpler and more natural fashion. This paper presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel

Abstract not found

This paper1 deals with four solvers for combinatorial problems: the commercial state-of-the-art solver ILOG oplstudio, and the research ASP systems dlv, smodels and cmodels. The first goal of this research is to evaluate the relative performance of such systems when used in a purely declarative way

Abstract. In this work, we give an overview of the DLV Intelligent Grounder, one of the most popular Answer Set Programming instantia-tors, and a very strong point of the DLV system. Based on a variant of semi-naive evaluation, it also includes several advanced optimization techniques and supports

. Although there is meanwhile quite a variety of ASP solvers, there are merely two major grounders, namely lparse [2] and dlv’s grounding component [3]. We enrich this underrepresented area and present a new grounder, called GrinGo, that combines and

ME-ASP is a multi-engine solver for ground ASP programs. It exploits algorithm selection techniques based on classifi-cation to select one among a set of out-of-the-box heteroge-neous ASP solvers used as black-box engines. In this paper we report on (i) a new optimized implementation of ME-ASP

Abstract. This paper deals with three solvers for combinatorial problems: the commercial state-of-the-art solver Ilog OPL, and the research ASP systems DLV and SMODELS. The first goal of this research is to evaluate the relative performance of such systems, using a reproducible and extensible