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

1st World Conference on Explainable Artificial Intelligence (XAI)

作者： State, Laura Ruggieri, Salvatore Turini, Franco Univ Pisa Pisa Italy Scuola Normale Super Pisa Pisa Italy

ISBN: (纸本)9783031440632;9783031440649

Many high-performing machine learning models are not interpretable. As they are increasingly used in decision scenarios that can critically affect individuals, it is necessary to develop tools to better understand their outputs. Popular explanation methods include contrastive explanations. However, they suffer several shortcomings, among others an insufficient incorporation of background knowledge, and a lack of interactivity. While (dialogue-like) interactivity is important to better communicate an explanation, background knowledge has the potential to significantly improve their quality, e.g., by adapting the explanation to the needs of the end-user. To close this gap, we present reasonx, an explanation tool based on constraint logic programming (CLP). reasonx provides interactive contrastive explanations that can be augmented by background knowledge, and allows to operate under a setting of under-specified information, leading to increased flexibility in the provided explanations. reasonx computes factual and contrastive decision rules, as well as closest contrastive examples. It provides explanations for decision trees, which can be the ML models under analysis, or global/local surrogate models of any ML model. While the core part of reasonx is built on CLP, we also provide a program layer that allows to compute the explanations via Python, making the tool accessible to a wider audience. We illustrate the capability of reasonx on a synthetic data set, and on a well-developed example in the credit domain. In both cases, we can show how reasonx can be flexibly used and tailored to the needs of the user.

关键词： explainable AI Contrastive Explanations Background Knowledge Interactivity constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Semi-dynamic demand in a non-permutation flowshop with constrained resequencing buffers

引用

6th International Conference on Large-Scale Scientific Computing (LSSC 2007)

作者： Faerber, Gerrit Salhi, Said Coves Moreno, Anna M. Univ Politecn Cataluna Inst Org Control Sistemes Ind Barcelona Spain Univ Kent Kent Business Sch Ctr Heurist Optimisat Canterbury Kent England

ISBN: (纸本)9783540788256

This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using constraint logic programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied.

关键词： semi-dynamic demand constraint logic programming genetic algorithm non-permutation flowshop mixed model assembly line

来源：评论

学校读者我要写书评

暂无评论

constraint-Based Test Case Generation for White-Box Method-Level Unit Testing

Constraint-Based Test Case Generation for White-Box Method-L...

引用

International Computer Symposium (ICS)

作者： Chang, Cheng-Hung Lin, Nai-Wei Natl Chung Cheng Univ Dept Comp Sci & Informat Engn Chiayi Taiwan

ISBN: (纸本)9781509034383

This paper introduces a unified constraint-based test case generator for white-box method-level unit testing. The derivation of a suite of test cases can be defined as a constraint satisfaction problem. Each test case consists of a test input and an expected output. The program is automatically transformed into a constraint model called constraint logic graph. The constraint logic graph is a succinct graphical representation of the system of constraints that defines the relationships between the test inputs and actual outputs. The suite of test inputs can be solved from the conjunction of constraints on each complete path of the constraint logic graph by a constraint logic programming language. The specification of a method is defined by the Object constraint Language. This non-executable specification is automatically transformed into an executable specification defined by a constraint logic programming language. This executable specification serves as the test oracle to automatically generate the corresponding expected output for a given test input.

关键词： test case generation white-box testing constraint-based testing constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Evolution of Region Connection Calculus to VRCC-3D+

引用

NEW MATHEMATICS AND NATURAL COMPUTATION 2014年第2期10卷 103-141页

作者： Sabharwal, Chaman L. Leopold, Jennifer L. Missouri Univ S&T Comp Sci Dept Rolla MO 65409 USA

Qualitative spatial reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not available. QSR theories have applications in areas such as geographic information systems, spatial databases, robotics, and cognitive sciences. The existing QSR theories have been applied primarily to 2D. The ability to perform QSR over a collection of 3D objects is desirable in many problem domains. Here we present the evolution (VRCC-3D+) of RCC-based QSR from 2D to both 3D (including occlusion support) and 4D (a temporal component). It is time consuming to construct large composition tables manually. We give a divideand- conquer algorithm to construct a comprehensive composition table from smaller constituent tables (which can be easily handcrafted). In addition to the logical consistency entailment checking that is required for such a system, clearly there is a need for a spatio-temporal component to account for spatial movements and path consistency (i.e. to consider only smooth transitions in spatial movements over time). Visually, these smooth movement phenomena are represented as a conceptual neighborhood graph. We believe that the methods presented herein to detect consistency, refine uncertainty, and enhance reasoning about 3D objects will provide useful guidelines for other studies in automated spatial reasoning.

关键词： Qualitative spatial reasoning region connection calculus composition smooth transition constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Model Transformation Method for Hybrid Approach 38th

Model Transformation Method for Hybrid Approach

引用

38th International Conference on Information Systems Architecture and Technology (ISAT)

作者： Sitek, Pawel Wikarek, Jaroslaw Stefanski, Tadeusz Kielce Univ Technol Inst Management & Control Syst Al 1000 Lecia PP 7 PL-25314 Kielce Poland

ISBN: (纸本)9783319672298;9783319672281

This paper presents a universal model transformation method for the problem which is represented in the form of facts. This method is the key element of the hybrid approach. In this approach, two environments of constraint logic programming (CLP) and mathematical programming (MP) were integrated and hybridized. Hybrid approach is very effective method for modeling and solving different kinds of decision and optimization problems in manufacturing, transportation, logistics etc. These problems are characterized by large numbers of integer variables and constraints, which build a large space of possible solutions. The model transformation method makes it possible to significantly reduce this space even before looking for a solution. The paper also presents an author's illustrative model for variant of CVRP (Capacity Vehicle Routing Problem) and many numerical experiments to test the model transformation method and evaluate its effectiveness when using a hybrid approach.

关键词： constraint logic programming Mathematical programming Hybrid methods CVRP

来源：评论

学校读者我要写书评

暂无评论

Refinement of a typed WAM extension by polymorphic order-sorted types

引用

Formal Aspects of Computing 1996年第5期8卷 539-564页

作者： Beierle, Christoph Börger, Egon Fachbereich Informatik Fern Universität Hagen Hagen Germany Dipartimento di Informatica Università di Pisa Pisa Italy Fachbereich Informatik LG Praktische Informatik VIII Fern Universität Hagen D-58084 Hagen Bahnhofstr. 48 Germany

We refine the mathematical specification of a WAM extension to type-constraint logic programming given in [BeB96]. We provide a full specification and correctness proof of the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic order-sorted unification as required by the logic programming language PROTOS-L, by refining the abstract type constraints used in [BeB96] to the polymorphic order-sorted types of PROTOS-L. This allows us to develop a detailed and mathematically precise account of the PAM's compiled type constraint representation and solving facilities, and to extend the correctness theorem to compilation on the fully specified PAM.

关键词： constraint logic programming Correctness proof Evolving algebras Order-sorted types Polymorphism Types WAM

来源：评论

学校读者我要写书评

暂无评论

CONTRACTIBILITY AND CONTRACTIBLE APPROXIMATIONS OF SOFT GLOBAL constraintS

CONTRACTIBILITY AND CONTRACTIBLE APPROXIMATIONS OF SOFT GLOB...

引用

26th International Conference on logic programming (ICLP)

作者： Maher, Michael J. Univ New South Wales NICTA Locked Bag 6016 Sydney NSW 1466 Australia Univ New South Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

ISBN: (纸本)9783939897170

We study contractibility and its approximation for two very general classes of soft global constraints. We introduce a general formulation of decomposition-based soft constraints and provide a sufficient condition for contractibility and an approach to approximation. For edit-based soft constraints, we establish that the tightest contractible approximation cannot be expressed in edit-based terms, in general.

关键词： constraint logic programming global constraints open constraints soft constraints

来源：评论

学校读者我要写书评

暂无评论

Abstract verification and debugging of constraint logic programs 1

引用

Joint ERCIM/CologNet International Workshop on constraint Solving and constraint logic programming

作者： Hermenegildo, M Puebla, G Bueno, F López-García, P Tech Univ Madrid UPM Dept Comp Sci Madrid Spain

ISBN: (数字)9783540366072

ISBN: (纸本)3540009868

The technique of Abstract Interpretation [13] has allowed the development of sophisticated program analyses which are provably correct and practical. The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program verification and debugging [3],[10],[7].

关键词： global analysis debugging verification constraint logic programming optimization parallelization abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

An architecture based on constraints for augmented shared workspaces 14

An architecture based on constraints for augmented shared wo...

引用

14th Brazilian Symposium on Computer Graphics and Image Processing

作者： Forster, CHQ Tozzi, CL Univ Estadual Campinas FEEC Sch Elect & Comp Engn DCADept Comp Engn & Ind Automat BR-13083970 Campinas SP Brazil

ISBN: (纸本)0769513301

Augmented shared workspaces are an instance of augmented reality which move the collaborative work from the desktop to the real workplace, enabling higher interaction level with coworkers and allowing implementation of advanced techniques of human-machine interfaces. In this paper, we advocate the employment of a constraint system as the document model (or program) for the implementation of augmented reality applications. We show that constraint technology is synergistic with augmented reality and collaborative work in many aspects. An architecture model based on agents and constraints is then proposed. Our point of view is supported by the observation of this technology being employed in Computer Graphics and Human-Computer Interaction research and the implementation of typical cases.

关键词： augmented reality constraint systems constraint logic programming shared workspaces CSCW multimedia document agent theory

来源：评论

学校读者我要写书评

暂无评论

Solving functional constraints by variable substitution

Solving functional constraints by variable substitution

引用

24th International Conference on logic programming (ICLP)

作者： Zhang, Yuanlin Yap, Roland H. C. Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA Natl Univ Singapore Sch Comp Singapore 117417 Singapore

Functional constraints and bi-functional constraints are an important constraint class in constraint programming (CP) systems, in particular for constraint logic programming (CLP) systems. CP systems with finite domain constraints usually employ constraint Satisfaction Problem(s)-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other nonfunctional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

关键词： constraint logic programming constraint satisfaction problem Functional constraints Variable substitution Arc consistency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：