A distinguishing feature of Answer Set programming is its versatility. In addition to satisfiability testing, it offers various forms of model enumeration, intersection or unioning, as well as optimization. Moreover, ...
详细信息
ISBN:
(纸本)9783642405648
A distinguishing feature of Answer Set programming is its versatility. In addition to satisfiability testing, it offers various forms of model enumeration, intersection or unioning, as well as optimization. Moreover, there is an increasing interest in incremental and reactive solving due to their applicability to dynamic domains. However, so far no comparative studies have been conducted, contrasting the respective modeling capacities and their computational impact. To assess the variety of different forms of ASP solving, we propose Alex Randolph's board game Ricochet Robots as a transverse benchmark problem that allows us to compare various approaches in a uniform setting. To begin with, we consider alternative ways of encoding ASP planning problems and discuss the underlying modeling techniques. In turn, we conduct an empirical analysis contrasting traditional solving, optimization, incremental, and reactive approaches. In addition, we study the impact of some boosting techniques in the realm of our case study.
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so fa...
详细信息
Answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and artificialintelligence. Hereby one represents the problem at hand in such a way that ea...
详细信息
ISBN:
(纸本)9783642405648
Answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and artificialintelligence. Hereby one represents the problem at hand in such a way that each model of the ASP program corresponds to one solution of the original problem. In recent years, several tools which support the user in developing ASP applications have been introduced. However, explicit treatment of one of the main aspects of ASP, multiple solutions, has received less attention within these tools. In this work, we present a novel system to visualize relations between answer sets of a given program. the core idea of the system is that the user specifies the concept of a relation by an ASP program itself. this yields a highly flexible system that suggests potential applications beyond development environments, e.g., applications in the field of abduction, which we will discuss in a case study.
We present r..eal , a library that integrates the R statistical environment with Prolog. Due to R's functional programming affinity the interface introduced has a minimalistic feel. Programs utilising the library ...
详细信息
Combinatory Categorial Grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories i...
详细信息
ISBN:
(纸本)9783642405648
Combinatory Categorial Grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories in order to parse sentences. In this work we describe and implement a new approach to CCG parsing that relies on Answer Set programming (ASP) - a declarative programming paradigm. Different from previous work, we present an encoding that is inspired by the algorithm due to Cocke, Younger, and Kasami (CYK). We also show encoding extensions for parse tree normalization and best-effort parsing and outline possible future extensions which are possible due to the usage of ASP as computational mechanism. We analyze performance of our approach on a part of the Brown corpus and discuss lessons learned during experiments withthe ASP tools dlv, gringo, and clasp. the new approach is available in the open source CCG parsing toolkit AspCcgTk which uses the C&C supertagger as a preprocessor to achieve wide-coverage natural language parsing.
We address the problem of belief revision of logic programs, i.e., how to incorporate to a logic program P a new logic program Q. Based on the structure of SE interpretations, Delgrande et al. [5] adapted the AGM post...
详细信息
ISBN:
(纸本)9783642405648
We address the problem of belief revision of logic programs, i.e., how to incorporate to a logic program P a new logic program Q. Based on the structure of SE interpretations, Delgrande et al. [5] adapted the AGM postulates to identify the rational behavior of generalized logic program (GLP) revision operators and introduced some specific operators. In this paper, a constructive characterization of all rational GLP revision operators is given in terms of an ordering among propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational GLP revision operators and makes easier the comprehension of their semantic properties. In particular, we show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Taking advantage of our characterization, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior.
Stream reasoning is an emerging research field focused on dynamic processing and continuous reasoning over huge volumes of streaming data. Finding the right trade-off between scalability and expressivity is a key chal...
详细信息
Recently, Boolean Satisfiability (SAT) solving has been proposed to tackle the increasing complexity in high-level system design. Working well for system specifications with a limited amount of routing options, they t...
详细信息
ISBN:
(纸本)9783642405648
Recently, Boolean Satisfiability (SAT) solving has been proposed to tackle the increasing complexity in high-level system design. Working well for system specifications with a limited amount of routing options, they tend to fail for densely connected computing platforms. this paper proposes an automated system design approach employing Answer Set programming (ASP). ASP provides a stringent semantics, allowing for an efficient representation of routing options. An automotive case-study illustrates that the proposed ASP-based system design approach is competitive for sparsely connected computing platforms, while it outperforms SAT-based approaches for dense Networks-on-Chip by an order of magnitude.
In this paper we investigate module extraction for the Description logic SRIQ. We formulate modules in terms of the reachability problem for directed hypergraphs. Using inseparability relations, we investigate the mod...
详细信息
Abduction as reasoning paradigm has been much explored in artificialintelligence, but not yet taken up by decision making as much as its potential warrants. Indeed, abduction permits the generation of hypothetical kn...
详细信息
ISBN:
(纸本)9781614992646;9781614992639
Abduction as reasoning paradigm has been much explored in artificialintelligence, but not yet taken up by decision making as much as its potential warrants. Indeed, abduction permits the generation of hypothetical knowledge based scenarios, about which one can then equate decisions. One reason for this state of affairs is that abduction is difficult to implement efficaciously, even by experts, which entails that abductive systems are not readily available for decision making. Our concept of tabled abduction mitigates this, in the abductive logicprogramming system TABDUAL. the contribution of this paper is three-fold: (1) We discuss some TABDUAL improvements towards its more practical use, particularly in decision making, (2) We show that declarative debugging can be viewed as abduction in logicprogramming, thus showing another potential of abduction for decision making, and (3) We describe how TABDUAL can be applied in decision making and examine its benefit.
暂无评论