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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

254 篇 会议
24 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

235 篇 工学
- 230 篇 计算机科学与技术...
- 146 篇 软件工程
- 11 篇 电气工程
- 9 篇 控制科学与工程
- 8 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
77 篇 理学
- 73 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
11 篇 管理学
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 法学
1 篇 军事学
- 1 篇 军队指挥学

主题

58 篇 logic programmin...
34 篇 answer set progr...
18 篇 non-monotonic re...
15 篇 knowledge repres...
9 篇 semantics
7 篇 inductive logic ...
6 篇 computer circuit...
5 篇 fuzzy logic
5 篇 formal logic
5 篇 programming
4 篇 belief revision
4 篇 epistemic logic ...
4 篇 non-monotonic lo...
4 篇 model checking
4 篇 ontologies
4 篇 defeasible logic
4 篇 knowledge repres...
4 篇 machine learning
3 篇 equilibrium logi...
3 篇 abduction

机构

9 篇 univ potsdam pot...
6 篇 univ calabria ar...
5 篇 univ a coruna la...
4 篇 new mexico state...
4 篇 vrije univ bruss...
4 篇 imperial coll lo...
4 篇 univ milano bico...
4 篇 univ angers leri...
3 篇 tu wien austria
3 篇 univ genoa dibri...
3 篇 univ calabria de...
3 篇 vienna univ tech...
3 篇 tech univ dresde...
2 篇 university of ma...
2 篇 univ torino dipa...
2 篇 katholieke univ ...
2 篇 univ calabria di...
2 篇 univ hasselt has...
2 篇 univ politecn ma...
2 篇 univ ferrara dip...

作者

16 篇 ricca francesco
9 篇 cabalar pedro
8 篇 alviano mario
7 篇 fandinno jorge
6 篇 schaub torsten
6 篇 maratea marco
5 篇 maher michael j.
5 篇 gebser martin
4 篇 eiter thomas
4 篇 son tran cao
3 篇 akbar siami nami...
3 篇 governatori guid...
3 篇 gaggl sarah alic...
3 篇 perez gilberto
3 篇 riguzzi fabrizio
3 篇 penaloza rafael
3 篇 formisano andrea
3 篇 aguado felicidad
3 篇 russo alessandra
3 篇 ielo antonio

语言

282 篇 英文

检索条件"任意字段=17th International Conference on Logic Programming and Non-monotonic Reasoning"

共 282 条记录，以下是171-180 订阅

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

详细简洁

排序：

international standard ISO 9001 an artificial intelligence view 17

International standard ISO 9001 an artificial intelligence v...

引用

17th international conference on Enterprise Information Systems, ICEIS 2015

作者： Neves, José Fernandes, Ana Gomes, Guida Neves, Mariana Abelha, António Vicente, Henrique Algoritmi Universidade do Minho Braga Portugal Departamento de Química Escola de Ciências e Tecnologia Universidade de Évora Évora Portugal Deloitte Londres United Kingdom Departamento de Química Centro de Química de Évora Escola de Ciências e Tecnologia Universidade de Évora Évora Portugal

ISBN: (纸本)9789897580970

ISO 9001 is recognized as a Quality Management Systems standard, i.e., it is the primary phase of a process of constant enhancement that will provide an organisation with the necessary management tools to improve working practices. Indeed, it provides a framework and a set of principles aimed at ensuring a common sense approach to the management of an organization in order to consistently satisfy customers and other stakeholders. therefore, and in order to add value to ISO 9001, this work focuses on the development of a decision support system, which will allow companies to be able to meet the needs of customers by fulfilling requirements that reflect either the effectiveness or the non-effectiveness of an organization. the procedures for knowledge representation and reasoning used are based on an extension to the logic programming language, allowing the handling of incomplete, contradictory and even forbidden data, information and/or knowledge. the computational framework is centred on Artificial Neural Networks to evaluate customer's satisfaction and the degree of confidence that one has on such a happening.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Statistical Statements in Probabilistic logic programming 16th

Statistical Statements in Probabilistic Logic Programming

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Azzolini, Damiano Bellodi, Elena Riguzzi, Fabrizio Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy

ISBN: (纸本)9783031157073;9783031157066

Probabilistic logic Programs under the distribution semantics (PLPDS) do not allow statistical probabilistic statements of the form "90% of birds fly", which were defined "Type 1" statements by Halpern. In this paper, we add this kind of statements to PLPDS and introduce the PASTA ("Probabilistic Answer set programming for STAtistical probabilities") language. We translate programs in our new formalism into probabilistic answer set programs under the credal semantics. this approach differs from previous proposals, such as the one based on "probabilistic conditionals" as, instead of choosing a single model by making the maximum entropy assumption, we take into consideration all models and we assign probability intervals to queries. In this way we refrain from making assumptions and we obtain a more neutral framework. We also propose an inference algorithm and compare it with an existing solver for probabilistic answer set programs on a number of programs of increasing size, showing that our solution is faster and can deal with larger instances.

关键词： Probabilistic logic programming Statistical statements Statistical Relational Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Beyond Low-Code Development: Marrying Requirements Models and Knowledge Representations 17

Beyond Low-Code Development: Marrying Requirements Models an...

引用

17th conference on Computer Science and Intelligence Systems (FedCSIS)

作者： Rybinski, Kamil Smialek, Michal Warsaw Univ Technol Warsaw Poland

ISBN: (数字)9788396242396

ISBN: (纸本)9788396242396

Typical Low-Code Development platforms enable model-driven generation of web applications from high-level visual notations. they normally express the UI and the application logic, which allows generating the frontend and basic CRUD operations. However, more complex domain logic (data processing) operations still necessitate the use of traditional programming. this paper presents a visual language, called RSL-DL, to represent domain knowledge with complex domain rules aligned with requirements models. the language synthesises and extends approaches found in knowledge representation (ontologies) and software modelling language engineering. Its purpose is to enable a fully automatic generation of domain logic code by reasoning over and reusing domain knowledge. the language's abstract syntax is defined using a meta-model expressed in MOF. Its semantics is expressed with several translational rules that map RSL-DL models onto typical programming language constructs. the rules are explained informally in natural language and formalised using a graphical transformation notation. It is also supported by introducing an inference engine that enables processing queries to domain models and selecting appropriate invocations to generated code. the presented language was implemented by building a dedicated model editor and transformation engine. It was also initially validated through usability studies. Based on these results, we conclude that declarative knowledge representations can be successfully used to produce imperative back-end code with non-trivial logic.

关键词： Visualization Codes Computational modeling Semantics Syntactics programming Ontologies

来源：评论

学校读者我要写书评

暂无评论

Dealing with biology systems in the framework of answer set programming 24

Dealing with biology systems in the framework of answer set ...

引用

24th KES international conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2020

作者： Khaled, Tarek Benhamou, Belaid Aix Marseille University University of Toulon CNRS LIS Marseille France

reasoning about gene networks is essential from various perspectives, such as predicting side effects of drugs or explaining unusual cellular behavior. Because of the massive size of these gene networks, a biologist can only work on a small part of the network. thus, there is an essential requirement for logical representations and automated reasoning on such networks to help biologists to understand genetic interactions. However, the knowledge about gene networks is always incomplete and sometimes not accurate. Hence, knowledge has to be continuously revised and extended. In this work, we propose an approach based on non-monotonic logic programming, and the framework of Answer Set programming(ASP), to represent and handle gene networks. We show how to model reasoning, predict events, and explain observations in gene networks. Finally, we show how our approach is applied to represent and resolve the DNA double-strand breaks, which is one of the most severe genomic lesions. © 2020 the Authors. Published by Elsevier B.V.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Solving fuzzy answer set programs in product logic 9

Solving fuzzy answer set programs in product logic

引用

9th international Joint conference on Computational Intelligence, IJCCI 2017

作者： Uhliarik, Ivor Department of Applied Informatics Comenius University Mlynská dolina Bratislava842 48 Slovakia

ISBN: (纸本)9789897582745

In recent years, foundations have been laid for a turn in logic programming paradigms in continuous domains. Fuzzy answer set programming (FASP) has emerged as a combination of a tool for non-monotonic reasoning and solving combinatorial problems (ASP) and a knowledge representation formalism that allows for modeling partial truth (fuzzy logic). there have been various attempts at designing a solver for FASP, but they either make use of transformations into optimization programs with scaling problems, operate only on finite-valued Lukasiewicz logic, or yield only approximate answer sets. Moreover, there has been no research focused on the product logic semantics in FASP. In this work we investigate the methods used in state-of-the-art classical ASP solvers with the aim of designing a FASP solver for product propositional logic. In particular, we base our approach on the conversion into fuzzy SAT (satisfiability problem) and the fuzzy generalization of the DPLL algorithm. Since both Lukasiewicz and (extended) Gödel logic can be embedded into product logic, the resulting system should be able to operate on all three logics uniformly. Copyright © 2017 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

A Semantic Characterization for ASP Base Revision 11th

A Semantic Characterization for ASP Base Revision

引用

11th international conference on Scalable Uncertainty Management (SUM)

作者： Garcia, Laurent Lefevre, Claire Papini, Odile Stephan, Igor Wurbel, Eric Univ Angers LERIA Angers France Aix Marseille Univ CNRS UMR 7296 LSIS Marseille France

ISBN: (纸本)9783319675824;9783319675817

the paper deals with base revision for Answer Set programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. these strategies allow one to define families of rule-based revision operators. the paper presents a semantic characterization of these families of revision operators in terms of answer sets. this characterization allows one to equivalently consider the evolution of syntactic logic programs and the evolution of their semantic content.

关键词： Answer set programming Base revision Belief revision Belief change non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Metric Temporal Answer Set programming over Timed Traces 16th

Metric Temporal Answer Set Programming over Timed Traces

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Cabalar, Pedro Dieguez, Martin Schaub, Torsten Schuhmann, Anna Univ A Coruna Coruna Spain Univ Angers LERIA Angers France Univ Potsdam Potsdam Germany

ISBN: (纸本)9783031157073;9783031157066

In temporal extensions of Answer Set programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. In many applications, however, timing constraints are important like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers. the resulting Metric Equilibrium logic provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. To this end, we define a translation of metric formulas into monadic first-order formulas and give a correspondence between their models in Metric Equilibrium logic and Monadic Quantified Equilibrium logic, respectively. Interestingly, our translation provides a blue print for implementation in terms of ASP modulo difference constraints.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

nonmonotonic reasoning with quantified boolean constraints 4th

Nonmonotonic reasoning with quantified boolean constraints

引用

4th international conference on logic programming and non-monotonic reasoning, LPNMR 1997

作者： Pollett, Chris Remmel, Jeffrey B. Department of Mathematics University of California at San Diego La JollaCA92903 United States Sagent Corporation BellvueWA98004 United States

ISBN: (纸本)9783540632559

In this paper, we define and investigate the complexity of several nonmonotonic logics with quantified Boolean formulas as constraints. We give quantified constraint versions of the constraint programming formalism of Marek, Nerode, and Remmel [15] and of the natural extension of their theory to default logic. We also introduce a new formalism which adds constraints to circumscription. We show that standard complexity results for each of these formalisms generalize in the quantified constraint case. Gogic, Kautz, Papadimitriou, and Selman [8] have introduced a new method for measuring the strengths of reasoning formalisms based on succinctness of model representation. We show a natural hierarchy based on this measure exists between our versions of logic programming, circumscription, and default logic. Finally, we discuss some results about the relative succinctness of our reasoning formalisms versus any formalism for which model checking can be done somewhere in the polynomial time hierarchy. © 1997, Springer Verlag. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

eclingo : A Solver for Epistemic logic Programs

eclingo : A Solver for Epistemic Logic Programs

引用

36th international conference on logic programming (ICLP)

作者： Cabalar, Pedro Fandinno, Jorge Garea, Javier Romero, Javier Schaub, Torsten Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany

We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. the input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. the eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. this process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.

关键词： Answer Set programming Epistemic logic Programs non-monotonic reasoning Conformant Planning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：