We introduce dlv2, a new answer set programming (ASP) system. dlv2 combines I-dlv, a fully-compliant ASP-Core-2 grounder, with the well-assessed solver wasp. Input programs may be enriched by annotations and directive...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
We introduce dlv2, a new answer set programming (ASP) system. dlv2 combines I-dlv, a fully-compliant ASP-Core-2 grounder, with the well-assessed solver wasp. Input programs may be enriched by annotations and directives that customize heuristics of the system and extend its solving capabilities. An empirical analysis conducted on benchmarks from past ASP competitions shows that dlv2 outperforms the old dlv system and is close to the state-of-the-art ASP system CLINGO.
Dealing with domains involving substantial quantitative information in answer set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and Constraint...
详细信息
Dealing with domains involving substantial quantitative information in answer set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and Constraint programming aim to overcome this limitation, but also impose inconvenient constraints - first and foremost that quantitative information must be encoded by means of total functions. This goes against central knowledge representation principles that contribute to the power of ASP, and makes the formalization of certain domains difficult. ASP{f} is being developed with the ultimate goal of providing scientists and practitioners with an alternative to CASP languages that allows for the efficient representation of qualitative and quantitative information in ASP without restricting one's ability to deal with incompleteness or uncertainty. In this paper we present the latest outcome of such research: versions of the language and of the supporting system that allow for practical, industrial-size use and scalability. The applicability of ASP{f} is demonstrated by a case study on an actual industrial application.
answer set programming (ASP) is a well-established declarative programming language based on logic. The success of ASP is mainly due to the availability of efficient ASP solvers, therefore their development is still a...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
answer set programming (ASP) is a well-established declarative programming language based on logic. The success of ASP is mainly due to the availability of efficient ASP solvers, therefore their development is still an important research topic. In this paper we report the recent improvements of the well-known ASP solver WASP. The new version of WASP includes several improvements of the main solving strategies and advanced reasoning techniques for computing paracoherent answersets. Indeed, WASP is the first ASP solver handling paracoherent reasoning under two mainstream semantics, namely semi-stable and semiequilibrium. However, semi-equilibrium semantics may require the introduction of several disjunctive rules, which are usually considered as a source of inefficiency for modern solvers. Such a drawback is addressed in WASP by implementing ad-hoc techniques to efficiently handle disjunctive logic programs. These techniques are presented and evaluated in this paper.
answer set programming (ASP) is a declarative programming paradigm that has been successfully used in a number of industry-level applications also thanks to the availability of development tools. REpresentation State ...
详细信息
ISBN:
(纸本)9783319733050;9783319733043
answer set programming (ASP) is a declarative programming paradigm that has been successfully used in a number of industry-level applications also thanks to the availability of development tools. REpresentation State Transfer (REST) Web Services recently became a common and widely-used tool for enterprise applications. A service-oriented infrastructure for ASP would further catalyze the adoption of ASP-based solutions in real-world contexts. This paper introduces a REST-based framework for ASP, and reports on an application of the framework in the field of surveillance for photovoltaic plants.
We argue that turning a logic program into a set of completed definitions can be sometimes thought of as the "reverse engineering" process of generating a set of conditions that could serve as a specificatio...
详细信息
We argue that turning a logic program into a set of completed definitions can be sometimes thought of as the "reverse engineering" process of generating a set of conditions that could serve as a specification for it. Accordingly, it may be useful to define completion for a large class of answer set programming (ASP) programs and to automate the process of generating and simplifying completion formulas. Examining the output produced by this kind of software may help programmers to see more clearly what their program does, and to what degree its behavior conforms with their expectations. As a step toward this goal, we propose here a definition of program completion for a large class of programs in the input language of the ASP grounder gringo, and study its properties.
Management of chronic diseases, such as heart failure, is a major public health problem. A standard approach to managing chronic diseases by medical community is to have a committee of experts develop guidelines that ...
详细信息
Management of chronic diseases, such as heart failure, is a major public health problem. A standard approach to managing chronic diseases by medical community is to have a committee of experts develop guidelines that all physicians should follow. Due to their complexity, these guidelines are difficult to implement and are adopted slowly by the medical community at large. We have developed a physician advisory system that codes the entire set of clinical practice guidelines for managing heart failure using answer set programming. In this paper, we show how abductive reasoning can be deployed to find missing symptoms and conditions that the patient must exhibit in order for a treatment prescribed by a physician to work effectively. Thus, if a physician does not make an appropriate recommendation or makes a non-adherent recommendation, our system will advise the physician about symptoms and conditions that must be in effect for that recommendation to apply. It is under consideration for acceptance in TPLP.
Gripper planning problem (GPP) is an important benchmark in planning. answer set programming (ASP) provides a declarative problem solving paradigm. Due to the efficient ASP solvers, it is widely used in diagnosis, sch...
详细信息
ISBN:
(纸本)9781538630228
Gripper planning problem (GPP) is an important benchmark in planning. answer set programming (ASP) provides a declarative problem solving paradigm. Due to the efficient ASP solvers, it is widely used in diagnosis, scheduling, planning and so forth. This paper proposes a new ASP-based declarative approach for GPP, called AASP. By translating GPP into an equivalent graph traveling problem, the correctness of AASP is proved. Experimental results show that AASP outperforms state of the art GPP approaches, including MpC and PLASP. The former is a planning domain define language (PDDL) planer, while the later is an automatic compiler which translated PDDL language into ASP.
answer set programming (ASP) is a declarative language oriented towards solving complex combinatorial problems. In fact, ASP has been successfully used to address problems in various academic and industrial domains. T...
详细信息
answer set programming (ASP) is a declarative language oriented towards solving complex combinatorial problems. In fact, ASP has been successfully used to address problems in various academic and industrial domains. The success of ASP can be attributed to its concise syntax, intuitive semantics, and the availability of several efficient solvers based on the Conflict-Driven Clause Learning (CDCL) algorithm. This paper details the design and implementation of contemporary CDCL solvers, emphasizing both algorithmic descriptions and their effective and efficient implementation.
Consistent Query answering (CQA) with respect to primary keys is the following problem. Given a database instance that is possibly inconsistent with respect to its primary key constraints, define a repair as an inclus...
详细信息
ISBN:
(纸本)9781450368599
Consistent Query answering (CQA) with respect to primary keys is the following problem. Given a database instance that is possibly inconsistent with respect to its primary key constraints, define a repair as an inclusion-maximal consistent subinstance. Given a Boolean query q, the problem CERTAINTY(q) takes a database instance as input, and asks whether q is true in every repair. For every Boolean conjunctive query q, the complement of CERTAINTY(q) can be straightforwardly implemented in answer set programming (ASP) by means of a generate-and-test approach: first generate a repair, and then test whether it falsifies the query. Theoretical research has recently revealed that for every selfjoin-free Boolean conjunctive query q, the complexity class of CERTAINTY(q) is one of FO, L-complete, or coNP-complete. Faced with this complexity trichotomy, one can hypothesize that in practice, the full power of generate-and-test is a computational overkill when CERTAINTY(q) is in the low complexity classes FO or L. We investigate part of this hypothesis within the context of ASP, by asking the following question: whenever CERTAINTY(q) is in FO, does a dedicated first-order algorithm exhibit significant performance gains compared to a generic generate-and-test implementation? We first elaborate on the construction of such dedicated first-order algorithms in ASP, and then empirically address this question.
Trust management is a promising approach for the authorization in distributed environment. There are two key issues for a trust management system: how to design high-level policy language and how to solve the complian...
详细信息
ISBN:
(纸本)3540265473
Trust management is a promising approach for the authorization in distributed environment. There are two key issues for a trust management system: how to design high-level policy language and how to solve the compliance-checking problem [3,4]. We adopt this approach to deal with distributed authorization with delegation. In this paper, we propose an authorization language AL, a human-understandable high level language to specify various authorization policies. We define the semantics of AL through answer set programming. Language AL has rich expressive power which can not only specify delegation, threshold structures addressed in previous approaches, but also represent structured resources and privileges, positive and negative authorizations, separation of duty, incomplete information reasoning and partial authorization and delegation. We also demonstrate the application of language AC through an authorization scenario.
暂无评论