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

21st International Conference on Artificial Intelligence in Education (AIED)

作者： Park, Kyungjin Mott, Bradford Min, Wookhee Wiebe, Eric Boyer, Kristy Elizabeth Lester, James North Carolina State Univ Raleigh NC 27606 USA Univ Florida Gainesville FL 32601 USA

ISBN: (纸本)9783030522407;9783030522391

Game-based learning environments hold significant potential for supporting K-12 computer science (CS) education by providing CS learning experiences embedded within engaging virtual worlds. However, many gamebased learning environments do not adaptively support individual students based on their specific knowledge and skills. Often, this is because creating game levels is highly labor-intensive, which limits the number of levels created to support student learning. Procedural content generation (PCG) is a promising direction for addressing this challenge by dynamically creating game levels that address specific student needs without requiring extensive development effort. In this paper, we investigate a PCG framework driven by answer set programming (ASP), a variant of logic programming that utilizes well-formed logical rules to express constraints for valid game levels. We demonstrate how variations in CS learning objectives and game-playing skills can be incorporated into ASP-based rules to generate learner-adaptive levels in a middle-grades CS game-based learning environment. Evaluations of the generated levels suggest that the ASP-based level generator not only reliably generates desired CS educational game levels but also synthesizes a large set of diverse game levels. The findings suggest that the ASP-based PCG approach has considerable promise for creating highly engaging and adaptive game-based learning experiences for K-12 CS education.

关键词： K-12 computer science education Game-based learning Procedural content generation answer set programming

来源：评论

学校读者我要写书评

暂无评论

A declarative approach to distributed computing: Specification, execution and analysis

引用

THEORY AND PRACTICE OF LOGIC programming 2013年第4-5期13卷 815-830页

作者： Ma, Jiefei Le, Franck Wood, David Russo, Alessandra Lobo, Jorge Imperial Coll London London England IBM Corp Waston Lab Armonk NY 10504 USA ICREA Univ Pompeu Fabra Barcelona Spain

There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions;(ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages;and (iii) analysed using existing results on connecting causal theories and answer set programming. Results on the application of our approach to different classes of network protocols are also presented.

关键词： action theory answer set programming network protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

The Significance of Memory Costs in answer set Solver Implementation

引用

JOURNAL OF LOGIC AND COMPUTATION 2009年第4期19卷 615-641页

作者： Brain, Martin De Vos, Marina Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

Implementation costs linked to processor memory subsystems (cache miss costs, stalls due to bandwidth limits, etc.) have been shown to be a factor in the performance of a variety of declarative programming tools. This article investigates their impact on answer set solvers and the factors that control them. Experiments independently altering the size and difficulty of input programs allow a qualitative assessment of whether input program or solver design is a greater factor and a quantitative assessment of how much of problem these issues create.A variety of processor performance metrics are recorded and used to provide a detailed picture of what limits solver performance and dispel a number of common *** demonstrate the degree to which these problems can be addressed, smodels-ie is presented. This is a version of the smodels solver with a number of implementation changes to improve cache utilisation, one major aspect of memory costs.

关键词： answer set solvers answer set programming cache utilization optimization of memory bound programs declarative programming systems

来源：评论

学校读者我要写书评

暂无评论

Minimal logic programs

引用

23rd International Conference on Logic programming (ICLP)

作者： Cabalar, Pedro Pearce, David Valverde, Agustin Corunna Univ Coruna Spain Univ Rey Juan Carlos Madrid Spain Univ Malaga Malaga Spain

ISBN: (纸本)9783540746089

We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a method consisting in the generation of the set of prime implicates of the original theory, starting from its set of countermodels (in the logic of Here- and-There), in a similar vein to the Quine-McCluskey method for minimisation of boolean functions. As a side result, we also provide several results about fundamental rules (those that are not tautologies and do not contain redundant literals) which are combined to build the minimal programs. In particular, we characterise their form, their corresponding sets of countermodels, as well as necessary and sufficient conditions for entailment and equivalence among them.

关键词： logic programming answer set programming minimisation of boolean and multivalued functions

来源：评论

学校读者我要写书评

暂无评论

Preliminary Result on Finding Treatments for Patients with Comorbidity 1

引用

6th International Workshop on Knowledge Representation for Heath Care (KR4HC)

作者： Zhang, Yuanlin Zhang, Zhizheng Texas Tech Univ Lubbock TX 79409 USA Southeast Univ Nanjing Jiangsu Peoples R China

ISBN: (数字)9783319132815

ISBN: (纸本)9783319132815;9783319132808

According to some research, comorbidity is reported in 35 to 80% of all ill people [1]. Multiple guidelines are needed for patients with comorbid diseases. However, it is still a challenging problem to automate the application of multiple guidelines to patients because of redundancy, contraindicated, potentially discordant recommendations. In this paper, we propose a mathematical model for the problem. It formalizes and generalizes a recent approach proposed by Wilk and colleagues. We also demonstrate that our model can be encoded, in a straightforward and simple manner, in answer set programming ( ASP) - a class of Knowledge Representation languages. Our preliminary experiment also shows our ASP based implementation is efficient enough to process the examples used in the literature.

关键词： answer set programming Clinical practice guidelines Knowledge representation Comorbidity

来源：评论

学校读者我要写书评

暂无评论

A Novel Model for System-Level Decision Making with Combined ASP and SMT Solving

A Novel Model for System-Level Decision Making with Combined...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Biewer, Alexander Gladigau, Jens Haubelt, Christian Robert Bosch GmbH Corp Sect Res Stuttgart Germany Univ Rostock Appl Microelect & Comp Engn D-18055 Rostock Germany

ISBN: (纸本)9783981537024

In this paper, we present a novel model enabling system-level decision making for time-triggered many-core architectures in automotive systems. The proposed application model includes shared data entities that need to be bound to memories during decision making. As a key enabler to our approach, we explicitly separate computation and shared memory communication over a network-on-chip (NoC). To deal with contention on a NoC, we model the necessary basis to implement a time-triggered schedule that guarantees freedom of interference. We compute fundamental design decisions, namely (a) spatial binding, (b) multi-hop routing, and (c) time-triggered scheduling, by a novel coupling of answer set programming (ASP) with satisfiability modulo theories (SMT) solvers. First results of an automotive case study demonstrate the applicability of our method for complex real-world applications.

关键词： automotive electronics computability decision making integrated circuit design interference logic programming network-on-chip ASP solving NoC SMT solving answer set programming automotive system interference multihop routing network-on-chip satisfiability modulo theory shared data entity shared memory communication spatial binding system-level decision making time-triggered many-core architecture time-triggered scheduling Automotive engineering Computational modeling Decision making Routing Runtime Schedules Tiles

来源：评论

学校读者我要写书评

暂无评论

Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language pBC 15th

Elaboration Tolerant Representation of Markov Decision Proce...

引用

15th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Wang, Yi Lee, Joohyung Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA

ISBN: (纸本)9783030205287;9783030205270

We extend probabilistic action language pBC+ with the notion of utility in decision theory. The semantics of the extended pBC+ can be defined as a shorthand notation for a decision-theoretic extension of the probabilistic answer set programming language LPMLN. Alternatively, the semantics of pBC+ can also be defined in terms of Markov Decision Process (MDP), which in turn allows for representing MDP in a succinct and elaboration tolerant way as well as leveraging an MDP solver to compute a pBC+ action description. The idea led to the design of the system PBCPLUS2MDP, which can find an optimal policy of a pBC+ action description using an MDP solver.

关键词： answer set programming Action language Markov Decision Process

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning System to Improve the Performance of ASP Solving Based on Encoding Selection 16th

A Machine Learning System to Improve the Performance of ASP ...

引用

16th International Conference on Logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Liu, Liu Truszczynski, Mirek Lierler, Yuliya Univ Kentucky Lexington KY 40506 USA Univ Nebraska Omaha NE 68182 USA

ISBN: (纸本)9783031157073;9783031157066

answer set programming (ASP) has long been used for modeling and solving hard search problems. Experience shows that the performance of ASP tools on different ASP encodings of the same problem may vary greatly from instance to instance and it is rarely the case that one encoding outperforms all others. We describe a system and its implementation that given a set of encodings and a training set of instances, builds performance models for the encodings, predicts the execution time of these encodings on new instances, and uses these predictions to select an encoding for solving.

关键词： answer set programming encoding selection machine learning

来源：评论

学校读者我要写书评

暂无评论

Stable reasoning

引用

Journal of Applied Non-Classical Logics 2017年第3-4期27卷 238-254页

作者： Cabalar, Pedro Pearce, David Valverde, Agustín University of Corunna A Coruña Spain Universidad Politécnica de Madrid Madrid Spain Universidad de Málaga Málaga Spain

We give an account of stable reasoning, a recent and novel approach to problem solving from a formal, logical point of view. We describe the underlying logic of stable reasoning and illustrate how it is used to model different domains and solve practical reasoning problems. We discuss some of the main differences with respect to reasoning in classical logic and we examine an ongoing research programme for the rational reconstruction of human knowledge that may be considered a successor to the logical empiricists’ programme of the mid-twentieth century. © 2018 Informa UK Limited, trading as Taylor & Francis Group.

关键词： answer set programming Computational logic philosophy of logic stable reasoning

来源：评论

学校读者我要写书评

暂无评论

Adjudication of Coreference Annotations via answer set Optimization 14th

Adjudication of Coreference Annotations via Answer Set Optim...

引用

14th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Schuller, Peter Marmara Univ Fac Engn Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9783319616605;9783319616599

We describe the first automatic approach for merging coreference annotations obtained from multiple annotators into a single gold standard. Merging is subject to hard constraints (consistency) and optimization criteria (minimal divergence from annotators) and involves an equivalence relation over a large number of elements. We describe two representations of the problem in answer set programming and four objective functions suitable for the task. We provide two structurally different real-world benchmark datasets based on the METU-Sabanci Turkish Treebank, and we report our experiences in using the Gringo, Clasp, and Wasp tools for computing optimal adjudication results on these datasets.

关键词： Coreference resolution Adjudication answer set programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：