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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

10 篇 会议
1 篇 期刊文献

馆藏范围

11 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

8 篇 工学
- 7 篇 计算机科学与技术...
- 5 篇 软件工程
- 2 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 航空宇航科学与技...
4 篇 理学
- 4 篇 数学
- 2 篇 统计学（可授理学、...
1 篇 教育学
- 1 篇 教育学
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

2 篇 probabilistic lo...
1 篇 formal logic
1 篇 dynamic logic
1 篇 model checking
1 篇 logic programmin...
1 篇 markov decision ...
1 篇 quantum logic
1 篇 semantics
1 篇 quantum programm...
1 篇 spacecraft auton...
1 篇 probabilistic co...

机构

2 篇 open university ...
1 篇 cyber reconnaiss...
1 篇 univ sannio dept...
1 篇 univ brasilia de...
1 篇 dipartimento di ...
1 篇 dipartimento di ...
1 篇 jukedeck ltd. un...
1 篇 radboud universi...
1 篇 compagnia genera...
1 篇 dipartimento di ...
1 篇 inesc tec high a...
1 篇 univ brasilia de...
1 篇 dipartimento di ...

作者

2 篇 hommersom arjen
2 篇 bellodi elena
2 篇 lamma evelina
1 篇 ferreira ramos t...
1 篇 nardone vittoria
1 篇 simari gerardo i...
1 篇 ciampolini anna
1 篇 loreti daniela
1 篇 cota giuseppe
1 篇 bueno marcos l.p...
1 篇 riguzzi fabrizio
1 篇 ayala-rincon mau...
1 篇 simari guillermo...
1 篇 tipaldi massimo
1 篇 chesani federico
1 篇 santone antonell...
1 篇 zese riccardo
1 篇 alberti marco
1 篇 almeida ariane a...
1 篇 shakarian paulo

语言

11 篇 英文

检索条件"任意字段=3rd International Workshop on Probabilistic Logic Programming, PLP 2016"

共 11 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

CEUR workshop Proceedings

CEUR Workshop Proceedings

引用

3rd international workshop on probabilistic logic programming, plp 2016

The proceedings contain 5 papers. The topics discussed include: the structure and complexity of credal semantics;probabilistic constraint logic theories;toward computing conflict-based diagnoses in probabilistic logic programming;sampling random bioinformatics puzzles using adaptive probability distributions;and notes on the implementation of FAM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Toward computing conflict-based diagnoses in probabilistic logic programming 3

Toward computing conflict-based diagnoses in probabilistic l...

引用

3rd international workshop on probabilistic logic programming, plp 2016

作者： Hommersom, Arjen Bueno, Marcos L.P. Open University of the Netherlands Netherlands Radboud University Nijmegen Netherlands

Consistency-based diagnosis is a well-known theory of diagnosis using main knowledge of the normal structure and behaviour of a system. Central in this theory is the notion of a conflict, which describes the relationship between the knowledge of the system and observations. In literature, at least two notions of a conflict have been proposed: (1) based on logical inconsistencies of the observations w.r.t. the system and (2) based on a probabilistic conflict measure. probabilistic logic programming languages combine probabilities with logic, so this raises the question to which extent these two notions coincide. In this paper, we consider consistency-based diagnosis in ProbLog and discuss some preliminary results on the relationship between logical consistency and the probabilistic conflict measure. © 2016, CEUR-WS. All rights reserved.

关键词： probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

probabilistic constraint logic theories 3

Probabilistic constraint logic theories

引用

3rd international workshop on probabilistic logic programming, plp 2016

作者： Alberti, Marco Bellodi, Elena Cota, Giuseppe Lamma, Evelina Riguzzi, Fabrizio Zese, Riccardo Dipartimento di Matematica e Informatica - University of Ferrara Via Saragat 1 FerraraI-44122 Italy Dipartimento di Ingegneria - University of Ferrara Via Saragat 1 FerraraI-44122 Italy

probabilistic logic models are used ever more often to deal with the uncertain relations typical of the real world. However, these models usually require expensive inference procedures. Very recently the problem of identifying tractable languages has come to the fore. In this paper we consider the models used by the learning from interpretations ILP setting, namely sets of integrity constraints, and propose a probabilistic version of them. A semantics in the style of the distribution semantics is adopted, where each integrity constraint is annotated with a probability. These probabilistic constraint logic models assign a probability of being positive to interpretations. This probability can be computed in a time that is logarithmic in the number of ground instantiations of violated constraints. This formalism can be used as the target language in learning systems and for declaratively specifying the behavior of a system. In the latter case, inference corresponds to computing the probability of compliance of a system's behavior to the model. © 2016, CEUR-WS. All rights reserved.

关键词： probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

A Dynamic logic for QASM Programs 2nd

A Dynamic Logic for QASM Programs

引用

2nd international workshop on Dynamic logic (DaLi) as part of the Formal Methods Week / 3rd World Congress on Formal Methods

作者： Tavares, Carlos INESC TEC High Assurance Software Lab Braga Portugal

We define a dynamic logic for QASM (Quantum Assembly) programming language, a language that requires the handling of quantum and probabilistic information. We provide a syntax and a model to this logic, providing a pr... 详细信息

ISBN: (纸本)9783030388089;9783030388072

关键词： Quantum logic Quantum programming Dynamic logic

来源：评论

学校读者我要写书评

暂无评论

CEUR workshop Proceedings: Preface

引用

CEUR workshop Proceedings 2016年 1661卷

作者： Hommersom, Arjen Abdallah, Samer Open University of the Netherlands Netherlands Jukedeck Ltd. London United Kingdom

来源：评论

学校读者我要写书评

暂无评论

Software Technologies: Applications and Foundations, STAF 2016 Collocated workshops: 5th international Symposium on Data to Models and Back, DataMod 2016, 7th international workshop on Graph Computation Models, GCM 2016, 3rd international workshop on Human-Oriented Formal Methods, HOFM 2016, 2nd international workshop on Model-Driven Engineering, logic and Optimization, MELO 2016, 3rd international workshop on Software Engineering Methods in Spreadsheets, SEMS 2016 and 1st international workshop on Formal to Practical Software Verification and Composition, VeryComp 2016

Software Technologies: Applications and Foundations, STAF 20...

引用

Software Technologies: Applications and Foundations, STAF 2016 Collocated workshops: 5th international Symposium on Data to Models and Back, DataMod 2016, 7th international workshop on Graph Computation Models, GCM 2016, 3rd international workshop on Human-Oriented Formal Methods, HOFM 2016, 2nd international workshop on Model-Driven Engineering, logic and Optimization, MELO 2016, 3rd international workshop on Software Engineering Methods in Spreadsheets, SEMS 2016 and 1st international workshop on Formal to Practical Software Verification and Composition, VeryComp 2016

ISBN: (纸本)9783319502298

The proceedings contain 36 papers. The special focus in this conference is on DataMod, GCM, HOFM, MELO, SEMS and VeryComp. The topics include: Separating topological noise from features using persistent entropy;an accelerated MapReduce-based K-prototypes for big data;refinement mining;using data to sift plausible models;towards platform independent database modelling in enterprise systems;a personal data model for musical preferences;a high-level model checking language with compile-time pruning of local variables;probabilistic modelling of station locations in bicycle-sharing systems;on the definition of parallel independence in the algebraic approaches to graph transformation;SPO-rewriting of constrained partial algebras;attributed graph transformation via rule schemata;church-Rosser theorem;visual notation and patterns for abstract state machines;Spatio-temporal models for formal analysis and property-based testing;model-based generation of natural language specifications;formal model-based development in industrial automation with reactive blocks;towards model-based optimisation;using domain knowledge explicitly;context-aware design of reflective middleware in the internet of everything and pure edge computing platform for the future internet.

关键词：

来源：评论

学校读者我要写书评

暂无评论

probabilistic Model Checking applied to Autonomous Spacecraft Reconfiguration 3

Probabilistic Model Checking applied to Autonomous Spacecraf...

引用

3rd IEEE international workshop on Metrology for Aerospace (MetroAeroSpace)

作者： Nardone, Vittoria Santone, Antonella Tipaldi, Massimo Glielmo, Luigi Univ Sannio Dept Engn Benevento Italy Compagnia Generale Spazio I-20151 Milan Italy

ISBN: (纸本)9781467382922

Formal verification techniques are necessary to demonstrate the completeness, the correctness, and the consistency in implementing spacecraft model-based autonomy requirements, where we have to explore the behavior of the system over a large input range. This paper introduces an approach based on probabilistic model checking to verify the specification of spacecraft autonomous reconfiguration functionality, modeled via Markov Decision Process. Some preliminary results show how this approach can be used to check whether the system fulfills suitably-defined properties under a given probability.

关键词： Model Checking probabilistic Computation Tree logic Spacecraft Autonomy Markov Decision Process

来源：评论

学校读者我要写书评

暂无评论

Cyber threat analysis with structured probabilistic argumentation 3

Cyber threat analysis with structured probabilistic argument...

引用

3rd workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2019

作者： Leiva, Mario A. Simari, Gerardo I. Simari, Guillermo R. Shakarian, Paulo Argentina Cyber Reconnaissance Inc. TempeAZ United States

Capturing the uncertain aspects in cyber threat analyses is an important part of a wide range of efforts, including diagnostics, threat evaluation, and preventing attacks. However, there has been insufficient research and development of modeling approaches that are able to correctly capture and handle such uncertainty. In this work, we present an application example of the DeLP3E framework - a formalism that extends structured argumentation based on logic programming - in the domain of cyber threat analysis;in particular, near real-time analyses such as incident response in enterprise networks. The DeLP3E framework provides a unique combination of dialectical reasoning, rule-based inference, and probabilistic modeling to not only offer suggested responses to given situations, but also to explain to the analyst why the system reaches its conclusions. Copyright © 2019 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 international (CC BY 4.0).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

probabilistic Compliance in Declarative Process Mining 3

Probabilistic Compliance in Declarative Process Mining

引用

3rd international workshop on Process Management in the AI Era, PMAI 2024

作者： Vespa, Michela Bellodi, Elena Chesani, Federico Loreti, Daniela Mello, Paola Lamma, Evelina Ciampolini, Anna Dipartimento di Ingegneria Università di Ferrara Via Saragat 1 Ferrara Italy Dipartimento di Informatica - Scienza e Ingegneria Viale Risorgimento 2 Bologna Italy

When addressing real-world processes, it is crucial to account for their intrinsic uncertainty to better reflect the nature of such processes. In this work, we introduce the concept of probabilistic Declarative Process Specification (PDS), which is based on the Distribution Semantics from probabilistic logic programming, in order to describe declarative process models with both crisp and probabilistic constraints. The probability associated to a constraint represents its strength or importance in a specific process domain. From this, we propose a novel notion of probabilistic compliance of a process trace w.r.t. a PDS, and how to compute it with an existing algorithm. Preliminary experimental results on a healthcare protocol are presented to evaluate the feasibility of our proposed semantics on process conformance checking. © 2024 Copyright for this paper by its authors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The Computational Relevance of Formal logic Through Formal Proofs 3rd

The Computational Relevance of Formal Logic Through Formal P...

引用

3rd international Formal Methods Teaching workshop (FMTea) Held as Part of the 3rd World Congress on Formal Methods (FM)

作者： Almeida, Ariane A. Rocha-Oliveira, Ana Cristina Ferreira Ramos, Thiago M. de Moura, Flavio L. C. Ayala-Rincon, Mauricio Univ Brasilia Dept Ciencia Comp BR-70910900 Brasilia DF Brazil Univ Brasilia Dept Matemat BR-70910900 Brasilia DF Brazil

ISBN: (纸本)9783030324414;9783030324407

The construction of correct software, i.e. a computer program that meets a given specification, is an important goal in Computer Science. Nowadays, not only critical software (the ones used in aircraft, hospitals, banks, etc.) is supposed to provide additional guarantees of its correctness. Nevertheless, this is not an easy task because proofs are often long and full of details. In this sense, a strong background in logical deduction is essential to provide Computer Science (CS) professionals the necessary competencies to understand and provide mathematical proofs of their programs. logic courses for CS tend to follow old precepts without emphasizing mastering deduction itself. In our institution, for several years we have followed a more pragmatical approach, in which the foundational aspects of both natural deduction and deduction a la Gentzen are taught and, in parallel, the operational premises of deduction are put into practice in proof assistants. Thus, CS students with a minimum knowledge in programming are challenged on providing correctness certificates for simple algorithms. "Putting their hands in the dough" they acquire a better understanding of the value and importance of deductive technologies in computing. Here we show how this is done relating natural deduction and sequent calculus deduction and using the proof assistant PVS in the simple context of a library of sorting algorithms.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共2页 << < 1 2 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：