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

11th international Symposium on Foundations of Information and Knowledge Systems, FoIKS 2020

ISBN: (纸本)9783030399504

the proceedings contain 19 papers. the special focus in this conference is on Foundations of Information and Knowledge Systems. the topics include: Utilizing Deep Learning and RDF to Predict Heart Transplantation Survival;Game Description logic with Integers: A GDL Numerical Extension;craig Interpolation of Epistemic logics with Distributed Knowledge;on the Dynamics of Structured Argumentation: Modeling Changes in Default Justification logic;logic-Based Approach to Incremental Monitoring and Optimization on Strongly Distributed Data Streams;realisability of Choreographies;schema Optimisation Instead of (Local) Normalisation;strongly Minimal MapReduce Algorithms: A TeraSort Case Study;event Sequence Interpretation of Structural Geomodels: A Knowledge-Based Approach for Extracting Tectonic Sequences;normal Forms of Conditional Knowledge Bases Respecting Entailments and Renamings;on Matrices and K-Relations;social Consolidations: Rational Belief in a Many-Valued logic of Evidence and Peerhood;ASPARTIX-V19 - An Answer-Set programming Based System for Abstract Argumentation;proper Hierarchies in Polylogarithmic Time and Absence of Complete Problems;diversity, Dependence and Independence;towards Probabilistic reasoning in Type theory - the Intersection Type Case;measuring Inconsistency in a General Information Space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Systematic generalization with edge transformers 21

Systematic generalization with edge transformers

引用

Proceedings of the 35th international conference on Neural Information Processing Systems

作者： Leon Bergen Timothy J. O'Donnell Dzmitry Bahdanau University of California San Diego McGill University Quebec Artificial Intelligence Institute (Mila) Canada CIFAR AI Chair Element AI a ServiceNow company McGill University Quebec Artificial Intelligence Institute (Mila) Canada CIFAR AI Chair

ISBN: (纸本)9781713845393

Recent research suggests that systematic generalization in natural language understanding remains a challenge for state-of-the-art neural models such as Transformers and Graph Neural Networks. To tackle this challenge, we propose Edge Transformer, a new model that combines inspiration from Transformers and rule-based symbolic AI. the first key idea in Edge Transformers is to associate vector states with every edge, that is, with every pair of input nodes—as opposed to just every node, as it is done in the Transformer model. the second major innovation is a triangular attention mechanism that updates edge representations in a way that is inspired by unification from logic programming. We evaluate Edge Transformer on compositional generalization benchmarks in relational reasoning, semantic parsing, and dependency parsing1. In all three settings, the Edge Transformer outperforms Relation-aware, Universal and classical Transformer baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the Regularization of Small Sub-Constraint Satisfaction Problems 22nd

The Regularization of Small Sub-Constraint Satisfaction Prob...

引用

22nd international conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd Workshop on logic programming, WLP 2019, and the 27th Workshop on Functional and Constraint logic programming, WFLP 2019

作者： Löffler, Sven Liu, Ke Hofstedt, Petra Department of Mathematics and Computer Science MINT Programming Languages and Compiler Construction Group Brandenburg University of Technology Cottbus-Senftenberg Konrad-Wachsmann-Allee 5 Cottbus03044 Germany

ISBN: (纸本)9783030467135

this paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. the purpose of this approach is to reduce the number of fails in the resolution process, to improve the inferences made during search by the constraint solver by strengthening constraint propagation, and to maintain the level of propagation while reducing the cost of propagating the constraints. Our experimental results show improvements in terms of the resolution speed compared to the original CSPs and a competitiveness to the recent tabulation approach [1, 15]. Besides, our approach can be realized in a preprocessing step, and therefore wouldn’t collide with redundancy constraints or parallel computing if implemented. © 2020, Springer Nature Switzerland AG.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

An Argumentative Characterization of Disjunctive logic programming 19th

An Argumentative Characterization of Disjunctive Logic Progr...

引用

19th EPIA conference on artificial intelligence (EPIA)

作者： Heyninck, Jesse Arieli, Ofer Ruhr Univ Bochum Inst Philosophy 2 Bochum Germany Acad Coll Tel Aviv Sch Comp Sci Tel Aviv Israel

ISBN: (纸本)9783030302443;9783030302436

this paper extends the result of Caminada and Schulz [6,7] by showing that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs. For this, we incorporate a previous work of ours (see [19,20]), in which reasoning with assumption-based argumentation frameworks is based on certain core logics and the strict/defeasible assumptions may be arbitrary formulas in those logics. In our case, the core logic respects some inference rules for disjunction, which allows disjunctions in the heads of the programs' rules to be handled properly.

关键词： Knowledge representation and reasoning Non-monotonic reasoning Computational models of argument Disjunctive logic programming Structured argumentation

来源：评论

学校读者我要写书评

暂无评论

the Stable Model Semantics of Normal Fuzzy Linguistic logic Programs 11th

The Stable Model Semantics of Normal Fuzzy Linguistic Logic ...

引用

11th international conference on Computational Collective intelligence (ICCCI)

作者： Van Hung Le Hanoi Univ Min & Geol Fac Informat Technol Hanoi Vietnam

ISBN: (纸本)9783030283773;9783030283766

Fuzzy linguistic logic programming is a framework for representing and reasoning with linguistically-expressed human knowledge. It is well known that allowing the representation and the manipulation of negation is an important feature for many real-world applications. In this work, we extend the framework by allowing negation connectives to occur in rule bodies, resulting in normal fuzzy linguistic logic programs, and study the stable model semantics of such logic programs.

关键词： Fuzzy logic programming Stable model Hedge algebra

来源：评论

学校读者我要写书评

暂无评论

Tight Integration of Rule-Based Tools in Game Development 18th

Tight Integration of Rule-Based Tools in Game Development

引用

18th international conference of the Italian-Association-for-artificial-intelligence (AIIA)

作者： Angilica, Denise Ianni, Giovambattista Pacenza, Francesco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783030351663;9783030351656

In the wider perspective of narrowing down some of the gaps that prevent the adoption of declarative logic programming within highly dynamically changing environments, we focus in this paper on the context of integrating reasoning modules in real-time videogames. Integrating rule-based AI within the commercial game development life-cycle poses a number of unsolved challenges, each with non-obvious solution. For instance, it is necessary to cope with strict time performance requirements;the duality between procedural code and declarative specifications prevents easy integration;the concurrent execution of reasoning tasks and game updates requires proper information passing strategies between the two involved sides. In this work we illustrate our recent progress on how to embed rule-based reasoning modules into the well-known Unity game development engine. To this end, we report about thinkEngine, a framework in which a tight integration of declarative formalisms within the typical game development workflow is made possible. We prove the viability of our approach by developing a proof-of-concept Unity game that makes use of ASP-based AI modules.

关键词： Answer Set programming artificial intelligence Game programming Knowledge Representation and reasoning logic Programs Rule-based Systems Unity

来源：评论

学校读者我要写书评

暂无评论

EduBAI: An Educational Platform for logic-Based reasoning 15th

EduBAI: An Educational Platform for Logic-Based Reasoning

引用

15th IFIP WG 12.5 international conference on artificial intelligence Applications and Innovations, AIAI 2019

作者： Arampatzis, Dimitrios Doulgeraki, Maria Giannoulis, Michail Stefanidi, Evropi Patkos, theodore Institute of Computer Science FO.R.T.H. Heraklion Greece Computer Science Department University of Crete Heraklion Greece

ISBN: (纸本)9783030198220

the field of logic-based Knowledge Representation and reasoning has produced powerful formalisms for modeling commonsense knowledge in artificial intelligence. In this paper, we present EduBAI, an educational platform that helps users familiarize themselves with the main tenets of commonsense reasoning in dynamic, causal domains by means of an interactive entertaining environment. We present the design and implementation of the platform, along with the rationale of sample game tactics of diverse modeling complexity. © 2019, IFIP international Federation for Information Processing.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

MagnetDroid: security-oriented analysis for bridging privacy and law for Android applications 19

MagnetDroid: security-oriented analysis for bridging privacy...

引用

17th international conference on artificial intelligence and Law (ICAIL)

作者： Uliana, Emanuele Stathis, Kostas Jago, Robert Royal Holloway Univ London Dept Comp Sci London England Royal Holloway Univ London Sch Law London England

ISBN: (纸本)9781450367547

MagnetDroid is a novel artificial intelligence framework that integrates a security ontology, a multi-agent organisation, and a logical reasoning procedure to help build a bridge between the worlds of Android application analysis and law, with respect to privacy. Our contribution helps identify violations of the law by Android applications, as well as predict legal consequences. the resulting implementation of MagnetDroid can be useful to privacy-concerned users in order to acknowledge problems with the privacy of the applications they use, to application developers/publishers to help them identify which problems to fix, and to lawyers in order to provide an additional level of interpretation for any court when considering the privacy of Android applications.

关键词： Android Intelligent Agents Law logic programming Ontologies Privacy Security

来源：评论

学校读者我要写书评

暂无评论

Symbolic Analysis of Maude theories with Narval

引用

thEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 874-890页

作者： Alpuente, Maria Escobar, Santiago Sapina, Julia Ballis, Demis Univ Politecn Valencia VRAIN Valencian Res Inst Artificial Intelligence Valencia Spain Univ Udine DMIF Udine Italy

Concurrent functional languages that are endowed with symbolic reasoning capabilities such as Maude offer a high-level, elegant, and efficient approach to programming and analyzing complex, highly nondeterministic software systems. Maude's symbolic capabilities are based on equational unification and narrowing in rewrite theories, and provide Maude with advanced logic programming capabilities such as unification modulo user-definable equational theories and symbolic reachability analysis in rewrite theories. Intricate computing problems may be effectively and naturally solved in Maude thanks to the synergy of these recently developed symbolic capabilities and classical Maude features, such as: (i) rich type structures with sorts (types), subsorts, and overloading;(ii) equational rewriting modulo various combinations of axioms such as associativity, commutativity, and identity;and (iii) classical reachability analysis in rewrite theories. However, the combination of all of these features may hinder the understanding of Maude symbolic computations for non-experienced developers. the purpose of this article is to describe how programming and analysis of Maude rewrite theories can be made easier by providing a sophisticated graphical tool called Narval that supports the fine-grained inspection of Maude symbolic computations.

关键词： Symbolic reachability analysis narrowing equational unification Maude rewriting logic

来源：评论

学校读者我要写书评

暂无评论

Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal logic 28th

Operational Semantics and Program Verification Using Many-So...

引用

28th international conference on Automated reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Leustean, Ioana Moanga, Natalia Serbanuta, Traian Florin Univ Bucharest Fac Math & Comp Sci Str Academiei 14 Bucharest 010014 Romania

ISBN: (纸本)9783030290269;9783030290252

We propose a general framework to allow: (a) specifying the operational semantics of a programming language;and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal logic, for which we prove its completeness results. We believe that our approach to program verification improves over the existing approaches within modal logic as (1) it is based on operational semantics which enables a more natural description of the execution than Hoare-style weakest precondition used by dynamic logic;(2) since it is multi-sorted, it allows for a clearer encoding of semantics, with a smaller representational distance to its intended meaning.

关键词： Operational semantics Program verification Hybrid modal logic Many sorted logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：