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

7th International Joint Conference on Rules and Reasoning (RuleML+RR)

作者： Lisi, Francesca Alessandra Sterlicchio, Gioacchino Billard, David Univ Bari Aldo Moro DIB Bari Italy Univ Bari Aldo Moro CILA Bari Italy Polytech Univ Bari DMMM Bari Italy Univ Appl Sci Geneva Geneva Switzerland

ISBN: (纸本)9783031450716;9783031450723

In this short paper, we briefly describe the application of a declarative AI approach to a case study concerning the analysis of real-world phone recordings. In particular, we summarize the general results obtained for a couple of mining tasks, one being sequential pattern mining and the other contrast pattern mining, reformulated within the framework of answer set programming.

关键词： Declarative Pattern Mining Digital Forensics answer set programming

来源：评论

学校读者我要写书评

暂无评论

Design Technology for Fault-Free and Maximally-Parallel Wavelength-Routed Optical Networks-on-Chip 35

Design Technology for Fault-Free and Maximally-Parallel Wave...

引用

35th IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

作者： Peano, Andrea Ramini, Luca Gavanelli, Marco Nonato, Maddalena Bertozzi, Davide Univ Ferrara Via Saragat 1 I-44121 Ferrara Italy

ISBN: (纸本)9781450344661

The recent interest in emerging interconnect technologies is bringing the issue of a proper EDA support for them to the forefront, so to tackle the design complexity. A relevant case study is provided by wavelength-routed optical NoCs (WRONoCs), which add communication performance guarantees to the typical latency, throughput and power benefits of an optical link, thus providing an appealing technology for the photonic integration of high-end embedded systems. Typically, only abstract WRONoC models are considered to figure out architecture-level performance, and logic connectivity patterns for the quantification of the required signal strength (i.e., static power). However, this design practice overlooks the needed refinement step, where key physical parameters are assigned such as wavelengths of the optical channels, and size of the optical filters. This step is unfortunately not decoupled from the architectural evaluation, since its main constraint (i.e., avoiding routing faults) turns out to be a key limiter for both the network scale and the achievable communication parallelism. By proposing a formal methodology to selectWRONoC parameters while avoding the routing fault concern, this paper aims at maximizing the levels of connectivity and/or of bit parallelism that WRONoCs can achieve, while relating their upper bounds to the uncertainty of the manufacturing process.

关键词： answer set programming parallelism WRONoC

来源：评论

学校读者我要写书评

暂无评论

Applying Incremental answer set Solving to Product Configuration 22

Applying Incremental Answer Set Solving to Product Configura...

引用

26th ACM International Systems and Software Product Line Conference (SPLC)

作者： Comploi-Taupe, Richard Francescutto, Giulia Schenner, Gottfried Siemens AG Osterreich Vienna Austria

ISBN: (纸本)9781450392068

In this paper, we apply incremental answer set solving to product configuration. Incremental answer set solving is a step-wise incremental approach to answer set programming (ASP). We demonstrate how to use this technique to solve product configurations problems incrementally. Every step of the incremental solving process corresponds to a predefined configuration action. Using complex domain-specific configuration actions makes it possible to tightly control the level of non-determinism and performance of the solving process. We show applications of this technique for reasoning about product configuration, like simulating the behavior of a deterministic configuration algorithm and describing user actions.

关键词： product configuration answer set programming incremental solving

来源：评论

学校读者我要写书评

暂无评论

Polynomial Formal Verification of Multi-Valued Logic Circuits within Constant Cutwidth Architectures 54

Polynomial Formal Verification of Multi-Valued Logic Circuit...

引用

54th IEEE International Symposium on Multiple-Valued Logic (ISMVL)

作者： Nadeem, Mohamed Drechsler, Rolf Univ Bremen Bremen Germany DFKI Bremen Germany

ISBN: (纸本)9798350343090;9798350343083

Formal verification is essential for circuit correctness. Extending binary logic verification to Multi-Valued Logic (MVL) presents challenges due to encoding challenges. answer set programming (ASP) enables compact MVL circuit encoding. In this paper, we propose a Polynomial Formal Verification (PFV) approach for MVL circuits with a constant cutwidth. It employs a divide-and-conquer algorithm to decompose circuits into subcircuits, each representing an output, where ASP is used to encode and verify the subcircuits. The approach reduces verification complexity to the circuit's cutwidth, independent of input bitwidth, ensuring linear time verification for circuits with constant cutwidth. We validate our approach using adder architectures, as many adder architectures have a constant cutwidth. Empirical experiments involve various adder architectures and different logic levels.

关键词： Polynomial Formal Verification Logic Synthesis Multi-Valued Logic answer set programming Cutwidth

来源：评论

学校读者我要写书评

暂无评论

Design Space Descriptions for Logical Generation of Content 8

Design Space Descriptions for Logical Generation of Content

引用

8th European Starting AI Researcher Symposium (STAIRS)

作者： Smith, Thomas Padget, Julian Vidler, Andrew Univ Bath Ctr Digital Entertainment Bath BA2 7AY Avon England Ninja Theory Ltd Cambridge England

ISBN: (纸本)9781614996828;9781614996811

This paper describes our research-in-progress into providing content-agnostic procedural content generation for computer games via answer set programming and a formal semantic description of the design space. Existing generative approaches are often closely coupled to a particular form of content and/or game, limiting opportunities for re-use - a dungeon level generator in one game is substantially different to a sci-fi weapon generator in another. We propose an approach involving a re-usable generator system that is able to produce and refine a model of any structured content from formal desired properties produced by designers. As an intermediate step towards this system for multi-purpose content generation we present initial work on generating content within a commercial game engine, using answer set programming to generate varied and challenging combat progressions for third-person action/combat games. By using semantic models as input for a content-agnostic generation system, we hope to provide more domain-general content generation.

关键词： procedural content generation generative methods answer set programming video games

来源：评论

学校读者我要写书评

暂无评论

Rapid Prototyping of OpenCV Image Processing Applications using ASP

Rapid Prototyping of OpenCV Image Processing Applications us...

引用

22nd IEEE International Symposium on Rapid System Prototyping (RSP)

作者： Muehlbauer, Felix Grosshans, Michael Bobda, Christophe Univ Potsdam Chair Comp Engn Potsdam Germany Univ Arkansas CSCE Fayetteville AR 72701 USA

ISBN: (纸本)9781457706608

Image processing is becoming more and more present in our everyday life. With the requirements of miniaturization, low-power, performance in order to provide some intelligent processing directly into the camera, embedded camera will dominate the image processing landscape in the future. While the common approach of developing such embedded systems is to use sequentially operating processors, image processing algorithms are inherently parallel, thus hardware devices like FPGAs provide a perfect match to develop highly efficient systems. Unfortunately hardware development is more difficult and there are less experts available compared to software. Automatizing the design process will leverage the existing infrastructure, thus providing faster time to market and quick investigation of new algorithms. We exploit ASP (answer set programming) for system synthesis with the goal of genarating an optimal hardware software partitioning, a viable communication structure and the corresponding scheduling, from an image processing application.

关键词： Computer architecture Delay FPGA Hardware Image processing OpenCV image processing Program processors Resource management answer set programming embedded camera embedded systems field programmable gate arrays hardware software partitioning image processing rapid prototyping sequentially operating processors

来源：评论

学校读者我要写书评

暂无评论

Computing Strongly Admissible sets 8

Computing Strongly Admissible Sets

引用

Biennial International Conference on Computational Models of Argument (COMMA)

作者： Dvorak, Wolfgang Wallner, Johannes P. TU Wien Vienna Austria

ISBN: (纸本)9781643681078;9781643681061

In this work we revisit computational aspects of strongly admissible semantics in Dung's abstract argumentation frameworks. First, we complement the existing complexity analysis by focusing on the problem of computing strongly admissible sets of minimum size that contain a given argument and providing NP-hardness as well as hardness of approximation results. Based on these results, we then investigate two approaches to compute (minimum-sized) strongly admissible sets based on answer set programming (ASP) and Integer Linear programming (ILP), and provide an experimental comparison of their performance.

关键词： abstract argumentation strongly admissible computational complexity answer set programming integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns

引用

THEORY AND PRACTICE OF LOGIC programming 2016年第5-6期16卷 604-618页

作者： Chen, Zhuo Marple, Kyle Salazar, Elmer Gupta, Gopal Tamil, Lakshman Univ Texas Dallas Richardson TX 75083 USA

Management of chronic diseases such as chronic heart failure (CHF) is a major problem in health care. A standard approach followed by the medical community is to have a committee of experts develop guidelines that all physicians should follow. These guidelines typically consist of a series of complex rules that make recommendations based on a patient's information. Due to their complexity, often the guidelines are ignored or not complied with at all. It is not even clear whether it is humanly possible to follow these guidelines due to their length and complexity. For instance, for CHF, the guidelines run nearly eighty pages. In this paper we describe a physician-advisory system for CHF management that codes the entire set of clinical practice guidelines for CHF using answer set programming (ASP). Our approach is based on developing reasoning templates, that we call knowledge patterns, and using them to systemically code the clinical guidelines for CHF as ASP rules. Use of the knowledge patterns greatly facilitates the development of our system. Given a patient's medical information, our system generates a recommendation for treatment just as a human physician would, using the guidelines. Our system works even in the presence of incomplete information.

关键词： chronic disease management knowledge pattern answer set programming knowledge representation automated reasoning

来源：评论

学校读者我要写书评

暂无评论

Non-Automata Based Conformance Checking of Declarative Process Specifications Based on ASP

Non-Automata Based Conformance Checking of Declarative Proce...

引用

21st International Conference on Business Process Management (BPM)

作者： Kuhlmann, Isabelle Corea, Carl Grant, John Univ Hagen Artificial Intelligence Grp Hagen Germany Univ Koblenz Inst IS Res Koblenz Germany Univ Maryland Dept Comp Sci College Pk MD USA Univ Maryland UMIACS College Pk MD USA

ISBN: (纸本)9783031509735;9783031509742

We investigate the use of answer set programming (ASP) for the problem of conformance checking of LTL-based Declarative Process Specifications. In particular, we propose ASP solutions that are independent of automata. That is: in related works, the semantics of the declarative process specifications are often captured by means of finite state automata. This means that for conformance checking, the constraints of the specification first have to be transformed into a corresponding automata representation, which introduces a computational burden. In this work, we present a new ASP-based approach which encodes the constraint semantics directly and therefore can be used to check conformance without the need of performing automata operations. We implement our approach and perform experiments with reallife datasets, comparing our approach to a selection of state-of-the-art approaches. Our experiments show that our approach can outperform existing approaches in some cases. Furthermore, our approach can easily be extended to check whether the considered constraint sets are satisfiable (i.e., consistent).

关键词： Conformance Checking Declarative Process Specifications answer set programming

来源：评论

学校读者我要写书评

暂无评论

What if no hybrid reasoner is available? Hybrid MKNF in multi-context systems

引用

JOURNAL OF LOGIC AND COMPUTATION 2014年第6期24卷 1279-1311页

作者： Knorr, Matthias Slota, Martin Leite, Joao Homola, Martin Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Nova Lisboa Dept Informat P-2829516 Caparica Portugal Comenius Univ Fac Math Phys & Informat Bratislava 84248 Slovakia

In open environments, agents need to reason with knowledge from various sources, represented in different languages. Multi-Context Systems (MCSs) allow for the integration of knowledge from different heterogeneous sources in an effective and modular way. Whereas most knowledge bases (contexts) typically considered within an MCS are written in some description logic or some non-monotonic rule-based language, sometimes more expressive languages that combine the features of both these paradigms are necessary, such as Hybrid MKNF. However, since agents may not have access to specialized reasoners for contexts using all these languages, it proves useful to have tools that equivalently simplify or transform a given MCS into another MCS that only uses the reasoners that are available. In this article, we thoroughly investigate the relation between MCSs and Hybrid MKNF. We provide a number of transformations that show that Hybrid MKNF knowledge bases can be embedded into MCSs without the need for specific MKNF reasoners. To complete the picture, we also show that when an MKNF reasoner is available, it can be used to handle several description logic and rule contexts joined into a single MKNF context. Furthermore, we show that we can encapsulate the non-monotonic transfer of information between different contexts in one rule language context, allowing e.g. the use of external non-monotonic reasoners.

关键词： Multi-context systems MKNF knowledge bases answer set programming logic programming description logics knowledge representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：