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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

510 篇 期刊文献
348 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

823 篇 工学
- 789 篇 计算机科学与技术...
- 399 篇 软件工程
- 57 篇 电气工程
- 24 篇 信息与通信工程
- 24 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
406 篇 理学
- 387 篇 数学
- 11 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 科学技术史(分学科...
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 系统科学
- 1 篇 地理学
27 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
14 篇 哲学
- 8 篇 哲学
10 篇 法学
- 9 篇 法学
- 1 篇 社会学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 农学
1 篇 经济学
- 1 篇 应用经济学

主题

869 篇 answer set progr...
77 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
31 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
23 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
20 篇 stable model sem...
16 篇 aggregates
16 篇 computational co...
16 篇 stream reasoning
15 篇 strong equivalen...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 declarative prog...

机构

35 篇 univ potsdam pot...
18 篇 univ calabria ar...
17 篇 univ calabria de...
15 篇 sabanci univ fac...
14 篇 univ genoa dibri...
14 篇 univ calabria de...
12 篇 univ a coruna la...
12 篇 univ genoa genoa
11 篇 univ politecn ma...
11 篇 texas tech univ ...
11 篇 vienna univ tech...
11 篇 vrije univ bruss...
11 篇 new mexico state...
10 篇 tu wien austria
10 篇 univ calabria de...
10 篇 vienna univ tech...
10 篇 univ klagenfurt ...
10 篇 univ texas austi...
8 篇 macquarie univ d...
8 篇 univ calabria co...

作者

49 篇 schaub torsten
44 篇 alviano mario
43 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
33 篇 eiter thomas
29 篇 maratea marco
28 篇 leone nicola
28 篇 gebser martin
26 篇 calimeri frances...
24 篇 fandinno jorge
23 篇 erdem esra
21 篇 ianni giovambatt...
20 篇 lifschitz vladim...
20 篇 gupta gopal
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 zangari jessica
18 篇 faber wolfgang
18 篇 perri simona

语言

846 篇 英文
18 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

检索条件"主题词=Answer Set Programming"

共 869 条记录，以下是231-240 订阅

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

详细简洁

排序：

Constraint-Enhanced Role Engineering via answer set programming 12

Constraint-Enhanced Role Engineering via Answer Set Programm...

引用

7th ACM Symposium on Information, Computer and Communications Security (ASIACCS)

作者： Hu, Jinwei Khan, Khaled M. Bai, Yun Zhang, Yan Qatar Univ Dept Comp Sci & Engn Doha 2713 Qatar Univ Western Sydney Sch Comp & Math Sydney NSW 1797 Australia

ISBN: (纸本)9781450313032

Role engineering (RE) aims to develop and maintain appropriate role-based access control (RBAC) configurations. However, RE with constraints in place is not well-studied. Constraints usually describe organizations' security and business requirements. An inconsistency between configurations and constraints compromises security and availability, as it may authorize otherwise forbidden access and deprive users of due privileges. In this paper, we apply answer set programming (ASP) to discover RBAC configurations that comply with constraints and meet various optimization objectives. We first formulate the need of supporting constraints as a problem independent of and complementary to existing RE problems. We then present a flexible framework for translating the proposed problem to ASP programs. In this way, the problem can be addressed via ASP solvers. Finally, we demonstrate the effectiveness and efficiency of our approach through experimental results.

关键词： RBAC Constraint Role Engineering answer set programming

来源：评论

学校读者我要写书评

暂无评论

Extraction of Preference and Classification Rules in Floor Plan Databases using answer set programming 10

Extraction of Preference and Classification Rules in Floor P...

引用

10th International Symposium on Computing and Networking (CANDAR)

作者： Hashimoto, Ryu Ozaki, Tomonobu Nihon Univ Grad Sch Integrated Basic Sci Setagaya Ward 3-25-40 Sakurajosui Tokyo 1568550 Japan Nihon Univ Dept Informat Sci Setagaya Ward 3-25-40 Sakurajosui Tokyo 1568550 Japan

ISBN: (纸本)9781665475327

The preference criteria for real estate rental properties strongly depend on the form of use and purposes. If it is possible to acquire the preference criteria on each purpose of use in a human-understandable form, they can be useful information for each of user, lenders and developers of rental properties. In this research, using the framework of preference and classification learning on answer set programming (ASP), we attempt to acquire preference criteria from floor plans of rental properties. Specifically, from a ranking of rental properties on intended purpose, inductive preference learning of ASP is applied to extract weak constraints corresponding to ranking functions, and classification learning is performed to obtain rules representing distinguish features between high and low ranked properties. The usefulness of our ASP-based analysis is evaluated by examining the results of the learnings for three real rankings of nine rental properties.

关键词： answer set programming Real estate floor plans Preference learning Classification

来源：评论

学校读者我要写书评

暂无评论

Optimising Business Process Discovery Using answer set programming 16th

Optimising Business Process Discovery Using Answer Set Progr...

引用

16th International Conference on Logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Chesani, Federico Di Francescomarino, Chiara Ghidini, Chiara Grundler, Giulia Loreti, Daniela Maggi, Fabrizio Maria Mello, Paola Montali, Marco Tessaris, Sergio DISI Univ Bologna Bologna Italy Fdn Bruno Kessler Trento Italy Free Univ Bozen Bolzano Bolzano Italy

ISBN: (纸本)9783031157073;9783031157066

Declarative business process discovery aims at identifying sets of constraints, from a given formal language, that characterise a workflow by using pre-recorded activity logs. Since the provided logs represent a fraction of all the consistent evolution of a process, and the fact that many sets of constraints covering those examples can be selected, empirical criteria should be employed to identify the "best" candidates. In our work we frame the process discovery as an optimisation problem, where we want to identify optimal sets of constraints according to preference criteria. Declarative constraints for processes are usually characterised via temporal logics, so different solutions can be semantically equivalent. For this reason, it is difficult to use an arbitrary finite domain constraints solvers for the optimisation. The use of answer set programming enables the combination of deduction rules within the optimisation algorithm, in order to take into account not only the user preferences but also the implicit semantics of the formal language. In this paper we show how we encoded the process discovery problem using the ASPrin framework for qualitative and quantitative optimisation in ASP, and the results of our experiments.

关键词： Preferences answer set programming Optimisation Process mining Process discovery Declarative process models

来源：评论

学校读者我要写书评

暂无评论

Web Stream Reasoning Using Probabilistic answer set programming

Web Stream Reasoning Using Probabilistic Answer Set Programm...

引用

8th International Conference on Web Reasoning and Rule Systems (RR)

作者： Nickles, Matthias Mileo, Alessandra Natl Univ Ireland INSIGHT Ctr Data Analyt Galway Ireland

ISBN: (纸本)9783319111131;9783319111124

We propose a framework for reasoning about dynamic Web data, based on probabilistic answer set programming (ASP). Our approach, which is prototypically implemented, allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities, and for learning of such weights from examples (parameter estimation). Knowledge as well as examples can be provided incrementally in the form of RDF data streams. Optionally, stream data can be configured to decay over time. With its hybrid combination of various contemporary AI techniques, our framework aims at prevalent challenges in relation to data streams and Linked Data, such as inconsistencies, noisy data, and probabilistic processing rules.

关键词： Web Reasoning Uncertainty Stream Reasoning answer set programming RDF Probabilistic Inductive Logic programming Machine Learning

来源：评论

学校读者我要写书评

暂无评论

UAV Compliance Checking Using answer set programming and Minimal Explanations Towards Compliance (Application Paper) 25th

UAV Compliance Checking Using Answer Set Programming and Min...

引用

25th International Symposium on Practical Aspects of Declarative Languages (PADL)

作者： Varanasi, Sarat Chandra Meng, Baoluo Alexander, Christopher Borgyos, Szabolcs Gen Elect Res Niskayuna NY 12309 USA Univ Texas Dallas Richardson TX 75083 USA

ISBN: (纸本)9783031248405;9783031248412

We describe a continuation of prior work on automated compliance checking process for Unmanned Aerial Vehicles using answer set programming. We describe a new algorithm to perform minimal explanations for offending compliance rules. This explanation is also performed for predicate answer set programs and the paper provides an extension to the algorithm that supported only propositional answer set programs. This improvement increases the expressivity of rules that can be captured in the compliance checking process. We take advantage of the goaldirected execution and constraint-solving capabilities of the s(CASP) engine in order to both compliance check the rules and compute the minimal explanations for violating rules. We further aim to map more rules from the AMA safety code into ASP.

关键词： answer set programming Automated flight readiness approval Minimal explanation computation

来源：评论

学校读者我要写书评

暂无评论

Combining answer set programming with Description Logics for Analogical Reasoning Under an Agent's Preferences 30th

Combining Answer Set Programming with Description Logics for...

引用

30th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE)

作者： Racharak, Teeradaj Tojo, Satoshi Nguyen Duy Hung Boonkwan, Prachya Thammasat Univ Sirindhorn Int Inst Technol Sch Informat Comp & Commun Technol Pathum Thani Thailand Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa Japan Natl Elect & Comp Technol Ctr Pathum Thani Thailand

ISBN: (纸本)9783319600451;9783319600444

Analogical reasoning makes use of a kind of resemblance of one thing to another for assigning properties from one context to another. This kind of reasoning is used quite often by human beings, especially in unseen situations. The key idea of analogy is to identify a good similarity;however, similarity may be varied on subjective factors (i.e. an agent's preferences). This paper studies an implementation of this phenomena using an answer set programming with Description Logics. The main idea underlying the proposed approach lies in the so-called Argument from Analogy developed by Walton [1]. Finally, the paper relates the approach to others and discusses future directions.

关键词： Analogical argumentation Argumentation schemes Argument from analogy answer set programming Description logics

来源：评论

学校读者我要写书评

暂无评论

Towards a Type Discipline for answer set programming

Towards a Type Discipline for Answer Set Programming

引用

International Conference of the TYPES 2008

作者： Fiorentini, Camillo Momigliano, Alberto Ornaghi, Mario Univ Milan Dipartimento Sci Informaz I-20122 Milan Italy

ISBN: (纸本)9783642024436

We argue that it is high time that types had a beneficial impact in the field of answer set programming and in particular Disjunctive Datalog as exemplified by the DLV system. Things become immediately more challenging, as we wish to present a type system for DLV-Complex, an extension of DLV with uninterpreted function symbols, external implemented predicates and types. Our type system owes to the seminal polymorphic type system for Prolog introduced by Mycroft and O'Keefe, in the formulation by Lakshman and Reddy. The most innovative part of the paper is developing a declarative grounding procedure which is at the same time appropriate for the operational semantics of ASP and able to handle the new features provided by DLV-Complex. We discuss the soundness of the procedure and evaluate informally its success in reducing, as expected, the set of ground terms. This yields an automatic reduction in size and numbers of (non isomorphic) models. Similar results Could have only been achieved in the current untyped version by careful use of generator predicates in lieu of types.

关键词： answer set programming type checking grounding many sorted interpretation

来源：评论

学校读者我要写书评

暂无评论

Grammatical Inference by answer set programming 1

引用

20th Annual International Conference on Computational Science (ICCS)

作者： Wieczorek, Wojciech Strak, Lukasz Nowakowski, Arkadiusz Unold, Olgierd Univ Silesia Katowice Inst Comp Sci Sosnowiec Poland Wroclaw Univ Sci & Technol Dept Comp Engn Wroclaw Poland

ISBN: (数字)9783030504236

ISBN: (纸本)9783030504236;9783030504229

In this paper, the identification of context-free grammars based on the presentation of samples is investigated. The main idea of solving this problem proposed in the literature is reformulated in two different ways: in terms of general constrains and as an answer set program. In a series of experiments, we showed that our answer set programming approach is much faster than our alternative method and the original SAT encoding method. Similarly to a pioneer work, some well-known context-free grammars have been induced correctly, and we also followed its test procedure with randomly generated grammars, making it clear that using our answer set programs increases computational efficiency. The research can be regarded as another evidence that solutions based on the stable model (answer set) semantics of logic programming may be a right choice for complex problems.

关键词： Grammatical inference answer set programming Constraint satisfaction problem

来源：评论

学校读者我要写书评

暂无评论

Learning Automata-Based Complex Event Patterns in answer set programming 1

引用

31st International Conference on Inductive Logic programming (ILP)

作者： Katzouris, Nikos Paliouras, Georgios Natl Ctr Sci Res NCSR Demokritos Inst Informat & Telecommun Athens Greece

ISBN: (数字)9783031556302

ISBN: (纸本)9783031556296;9783031556302

Complex Event Recognition and Forecasting (CER/F) techniques attempt to detect, or even forecast ahead of time, event occurrences in streaming input using predefined event patterns. Such patterns are not always known in advance, or they frequently change over time, making machine learning techniques, capable of extracting such patterns from data, highly desirable in CER/F. Since many CER/F systems use symbolic automata to represent such patterns, we propose a family of such automata where the transition-enabling conditions are defined by answer set programming (ASP) rules, and which, thanks to the strong connections of ASP to symbolic learning, are directly learnable from data. We present such a learning approach in ASP and an incremental version thereof that trades optimality for efficiency and is capable to scale to large datasets. We evaluate our approach on two CER datasets and compare it to state-of-the-art automata learning techniques, demonstrating empirically a superior performance, both in terms of predictive accuracy and scalability.

关键词： Automata Learning answer set programming Complex Event Recognition

来源：评论

学校读者我要写书评

暂无评论

Specifying Credal sets With Probabilistic answer set programming 13

Specifying Credal Sets With Probabilistic Answer Set Program...

引用

13th International Symposium on Imprecise Probabilities - Theories and Applications (ISIPTA)

作者： Maua, Denis Deratani Cozman, Fabio Gagliardi Univ Sao Paulo Inst Math & Stat Sao Paulo Brazil Univ Sao Paulo Escola Politecn Sao Paulo Brazil

Probabilistic answer set programming offers an intuitive and powerful declarative language to represent uncertainty about combinatorial structures. Remarkably, under the credal semantics, such programs can specify any infinitely monotone Choquet Capacity in an intuitive way. Yet, one might be interested in specifying more general credal sets. We examine how probabilistic answer set programs can be extended to represent more general credal sets with constructs that allow for imprecise probability values. We characterize the credal sets that can be captured with various languages, and discuss the expressivity and complexity added by the use of imprecision in probabilistic constructs.

关键词： probabilistic logics answer set programming credal networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共87页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：