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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

511 篇 期刊文献
352 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

826 篇 工学
- 792 篇 计算机科学与技术...
- 401 篇 软件工程
- 59 篇 电气工程
- 26 篇 信息与通信工程
- 25 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
409 篇 理学
- 390 篇 数学
- 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 篇 应用经济学

主题

874 篇 answer set progr...
78 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
32 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
25 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
19 篇 stable model sem...
17 篇 stream reasoning
16 篇 aggregates
16 篇 computational co...
15 篇 strong equivalen...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 machine learning

机构

35 篇 univ potsdam pot...
19 篇 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
44 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
32 篇 eiter thomas
29 篇 maratea marco
28 篇 leone nicola
28 篇 gebser martin
27 篇 calimeri frances...
24 篇 fandinno jorge
23 篇 erdem esra
22 篇 ianni giovambatt...
20 篇 lifschitz vladim...
20 篇 gupta gopal
19 篇 zangari jessica
19 篇 perri simona
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 faber wolfgang

语言

849 篇 英文
20 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

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

共 874 条记录，以下是771-780 订阅

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

详细简洁

排序：

Degrees of Laziness in Grounding Effects of Lazy-Grounding Strategies on ASP Solving 15th

Degrees of Laziness in Grounding Effects of Lazy-Grounding S...

引用

15th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Taupe, Richard Weinzierl, Antonius Friedrich, Gerhard Siemens AG Osterreich Vienna Austria Alpen Adria Univ Klagenfurt Klagenfurt Austria Vienna Univ Technol Inst Log & Computat Vienna Austria

ISBN: (纸本)9783030205287;9783030205270

The traditional ground-and-solve approach to answer set programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that interleaves grounding with solving and thus uses space more efficiently. The limited view on the search space in lazy grounding poses unique challenges, however, and can have adverse effects on solving performance. In this paper we present a novel characterization of degrees of laziness in grounding for ASP, i.e. of compromises between lazily grounding as little as possible and the traditional full grounding upfront. We investigate how these degrees of laziness compare to each other formally as well as, by means of an experimental analysis using a number of benchmarks, in terms of their effects on solving performance. Our contributions are the introduction of a range of novel lazy grounding strategies, a formal account on their relationships and their correctness, and an investigation of their effects on solving performance. Experiments show that our approach performs significantly better than state-of-the-art lazy grounding in many cases.

关键词： answer set programming Lazy grounding Heuristics

来源：评论

学校读者我要写书评

暂无评论

Formalizing and Reasoning About Supply Chain Contracts Between Agents 25th

Formalizing and Reasoning About Supply Chain Contracts Betwe...

引用

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

作者： Flynn, Dylan Nadeau, Chasity Shantz, Jeannine Balduccini, Marcello Son, Tran Cao Griffor, Edward R. St Josephs Univ Philadelphia PA 19131 USA New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Natl Inst Stand & Technol Gaithersburg MD 20899 USA

ISBN: (纸本)9783031248405;9783031248412

Inspired by the recent problems in supply chains, we propose an approach to declarative modeling of contracts between agents that will eventually support reasoning about resilience of and about ways to improve supply chains. Specifically, we present a high-level language for specifying and reasoning about contracts over action domains of agents. We assume that the behavior of the agents can be formally expressed through action theories and view a contract as a collection of constraints. Each constraint specifies the responsibility of an agent to achieve a certain result by a deadline. Each agent also has a mapping between constraints and the agent's concerns, i.e. issues that the agent is concerned about, which are modeled in accordance with the CPS Framework proposed by the National Institute of Standards and Technology. We discuss how common questions related to the fulfillment of a contract or the concerns of the agents can be answered and computed via answer set programming.

关键词： Specifying and reasoning about contracts Supply chain Cyber-Physical System Framework answer set programming

来源：评论

学校读者我要写书评

暂无评论

Complexity and Scalability of Defeasible Reasoning with Typicality in Many-Valued Weighted Knowledge Bases 18th

Complexity and Scalability of Defeasible Reasoning with Typi...

引用

18th European Conference on Logics in Artificial Intelligence (JELIA)

作者： Alviano, Mario Giordano, Laura Dupre, Daniele Theseider Univ Calabria DEMACS Via Bucci 30-B I-87036 Arcavacata Di Rende CS Italy Univ Piemonte Orientale DISIT Viale Michel 11 I-15121 Alessandria Italy

ISBN: (纸本)9783031436185;9783031436192

Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons. In this context, answer set programming (ASP) has been shown to be suitable for addressing defeasible reasoning in the finitely many-valued case, providing a Pi(2)(p) upper bound on the complexity of the problem, nonetheless leaving unknown the exact complexity and only providing a proof-of-concept implementation. This paper fulfils the lack by providing a P NP[log]-completeness result and new ASP encodings that deal with weighted knowledge bases with large search spaces.

关键词： Typicality Logics Multi-valued Logics answer set programming

来源：评论

学校读者我要写书评

暂无评论

Merging Logic Programs under answer set Semantics

Merging Logic Programs under Answer Set Semantics

引用

25th International Conference on Logic programming (ICLP)

作者： Delgrande, James Schaub, Torsten Tompits, Hans Woltran, Stefan Simon Fraser Univ Burnaby BC V5A 1S6 Canada Univ Potsdam D-14482 Potsdam Germany Tech Univ Wien A-1040 Vienna Austria Griffith Univ Nathan Qld Australia

ISBN: (纸本)9783642028458

This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P-1,...,P-n, the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. The first informally selects those models of the programs that vary the least from the models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. P-0 can be thought of as analogous to a set of database integrity constraints. We examine formal properties of these operators and give encodings for computing the rnergings of a multiset of logic programs within the same logic programming framework. As a by-product, we provide a complexity analysis revealing that our operators do not increase the complexity of the base formalism.

关键词： answer set programming belief merging strong equivalence

来源：评论

学校读者我要写书评

暂无评论

Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints

Conflict Generalisation in ASP: Learning Correct and Effecti...

引用

36th International Conference on Logic programming (ICLP)

作者： Taupe, Richard Weinzierl, Antonius Friedrich, Gerhard Siemens AG Osterreich Graz Austria Alpen Adria Univ Klagenfurt Austria TU Wien Vienna Univ Technol Vienna Austria

Generalising and re-using knowledge learned while solving one problem instance has been neglected by state-of-the-art answer set solvers. We suggest a new approach that generalises learned nogoods for re-use to speed-up the solving of future problem instances. Our solution combines well-known ASP solving techniques with deductive logic-based machine learning. Solving performance can be improved by adding learned non-ground constraints to the original program. We demonstrate the effects of our method by means of realistic examples, showing that our approach requires low computational cost to learn constraints that yield significant performance benefits in our test cases. These benefits can be seen with ground-and-solve systems as well as lazy-grounding systems. However, ground-and-solve systems suffer from additional grounding overheads, induced by the additional constraints in some cases. By means of conflict minimization, non-minimal learned constraints can be reduced. This can result in significant reductions of grounding and solving efforts, as our experiments show.

关键词： answer set programming Deductive Learning Non-Ground Nogood Learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing answer set Computation via Heuristic-Based Decomposition 20th

Optimizing Answer Set Computation via Heuristic-Based Decomp...

引用

20th Symposium on Practical Aspects of Declarative Languages (PADL)

作者： Calimeri, Francesco Fusca, Davide Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy DLVSystem Srl Arcavacata Di Rende Italy

ISBN: (纸本)9783319733050;9783319733043

answer set programming (ASP) is a purely declarative formalism developed in the field of logic programming and nonmonotonic reasoning. With ASP, computational problems are encoded by logic programs whose answer sets, corresponding to solutions, are computed by an ASP system. In general, several semantically equivalent programs might be defined for the same problem;however, performance of ASP systems while evaluating them might significantly vary. We propose an approach for automatically transforming an input logic program into an equivalent one that can be evaluated more efficiently. To this aim, one can make use of existing tree-decomposition techniques for rewriting selected rules into a set of multiple ones. The idea is to guide and adaptively apply them on the basis of proper new heuristics, in order to obtain a smart rewriting algorithm to be integrated into an ASP system. The method is rather general: it can be adapted to the system at hand and implement different preference policies. Furthermore, we define a set of new heuristics explicitly tailored at optimizing one of the main phases of the typical ASP computation, namely the grounding process;we make use of them in order to actually implement the approach into the ASP system DLV, and in particular into its grounding subsystem I-DLV, and carry out an extensive experimental activity aimed at assessing the impact of the proposal.

关键词： answer set programming Artificial intelligence ASP in practice

来源：评论

学校读者我要写书评

暂无评论

Reasoning about policy behavior in logic-based trust management systems: Some complexity results and an operational framework 28

Reasoning about policy behavior in logic-based trust managem...

引用

IEEE 28th Computer Security Foundations Symposium CSF

作者： Pasarella, Edelmira Lobo, Jorge Univ Politecn Cataluna Dept Comp Sci E-08028 Barcelona Spain Univ Pompeu Fabra ICREA DTIC Barcelona Spain

ISBN: (纸本)9781467375382

In this paper we show that the logical framework proposed by Becker et al. [1] to reason about security policy behavior in a trust management context can be captured by an operational framework that is based on the language proposed by Miller in 1989 to deal with scoping and/or modules in logic programming. The framework of Becker et al. uses propositional Horn clauses to represent both policies and credentials, implications in clauses are interpreted in counterfactual logic, a Hilbert-style proof system is defined and a system based on SAT is used to prove whether properties about credentials, permissions and policies are valid, i.e. true under all possible policies. Our contributions in this paper are three. First, we show that this kind of validation can rely on an operational semantics (derivability relation) of a language very similar to Miller's language, which is very close to derivability in logic programs. Second, we are able to establish that, as in propositional logic, validity of formulas is a co-NP-complete problem. And third, we present a provably correct implementation of a goal-oriented algorithm for validity.

关键词： Trust Management Systems Semantics answer set programming Logic Programs

来源：评论

学校读者我要写书评

暂无评论

Document Layout Analysis for Semantic Information Extraction 16th

Document Layout Analysis for Semantic Information Extraction

引用

16th International Conference of the Italian Association for Artificial Intelligence (AI*IA)

作者： Adrian, Weronika T. Leone, Nicola Manna, Marco Marte, Cinzia Univ Calabria Dept Math & Comp Sci I-87036 Arcavacata Di Rende Italy AGH Univ Sci & Technol Krakow Poland

ISBN: (纸本)9783319701691;9783319701684

Using machines to automatically extract relevant information from unstructured and semi-structured sources has practical significance in todays life and business. In this context, although understanding the meaning of words is important, the process of identifying self-consistent geometric and logical regions of interest-blocks, cells, columns and tables, as well as paragraphs, titles and captions, only to mention a few-is of paramount importance too. This complex process goes under the name of document layout analysis. In this work, we discuss newly designed techniques to solve this problem effectively, by combining both syntactic and semantic document aspects. These techniques described here are at the basis of KnowRex, a comprehensive system for ontology-driven Information Extraction.

关键词： Document Layout Analysis Information Extraction Table recognition answer set programming Ontologies Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Test-cases of Increasing Complexity for Autonomous Vehicles at Intersections 13

Automatic Generation of Test-cases of Increasing Complexity ...

引用

13th ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS )

作者： Karimi, Abolfazl Duggirala, Parasara Sridhar Univ N Carolina Chapel Hill NC 27515 USA

ISBN: (纸本)9781665409674

This paper presents a new framework for generating test-case scenarios for autonomous vehicles. We address two challenges in automatic test-case generation: first, a formal notion of test-case complexity, and second, an algorithm to generate more-complex test-cases. We characterize the complexity of a test-case by its set of solutions, and compare two complexities by the subset relation. The novelty of our definition is that it only relies on the pass-fail criteria of the test-case, rather than indirect or subjective assessments of what may challenge an ego vehicle to pass a test-case. Given a testcase, we model the problem of generating a more complex test-case as a constraint-satisfaction search problem. The search variables are the changes to the given test-case, and the search constraints define a solution to the search problem. The constraints include steering geometry of cars, the geometry of lanes, the shape of cars, traffic rules, bounds on longitudinal acceleration of cars, etc. To conquer the computational challenge, we divide the constraints to three categories and satisfy them with simulation, answer set programming, and SMT solving. We have implemented our algorithm using the Scenic libraries and the CARLA simulator and generate test-cases for several 3-way and 4-way intersections with different topologies. Our experiments demonstrate that both CARLA's autopilot and autopilot-plus-RSS (Responsibility-Sensitive Safety) can fail as the complexity of test-cases increase.

关键词： test-case complexity test-case generation traffic rules logic programming answer set programming Bezier curves SMT CARLA Scenic

来源：评论

学校读者我要写书评

暂无评论

Combining Deep Learning and ASP-Based Models for the Semantic Segmentation of Medical Images 5th

Combining Deep Learning and ASP-Based Models for the Semanti...

引用

5th International Joint Conference on Rules and Reasoning (RuleML+RR)

作者： Bruno, Pierangela Calimeri, Francesco Marte, Cinzia Manna, Marco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783030911676;9783030911669

Automatic segmentation represents a huge breakthrough in computer-aided diagnosis and medicine, as it allows to provide clinicians important with information for interventional and diagnostic tasks. Recent advancements in Deep Learning (DL), such as Convolutional Neural Networks (CNNs), have proved to be greatly promising in identifying anatomical and pathological structures, and in extracting meaningful patterns from huge amounts of data. However, such approaches suffer from the lack of proper means for interpreting the choices made by the models, and it is not easy to drive the decisions according to prior knowledge. In this context, deductive rule-based approaches, such as answer set programming (ASP), can allow to effectively encode problems or specific features via logic programs in a declarative fashion, while possibly also helping at improving performance. In this seminal work, we propose the use of ASP to drive DL approaches in performing semantic segmentation of medical images. Specifically, we encoded prior medical knowledge via ASP, thus defining a rule-based model for deducting all admitted combinations of classes and right locations in medical images. The results of an experimental analysis are reported with the aim to assess the viability of the proposed approach.

关键词： answer set programming Knowledge representation and reasoning Deep learning Semantic segmentation Inductive-deductive coupling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 74 75 76 77 78 79 80 81 82 83 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：