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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
350 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

824 篇 工学
- 790 篇 计算机科学与技术...
- 400 篇 软件工程
- 57 篇 电气工程
- 24 篇 信息与通信工程
- 24 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
407 篇 理学
- 388 篇 数学
- 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 篇 应用经济学

主题

872 篇 answer set progr...
78 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
32 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
24 篇 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
43 篇 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 篇 英文
18 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

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

共 872 条记录，以下是801-810 订阅

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

详细简洁

排序：

ALPSolver: A Solver for Assumable Logic programming

ALPSolver: A Solver for Assumable Logic Programming

引用

Intelligent Computing and Human-Computer Interaction (ICHCI), International Conference on

作者： Zhizheng Zhang Jiayi Chen Huangdezhong Tian School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications (Southeast University) Ministry of Education China

ISBN: (数字)9798350368284

ISBN: (纸本)9798350368291

Assumable Logic programming (ALP), an extension of answer set programming (ASP), has been theoretically demonstrated to possess significant advantages in addressing problems involving incomplete information. Therefore, the development of ALP solvers is urgently needed to facilitate further research and applications. This paper proposes a solving algorithm named answer set Based View Search (ASBVS) and its optimization to compute the results of ALP programs. Based on this, the ALPSolver has been implemented and integrated into an online platform for public use. This paper experimentally validates the correctness of the solving algorithm and confirms the advantages of ALP in handling default information, indirect exception and abductive reasoning. Additionally, the experimental results demonstrate the effectiveness of the optimization algorithm, with a notable increase in efficiency as the problem scale increases.

关键词： Human computer interaction Logic programming Semantics Optimization methods answer set programming Syntactics Cognition Logic

来源：评论

学校读者我要写书评

暂无评论

Handling Semantic Inconsistencies in Commonsense Knowledge for Autonomous Service Robots 14

Handling Semantic Inconsistencies in Commonsense Knowledge f...

引用

14th IEEE International Conference on Semantic Computing (ICSC)

作者： Jakob, Stefan Opfer, Stephan Jahl, Alexander Baraki, Harun Geihs, Kurt Univ Kassel Wilhelmshoher Allee 73 D-34121 Kassel Germany

ISBN: (纸本)9781728163321

The necessary amount of commonsense knowledge for autonomous domestic service robots is enormous and avoiding inconsistencies is consequently almost impossible. This is especially true for inconsistencies on a semantic level, that is, inconsistencies as interpreted by human beings where the properties of a concept may contradict each other. In contrast to Boolean algebra (A and A), these inconsistencies will not lead to a trivial solution like false, since they are not captured in a logic formalism. Instead, they will result in semantic contradictions when interpreting the solution. In order to tackle this problem, we propose a way to handle semantic inconsistencies, by utilising a commonsense knowledge database and implementing a dynamic knowledge base that is capable of resolving contradicting parts of knowledge. The applied non-monotonic reasoning mechanism is answer set programming, and ConceptNet5 is the commonsense knowledge database. Finally, we evaluate the performance of our approach and show its advantages in a complete household scenario.

关键词： answer set programming Cognitive robotics Commonsense reasoning Dynamic knowledge Semantic inconsistencies Service robots

来源：评论

学校读者我要写书评

暂无评论

answer set Programs with Queries over Subprograms 14th

Answer Set Programs with Queries over Subprograms

引用

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

作者： Redl, Christoph Tech Univ Wien Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

ISBN: (纸本)9783319616605;9783319616599

answer-set programming (ASP) is a declarative programming paradigm. In this paper we discuss two related restrictions and present a novel modeling technique to overcome them: (1) Meta-reasoning about the collection of answer sets of a program is in general only possible by external postprocessing, but not within the program. This prohibits the direct continuation of reasoning based on the answer to the query over a (sub) program's answer sets. (2) The saturation programming technique exploits the minimality criterion for answer sets of a disjunctive ASP program to solve co-NP-hard problems, which typically involve checking if a property holds for all objects in a certain domain. However, the technique is advanced and not easily applicable by average ASP users;moreover, the use of default-negation within saturation encodings is limited. In this paper, we present an approach which allows for brave and cautious query answering over normal subprograms within a disjunctive program in order to address restriction (1). The query answer is represented by a dedicated atom within each answer set of the overall program, which paves the way also for a more intuitive alternative to saturation encodings and allows also using default-negation within such encodings, which addresses restriction (2).

关键词： answer set programming Nonmonotonic reasoning FLP semantics Meta programming Saturation

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC MAGIC setS FOR DISJUNCTIVE DATALOG PROGRAMS

DYNAMIC MAGIC SETS FOR DISJUNCTIVE DATALOG PROGRAMS

引用

26th International Conference on Logic programming (ICLP)

作者： Alviano, Mario Univ Calabria Dept Math I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783939897170

answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and non monotonic negation in bodies. Magic sets are a technique for optimizing query answering over logic programs and have been originally defined for standard Datalog, that is, ASP without disjunction and negation. Essentially, the input program is rewritten in order to identify a subset of the program instantiation which is sufficient for answering the query. Dynamic Magic sets (DMS) are an extension of this technique to ASP. The optimization provided by DMS can be exploited also during the nondeterministic phase of ASP systems. In particular, after some assumptions have been made during the computation, parts of the program may become irrelevant to a query (because of these assumptions). This allows for dynamic pruning of the search space, which may result in exponential performance gains. DMS has been implemented in the DLV system and experimental results confirm the effectiveness of the technique.

关键词： answer set programming decidability magic sets disjunctive logic programs

来源：评论

学校读者我要写书评

暂无评论

External Computations and Interoperability in the New DLV Grounder 16th

External Computations and Interoperability in the New DLV Gr...

引用

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

作者： 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: (纸本)9783319701691;9783319701684

In this paper we focus on some of the most recent advancements in I-DLV, the new intelligent grounder of DLV;the system has been endowed with means aimed at easing the interoperability and integration with external systems and accommodating external source of computation and value invention within ASP programs. In particular, we describe here the support for external computations via explicit calls to Python scripts, and tools for the interoperability with both relational and graph databases.

关键词： Knowledge representation and reasoning answer set programming DLV Artificial Intelligence Deductive database systems Grounding Instantiation

来源：评论

学校读者我要写书评

暂无评论

Decomposition-Based Job-Shop Scheduling with Constrained Clustering 24th

Decomposition-Based Job-Shop Scheduling with Constrained Cl...

引用

24th International Conference on Practical Aspects of Declarative Languages, PADL 2022

作者： El-Kholany, Mohammed M. S. Schekotihin, Konstantin Gebser, Martin Alpen-Adria-Universität Klagenfurt Klagenfurt Austria Technische Universität Graz Graz Austria Cairo University Cairo Egypt

ISBN: (纸本)9783030944780

Scheduling is a crucial problem appearing in various domains, such as manufacturing, transportation, or healthcare, where the goal is to schedule given operations on available resources such that the operations are completed as soon as possible. Unfortunately, most scheduling problems cannot be solved efficiently, so that research on suitable approximation methods is of primary importance. This work introduces a novel approximation approach based on problem decomposition with data mining methodologies. We propose a constrained clustering algorithm to group operations into clusters, corresponding to time windows in which the operations must be scheduled. The decomposition process consists of two main phases. First, features are extracted, either from the problem itself or from solutions obtained by heuristic methods, to predict the execution sequence of operations on each resource. The second phase deploys our constrained clustering algorithm to assign each operation into a time window. We then schedule the operations by time windows using answer set programming. Evaluation results show that our proposed approach outperforms other heuristic schedulers in most cases, where incorporating features like Remaining Processing Time, Machine Load, and Earliest Starting Time significantly improves the solution quality. © 2022, Springer Nature Switzerland AG.

关键词： answer set programming Constrained clustering Job-shop Scheduling Problem Time windows

来源：评论

学校读者我要写书评

暂无评论

Specification and execution of declarative policies for grid service selection

引用

European Conference on Web Services (ECOWS 2004)

作者： Marchi, M Mileo, A Provetti, A Univ Milan DSI I-20135 Milan Italy Univ Milan DICo I-20135 Milan Italy Univ Messina Dipartimento Fis I-98166 Messina Italy

ISBN: (纸本)3540232028

We describe a modified Grid architecture that allows to specify and enforce connection policies with preferences and integrity constraints. This is done by interposing a policy enforcement engine between a calling application and the relative client stubs. Such policies are conveniently expressed in the declarative policy specification language PPDL. In particular, PPDL allows expressing preferences on how to enforce constraints on action execution. PPDL policies are evaluated by translating them into a Logic Program with Ordered Disjunctions and calling the psmodels interpreter. We describe an experimental architecture that enforces connection policies by catching and filtering only service requests. The process is completely transparent to both client applications and Grid services. There are clear advantages in having the connection logic expressed declaratively and externally to applications.

关键词： grid services customization user preferences declarative policies answer set programming

来源：评论

学校读者我要写书评

暂无评论

Multi-modal multi-agent path finding with optimal resource utilization 5th

Multi-modal multi-agent path finding with optimal resource u...

引用

5th International Conference on the Industry 4.0 Model for Advanced Manufacturing, AMP 2020

作者： Bogatarkan, Aysu Erdem, Esra Kleiner, Alexander Patoglu, Volkan Faculty of Engineering and Natural Sciences Sabancı University İstanbul Turkey Robert Bosch GmbH Corporate Research Stuttgart Germany

ISBN: (纸本)9783030462116

The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other. We study a general version of MAPF, called mMAPF, that involves further challenges, such as multi-modal transportation modes, a set of waypoints to visit for each agent, and consumption of different types of resources. We introduce a declarative method to solve mMAPF, using answer set programming that provides a flexible formal framework to address all these challenges while optimizing multiple objectives. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020.

关键词： answer set programming Autonomous warehouses Declarative problem solving Multi-agent Path Finding

来源：评论

学校读者我要写书评

暂无评论

Introducing Constraint Well-Founded Semantics for Constraint Logic programming Through Rewriting Transformations

Introducing Constraint Well-Founded Semantics for Constraint...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Bryan Garreau Martin Dieguez Lodeiro Eric Monfroy Igor Stéphan Université d'Angers Angers France

ISBN: (数字)9798331527235

ISBN: (纸本)9798331527242

Constraint answer set programming (CASP) combines answer set programming (ASP) and Constraint programming (CP) to offer a powerful framework for solving complex problems. While there exists various ways to represent CASP problems, fusing both in a way that benefits both communities remains difficult to this day. To address this, we propose to extend the Well Founded Semantics (WFS) to propositional constraint logic programs. To this end, we present an iterative process involving elementary rewriting transformations to simplify the program iteratively. Our method aims to give a better description of the interactions between ASP and CP inside of a constraint logic program.

关键词： Constraint handling Semantics answer set programming Logic Iterative methods Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Synthesis of CNOT minimal quantum circuits with topological constraints through ASP

Synthesis of CNOT minimal quantum circuits with topological ...

引用

2023 International Workshop on AI for Quantum and Quantum for AI, AIQxQIA 2023

作者： Piazza, Carla Romanello, Riccardo Dipartimento di Scienze Matematiche Informatiche e Fisiche Università degli Studi di Udine Italy

Although with some yet severe limitations, Physical working Quantum Computers are becoming available for end users. Such devices are based on the rules of Quantum Mechanics, which state that physical systems evolve through unitary transformations. However, as in the classical case, in order to have a model of computation, such unitary evolutions are expressed/approximated inside Quantum Computers in terms of a finite set of one/two qubit operations (i.e., through a universal set of gates). Single qubit gates are fault-tolerant, while the same cannot be said for two qubit gates. Hence, unitary matrices adopted in Quantum Algorithms must be synthesized in terms of this universal set of operations to obtain a quantum circuit. In such synthesis procedure we prefer circuits with minimum number of qubits and with minimum circuit depth. Clifford+T universal set is one of the most adopted in the literature for synthesis. In such set we have 3 single qubit gates and the CNOT, which is a two qubit gate. Many efforts have been directed to devise algorithms that synthesize general unitary matrices into Clifford+T circuits. These algorithms usually tend to optimize circuit depth or eventually the number of T gates. Since two qubit gates are not fault tolerant, in this work we propose an ASP based technique to minimize the number of CNOT gates inside a Clifford+T circuit. Moreover, in real world quantum computers, qubit are usually connected to each other according to some particular topology, thus providing further constraints. Two qubit gates —hence, CNOT gate— can be directly applied only to pair of gates that are connected. Such constraint has to be taken into account during the synthesis of CNOT minimal circuits. We propose an ASP model to solve the problem of synthesizing CNOT minimal circuits under topological constraints. We provide experimental evidence of the scalability of our proposal. © 2023 Copyright for this paper by its authors. Use permitted under Creative Common

关键词： answer set programming Clifford+T Synthesis CNOT Minimization Quantum Circuit Synthesis Topological Constraint

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 77 78 79 80 81 82 83 84 85 86 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：