检索结果-内蒙古大学图书馆

Qualitative Uncertainty Orderings Revised

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第SUPPL.期169卷 43-59页

作者： Capotorti, Andrea Formisano, Andrea Murador, Gianfranco Univ Perugia Dipartimento Matemat Informat Perugia Italy Univ LAquila Dipartimento Informat Laquila Italy

In recent decades, qualitative approaches to probabilistic uncertainty have been receiving wider and wider attention. We propose a new characterization of some of the most adopted partial preference orders by providing an uniform axiomatic treatment of a variety of qualitative uncertainty notions. We prove a representation result that connects qualitative notions of partial uncertainty to their numerical counterparts. We also describe an executable specification, in the declarative framework of answer set programming, that constitutes the core engine for the qualitative management of uncertainty. Some basic reasoning tasks are also identified.

关键词： Uncertainty order relations qualitative uncertainty frameworks partial assessments answer set programming

来源：评论

学校读者我要写书评

暂无评论

Unit Testing in ASP Revisited: Language and Test-Driven Development Environment

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第6期24卷 1078-1108页

作者： Amendola, Giovanni Mazzotta, Giuseppe Ricca, Francesco Berei, Tobias Univ Calabria Arcavacata Di Rende Italy Univ Appl Sci Upper Austria Campus Hagenberg Hagenberg Austria

Unit testing frameworks are nowadays considered a best practice, included in almost all modern software development processes, to achieve rapid development of correct specifications. Knowledge representation and reasoning paradigms such as answer set programming (ASP), that have been used in industry-level applications, are not an exception. Indeed, the first unit testing specification language for ASP was proposed in 2011 as a feature of the ASPIDE development environment. Later, a more portable unit testing language was included in the LANA annotation language. In this paper we revisit both languages and tools for unit testing in ASP. We propose a new unit test specification language that allows one to inline tests within ASP programs, and we identify the computational complexity of the tasks associated with checking the various program-correctness assertions. Test-case specifications are transparent to the traditional evaluation, but can be interpreted by a specific testing tool. Thus, we present a novel environment supporting test-driven development of ASP programs.

关键词： answer set programming unit testing development environments

来源：评论

学校读者我要写书评

暂无评论

Upward refinement operators for conceptual blending in the description logic εL⁺⁺

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2018年第1-3期82卷 69-99页

作者： Confalonieri, Roberto Eppe, Manfred Schorlemmer, Marco Kutz, Oliver Penaloza, Rafael Plaza, Enric Artificial Intelligence Res Inst IIIA CSIC Campus Univ Autonoma Barcelona E-08193 Bellaterra Catalonia Spain Int Comp Sci Inst Berkeley CA 94704 USA Free Univ Bozen Bolzano Res Ctr Knowledge & Data KRDB Bozen Bolzano Italy

Conceptual blending is a mental process that serves a variety of cognitive purposes, including human creativity. In this line of thinking, human creativity is modeled as a process that takes different mental spaces as input and combines them into a new mental space, called a blend. According to this form of combinational creativity, a blend is constructed by taking the commonalities among the input mental spaces into account, to form a so-called generic space, and by projecting the non-common structure of the input spaces in a selective way to the novel blended space. Since input spaces for interesting blends are often initially incompatible, a generalisation step is needed before they can be blended. In this paper, we apply this idea to blend input spaces specified in the description logic epsilon L++ and propose an upward refinement operator for generalising epsilon L-+(+) concepts. We show how the generalisation operator is translated to answer set programming (ASP) in order to implement a search process that finds possible generalisations of input concepts. The generalisations obtained by the ASP process are used in a conceptual blending algorithm that generates and evaluates possible combinations of blends. We exemplify our approach in the domain of computer icons.

关键词： Computational creativity Conceptual blending Description logic answer set programming

来源：评论

学校读者我要写书评

暂无评论

Towards closed world reasoning in dynamic open worlds

引用

THEORY AND PRACTICE OF LOGIC programming 2010年第4-6期10卷 547-563页

作者： Slota, Martin Leite, Joao Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Nova Lisboa Dept Informat P-2829516 Caparica Portugal

The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics for hybrid knowledge bases composed of both an ontology (expressed in a fragment of first-order logic) and nonmonotonic rules. These semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve. In this paper we take a first step towards addressing the dynamics of hybrid knowledge bases. We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine. Then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties. To the best of our knowledge, this is the first time that an update operator is proposed for hybrid knowledge bases.

关键词： belief change belief update hybrid knowledge bases ontologies rules description logics answer set programming semantic web

来源：评论

学校读者我要写书评

暂无评论

Causal Graph Justifications of Logic Programs

引用

THEORY AND PRACTICE OF LOGIC programming 2014年第4-5期14卷 603-618页

作者： Cabalar, Pedro Fandinno, Jorge Fink, Michael Univ A Coruna Dept Comp Sci Coruna Spain Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs formed by rule labels and edges that represent their application ordering. For positive programs, we show that the causal justifications obtained for a given atom have a direct correspondence to (relevant) syntactic proofs of that atom using the program rules involved in the graphs. The most interesting contribution is that this causal information is obtained in a purely semantic way, by algebraic operations (product, sum and application) on a lattice of causal values whose ordering relation expresses when a justification is stronger than another. Finally, for programs with negation, we define the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct. As a result, default negation behaves as "absence of proof" and no justification is derived from negative literals, something that turns out convenient for elaboration tolerance, as we explain with a running example.

关键词： answer set programming Causality Knowledge Representation Multi-valued Logic programming

来源：评论

学校读者我要写书评

暂无评论

A generalization of the Lin-Zhao theorem

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2006年第1-2期47卷 79-101页

作者： Ferraris, Paolo Lee, Joohyung Lifschitz, Vladimir Univ Texas Austin TX 78712 USA Arizona State Univ Tempe AZ USA

The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In this paper we simplify and generalize the statement of this theorem. The simplification is achieved by modifying the definition of a loop in such a way that a program is turned into the corresponding propositional formula by adding loop formulas directly to the conjunction of its rules, without the intermediate step of forming the program's completion. The generalization makes the idea of a loop formula applicable to stable models in the sense of a very general definition that covers disjunctive programs, programs with nested expressions, and more.

关键词： logic programming stable models answer set programming nonmonotonic reasoning Clark's completion loop formulas

来源：评论

学校读者我要写书评

暂无评论

Exploiting conjunctive queries in description logic programs

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2008年第1-4期53卷 115-152页

作者： Eiter, Thomas Ianni, Giovambattista Krennwallner, Thomas Schindlauer, Roman Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. The (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.

关键词： Hybrid rule languages Conjunctive queries and description logics answer set programming Semantic web

来源：评论

学校读者我要写书评

暂无评论

Centurio, a General Game Player: Parallel, Java-and ASP-based

引用

KUNSTLICHE INTELLIGENZ 2011年第1期25卷 17-24页

作者： Moeller, Maximilian Schneider, Marius Wegner, Martin Schaub, Torsten Univ Potsdam Inst Informat August Bebel Str 89 D-14482 Potsdam Germany

We present the General Game Playing system Centurio. Centurio is a Java-based player featuring different strategies based on Monte Carlo Tree Search extended by techniques borrowed from Upper Confidence bounds applied to Trees as well as answer set programming (for single-player games). Centurio's Monte Carlo Tree Search is accomplished in a massively parallel way by means of multi-threading as well as cluster-computing. Another major feature of Centurio is its compilation of game descriptions, states, and state manipulations into Java, yielding an edge over existing Prolog-based approaches. Centurio is open source software freely available via the web.

关键词： answer set programming General game playing Monte Carlo tree search Parallelization

来源：评论

学校读者我要写书评

暂无评论

Visual Data Analysis with Task-Based Recommendations

引用

DATA SCIENCE AND ENGINEERING 2022年第4期7卷 354-369页

作者： Shen, Leixian Shen, Enya Tai, Zhiwei Xu, Yihao Dong, Jiaxiang Wang, Jianmin Tsinghua Univ Beijing Peoples R China

General visualization recommendation systems typically make design decisions for the dataset automatically. However, most of them can only prune meaningless visualizations but fail to recommend targeted results. This paper contributes TaskVis, a task-oriented visualization recommendation system that allows users to select their tasks precisely on the interface. We first summarize a task base with 18 classical analytic tasks by a survey both in academia and industry. On this basis, we maintain a rule base, which extends empirical wisdom with our targeted modeling of the analytic tasks. Then, our rule-based approach enumerates all the candidate visualizations through answer set programming. After that, the generated charts can be ranked by four ranking schemes. Furthermore, we introduce a task-based combination recommendation strategy, leveraging a set of visualizations to give a brief view of the dataset collaboratively. Finally, we evaluate TaskVis through a series of use cases and a user study.

关键词： Visual data analysis Visualization recommendation Analytic task answer set programming

来源：评论

学校读者我要写书评

暂无评论

Computing weighted solutions in ASP: representation-based method vs. search-based method

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2011年第3-4期62卷 219-258页

作者： Cakmak, Duygu Erdem, Esra Erdogan, Halit Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

For some problems with too many solutions, one way to obtain the more desirable solutions is to assign each solution a weight that characterizes its importance quantitatively, and then compute the solutions whose weights are over (resp. below) a given threshold. This paper studies computing weighted solutions for a given computational problem, in the context of answer set programming (ASP). In particular, we investigate two sorts of methods for computing weighted solutions: one method suggests modifying the ASP representation of the problem to compute weighted solutions using an existing ASP solver and the other suggests modifying the search algorithm of the answer set solver to compute weighted solutions incrementally. The applicability of these methods are shown on two sorts of problems: reconstructing weighted phylogenies (for Indo-European languages and for Quercus species) and finding weighted plans (for Blocks World planning problems). In the experiments with the representation-based method, the answer set solver clasp is used and weight functions are represented in ASP. For the search-based method, the algorithm of clasp is modified (the modified solver is called CLASP-W) and weight functions are implemented in C++. For phylogenies, two weight functions are introduced by incorporating domain-specific information about groupings of species;one of them cannot be represented in ASP due to some mathematical functions not supported by the ASP solvers. For plans, we define a weight function that characterizes the total cost of executing actions in a plan. In these experiments the following are observed. With weight measures that can be represented in ASP, the search-based method outperforms the representation-based method in terms of computational efficiency (both time and space). With weight functions that cannot be represented in ASP, the search-based method provides a tool for computing weighted solutions in ASP. The search-based method can be applied to differe

关键词： Weighted solutions answer set programming Weighted phylogenies Weighted plans

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：