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

35th international conference on logic programming (ICLP)

作者： Medina, Jose Luis Vilchis Siegel, Pierre Risch, Vincent Doncescu, Andrei Univ Toulon & Var Aix Marseille Univ CNRS LIS Marseille France CNRS LAAS Toulouse France

In this article we present an implementation of nonmonotonic reasoning in an embedded system. As a part of an autonomous motor-glider, it simulates piloting decisions of an airplane. A real pilot must take care not only about the information arising from the cockpit (airspeed, altitude, variometer, compass... ) but also from outside the cabin. throughout a flight, a pilot is constantly in communi-cation with the control tower to follow orders, because there is an airspace regulation to respect. In addition, if the control tower sends orders while the pilot has an emergency, he may have to violate these orders and airspace regulations to solve his problem (e.g. emergency landing). On the other hand, climate changes constantly (wind, snow, hail...) and can affect the sensors. All these cases easily lead to contradictions. Switching to reasoning under uncertainty, a pilot must make decisions to carry out a flight. the objective of this implementation is to validate a nonmonotonic model which allows to solve the question of incomplete and contradictory information. We formalize the problem using default logic, a nonmonotonic logic which allows to find fixed-points in the face of contradic-tions. For the implementation, the Prolog language is used in an embedded computer running at 1 GHz single core with 512 Mb of RAM and 0.8 watts of energy consumption.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Infinets: the Parallel Syntax for non-wellfounded Proof-theory 28th

Infinets: The Parallel Syntax for Non-wellfounded Proof-Theo...

引用

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

作者： De, Abhishek Saurin, Alexis Univ Paris IRIF Paris France Univ Paris CNRS IRIF Paris France

ISBN: (纸本)9783030290269;9783030290252

logics based on the mu-calculus are used to model inductive and coinductive reasoning and to verify reactive systems. A well-structured proof-theory is needed in order to apply such logics to the study of programming languages with (co)inductive data types and automated (co)inductive theorem proving. the traditional proof system suffers some defects, non-wellfounded (or infinitary) and circular proofs have been recognized as a valuable alternative, and significant progress have been made in this direction in recent years. Such proofs are nonwellfounded sequent derivations together with a global validity condition expressed in terms of progressing threads. the present paper investigates a discrepancy found in such proof systems, between the sequential nature of sequent proofs and the parallel structure of threads: various proof attempts may have the exact threading structure while differing in the order of inference rules applications. the paper introduces infinets, that are proof-nets for non-wellfounded proofs in the setting of multiplicative linear logic with least and greatest fixed-points (mu MLL infinity) and study their correctness and sequentialization.

关键词： Circular proofs non-wellfounded proofs Fixed points mu-calculus Linear logic Proof-nets Induction and coinduction

来源：评论

学校读者我要写书评

暂无评论

the Seventh Answer Set programming Competition: Design and Results

arXiv

引用

arXiv 2019年

作者： Gebser, Martin Maratea, Marco Ricca, Francesco Institute for Computer Science University of Potsdam Germany DIBRIS University of Genova Italy Dipartimento di Matematica e Informatica Università della Calabria Italy

Answer Set programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th international conference on logic programming and non-monotonic reasoning (LPNMR 2017). (Under consideration foracceptance in TPLP). Copyright © 2019, the Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

17th international conference on Computational Methods in Systems Biology, CMSB 2019

17th International Conference on Computational Methods in Sy...

引用

17th international conference on Computational Methods in Systems Biology, CMSB 2019

ISBN: (纸本)9783030313036

the proceedings contain 32 papers. the special focus in this conference is on Computational Methods in Systems Biology. the topics include: Reachability Design through Approximate Bayesian Computation;fast Enumeration of non-isomorphic Chemical Reaction Networks;a Large-Scale Assessment of Exact Model Reduction in the BioModels Repository;computing Difference Abstractions of Metabolic Networks Under Kinetic Constraints;BRE:IN - A Backend for reasoning About Interaction Networks with Temporal logic;the Kappa Simulator Made Interactive;biochemical Reaction Networks with Fuzzy Kinetic Parameters in Snoopy;compartmental Modeling Software: A Fast, Discrete Stochastic Framework for Biochemical and Epidemiological Simulation;spike – Reproducible Simulation Experiments with Configuration File Branching;sequential Reprogramming of Biological Network Fate;KAMIStudio: An Environment for Biocuration of Cellular Signalling Knowledge;A New Version of DAISY to Test Structural Identifiability of Biological Models;semi-quantitative Abstraction and Analysis of Chemical Reaction Networks (Extended Abstract);bayesian Parameter Estimation for Stochastic Reaction Networks from Steady-State Observations;wasserstein Distances for Estimating Parameters in Stochastic Reaction Networks;on Inferring Reactions from Data Time Series by a Statistical Learning Greedy Heuristics;Barbaric Robustness Monitoring Revisited for STL* in Parasim;Symmetry Breaking for GATA-1/PU.1 Model;scalable Control of Asynchronous Boolean Networks;Transcriptional Response of SK-N-AS Cells to Methamidophos (Extended Abstract);control Variates for Stochastic Simulation of Chemical Reaction Networks;separators for Polynomial Dynamic Systems with Linear Complexity;bounding First Passage Times in Chemical Reaction Networks: Poster Abstract;data-Informed Parameter Synthesis for Population Markov Chains;effective Computational Methods for Hybrid Stochastic Gene Networks;designing Distributed Cell Classifier Circuits Using a G

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards a Unified Trust Framework for Detecting IoT Device Attacks in Smart Homes

Towards a Unified Trust Framework for Detecting IoT Device A...

引用

IEEE Internatonal conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Hussein Alsheakh Shameek Bhattacharjee Western Michigan University Kalamazoo Michigan USA

ISBN: (数字)9781728198668

ISBN: (纸本)9781728198675

Trust in Smart Home (SH) Internet of things (IoT) technologies is a primary concern for consumers, which is preventing the widespread adoption of smart home services. Additionally, the variety of IoT devices and cyber attacks make it hard to build a generic attack detection framework for smart home IoT devices. In this paper, we present a roadmap towards building a unified approach towards establishing trust scores as an indicator of the security status of an IoT device in a smart home that works across multiple attacks and device types/protocols. Specifically, we first introduce artificial reasoning inspired evidence collection approach by introducing a small set of factors that are affected significantly if a smart home IoT device is under attack. thereafter, we propose an explainable trust scoring model that maps the device level evidence into trust scores in a way that produces lower trust scores when devices are under attack. Specifically, the trust model involves an Augmented Bayesian Belief based Model embedded with novel non-linear weighing functions; explicitly designed to account for the severity of the attack, probabilistic discounting of parts of the evidence caused by benign changes, thus explaining our success. For evaluation of the framework, we use two real datasets that contain a variety of actual cyber-attacks and benign traffic from seven different smart home IoT devices. Our evaluation seeks to investigate the generality of our framework across multiple datasets, with various classes of IoT devices and cyber attacks.

关键词： conferences Smart homes Probabilistic logic Sensor systems Internet of things Security Cyberattack

来源：评论

学校读者我要写书评

暂无评论

17th conference of the Italian Association for Artificial Intelligence, AIIA 2018

17th Conference of the Italian Association for Artificial In...

引用

17th conference of the Italian Association for Artificial Intelligence, AI*IA 2018

ISBN: (纸本)9783030038397

the proceedings contain 41 papers. the special focus in this conference is on Italian Association for Artificial Intelligence. the topics include: On the Notion of Goal in Business Process Models;towards an Ontological Modelling of Preference Relations;a Generalized Framework for Ontology-Based Data Access;creative Concept Generation by Combining Description logic of Typicality, Probabilities and Cognitive Heuristics;a Comparative Study of Defeasible Argumentation and non-monotonic Fuzzy reasoning for Elderly Survival Prediction Using Biomarkers;compact Preference Representation via Fuzzy Constraints in Stable Matching Problems: theoretical and Experimental Studies;answer Set programming for Declarative Content Specification: A Scalable Partitioning-Based Approach;a Tableau Calculus for a Multi-modal logic of Dishonesty;goal Distribution in Business Process Models;timed Memory in Resource-Bounded Agents;a Tool for the Verification of Data-Aware Business Processes;exploring Abstract Argumentation-Based Approaches to Tackle Inconsistent Observations in Inductive logic programming;expectation Maximization in Deep Probabilistic logic programming;neural Random Access Machines Optimized by Differential Evolution;the Role of Coherence in Facial Expression Recognition;Extremely Randomized CNets for Multi-label Classification;bayesian Markov logic Networks: Bayesian Inference for Statistical Relational Learning;an Integration-Based Approach to Pattern Clustering and Classification;Top-Down Attention Recurrent VLAD Encoding for Action Recognition in Videos;neural Learning for Question Answering in Italian;an Information Model for Computing Accountabilities;detecting Inappropriate Comments to News;annotating Concept Abstractness by Common-Sense Knowledge;iterative Width Search for Multi Agent Privacy-Preserving Planning;operating Room Scheduling via Answer Set programming;a Goal Triggering Mechanism for Continuous Human-Robot Interaction;novelty-Aware Matrix Factorization Base

关键词：

来源：评论

学校读者我要写书评

暂无评论

Expectation Maximization in Deep Probabilistic logic programming 17th

Expectation Maximization in Deep Probabilistic Logic Program...

引用

17th international conference of the Italian-Association-for-Artificial-Intelligence (AI*IA)

作者： Fadja, Arnaud Nguembang Riguzzi, Fabrizio Lamma, Evelina Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy

ISBN: (纸本)9783030038403;9783030038397

Probabilistic logic programming (PLP) combines logic and probability for representing and reasoning over domains with uncertainty. Hierarchical probability logic programming (HPLP) is a recent language of PLP whose clauses are hierarchically organized forming a deep neural network or arithmetic circuit. Inference in HPLP is done by circuit evaluation and learning is therefore cheaper than any generic PLP language. We present in this paper an Expectation Maximization algorithm, called Expectation Maximization Parameter learning for HIerarchical Probabilistic logic programs (EMPHIL), for learning HPLP parameters. the algorithm converts an arithmetic circuit into a Bayesian network and performs the belief propagation algorithm over the corresponding factor graph.

关键词： Hierarchical probabilistic logic programming Arithmetic circuits Expectation Maximization Factor graph Belief propagation

来源：评论

学校读者我要写书评

暂无评论

A Modal and Relevance logic for Qualitative Spatial reasoning 17th

A Modal and Relevance Logic for Qualitative Spatial Reasonin...

引用

17th international conference on Relational and Algebraic Methods in Computer Science (RAMiCS)

作者： Ghosh, Pranab Kumar Winter, Michael Brock Univ Dept Comp Sci St Catharines ON Canada

ISBN: (纸本)9783030021498;9783030021481

Boolean contact algebras constitute a suitable algebraic theory for qualitative spatial reasoning. they are Boolean algebras with an additional contact relation grasping the topological aspect of spatial entities. In this paper we present a logic that combines propositional logic, relevance logic, and modal logic to reason about Boolean contact algebras. this is done in two steps. First, we use the relevance logic operators to obtain a logic suitable for Boolean algebras. then we add modal operators that are based on the contact relation. In both cases we present axioms that are equivalent to requirement that every frame for the logic is indeed a Boolean algebra resp. Boolean contact algebra. We also provide a natural deduction system for this logic by defining introduction and eliminations rules for each logical operator. the system is shown to be sound. Furthermore, we sketch an implementation of the natural deduction system in the functional programming language and interactive theorem prover Coq.

关键词： Boolean algebra

来源：评论

学校读者我要写书评

暂无评论

False Failure: Creating Failure Models for Separation logic 17th

False Failure: Creating Failure Models for Separation Logic

引用

17th international conference on Relational and Algebraic Methods in Computer Science (RAMiCS)

作者： Bannister, Callum Hoefner, Peter CSIRO Data61 Sydney NSW Australia Univ New South Wales Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9783030021498;9783030021481

Separation logic, an extension of Floyd-Hoare logic, finds countless applications in areas of program verification, but does not allow forward reasoning in the setting of total or generalised correctness. To support forward reasoning, separation logic needs to be equiped with a failure element. We present several ways on how to add such an element. We show that none of the 'obvious' extensions preserve all the algebraic properties desired. We develop more complicated models, satisfying the desired properties, and discuss their use for forward reasoning.

关键词： Separation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Rule Interpolation Toolbox for the GNU Open-Source OCTAVE

Fuzzy Rule Interpolation Toolbox for the GNU Open-Source OCT...

引用

international conference on Emerging eLearning Technologies and Applications (ICETA)

作者： Maen Alzubi Mohammad Almseidin Mohd Aaqib Lone Szilveszter Kovacs Department of Information Technology University of Miskolc Miskolc Hungary

ISBN: (数字)9781728149677

ISBN: (纸本)9781728149684

In most fuzzy control applications (applying classical fuzzy reasoning), the reasoning method requires a complete fuzzy rule-base, i.e all the possible observations must be covered by the antecedents of the fuzzy rules, which is not always available. Fuzzy control systems based on the Fuzzy Rule Interpolation (FRI) concept play a major role in different platforms, in case if only a sparse fuzzy rule-base is available. this cases the fuzzy model contains only the most relevant rules, without covering all the antecedent universes. the first FRI toolbox being able to handle different FRI methods was developed by Johanyak et. al. in 2006 for the MATLAB environment. the goal of this paper is to introduce some details of the adaptation of the FRI toolbox to support the GNU/OCTAVE programming language. the OCTAVE Fuzzy Rule Interpolation (OCTFRI) Toolbox is an open-source toolbox for OCTAVE programming language, providing a large functionally compatible subset of the MATLAB FRI toolbox as well as many extensions. the OCTFRI Toolbox includes functions that enable the user to evaluate Fuzzy Inference Systems (FISs) from the command line and from OCTAVE scripts, read/write FISs and OBS to/from files, and produce a graphical visualisation of both the membership functions and the FIS outputs. Future work will focus on implementing advanced fuzzy inference techniques and GUI tools.

关键词： Matlab Interpolation Fuzzy sets Fuzzy logic Computer languages Tools Open source software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：