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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

162 篇 会议
16 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

134 篇 工学
- 127 篇 计算机科学与技术...
- 60 篇 软件工程
- 14 篇 电气工程
- 13 篇 控制科学与工程
- 6 篇 机械工程
- 5 篇 信息与通信工程
- 4 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 环境科学与工程（可...
24 篇 理学
- 19 篇 数学
- 3 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
9 篇 管理学
- 8 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
2 篇 艺术学
- 2 篇 设计学（可授艺术学...
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学

主题

56 篇 logic programmin...
14 篇 mathematical log...
12 篇 logics and meani...
10 篇 artificial intel...
9 篇 programming lang...
8 篇 software enginee...
7 篇 computer circuit...
7 篇 formal logic
6 篇 semantics
5 篇 temporal logic
4 篇 optimization
4 篇 programming tech...
4 篇 algorithm analys...
4 篇 knowledge repres...
3 篇 fuzzy logic
3 篇 programmable log...
3 篇 higher-order log...
3 篇 programming
3 篇 symbolic and alg...
3 篇 computer communi...

机构

3 篇 new mexico state...
2 篇 tu wien austria
2 篇 tech univ munich...
2 篇 eth dept comp sc...
2 篇 institute of log...
2 篇 katholieke univ ...
2 篇 univ massachuset...
2 篇 imdea software i...
2 篇 michigan state u...
2 篇 univ hawaii dept...
2 篇 suny stony brook...
2 篇 temple univ dept...
1 篇 univ calabria de...
1 篇 national institu...
1 篇 escola politécni...
1 篇 laboratoire pps ...
1 篇 new mexico state...
1 篇 university of te...
1 篇 univ aizu grad s...
1 篇 department of in...

作者

3 篇 eiter thomas
2 篇 pontelli e
2 篇 giovannetti tani...
2 篇 leone nicola
2 篇 avrunin gs
2 篇 sakama chiaki
2 篇 yamaguchi takehi...
2 篇 mehta f
2 篇 fink m
2 篇 woltran stefan
2 篇 martono niken pr...
2 篇 eiter t
2 篇 serebrenik a
2 篇 sciavicco guido
2 篇 ohwada hayato
2 篇 faber wolfgang
2 篇 abe keisuke
2 篇 nipkow t
2 篇 dillon lk
2 篇 inoue katsumi

语言

182 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=19th International Conference on Logic Programming, ICLP 2003"

共 184 条记录，以下是111-120 订阅

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

详细简洁

排序：

A logic programming approach to querying and integrating P2P deductive databases

A logic programming approach to querying and integrating P2P...

引用

FLAIRS 2006 - 19th international Florida Artificial Intelligence Research Society conference

作者： Caroprese, L. Greco, S. Zumpano, E. DEIS Univ. della Calabria 87030 Rendo Italy

the paper proposes a logic framework for modeling the interaction among deductive databases and computing consistent answers to logic queries in a P2P environment. As usual, data are exchanged among peers by using logical rules, called mapping rules. the novelty of our approach is that only data not violating integrity constraints are exchanged. the (declarative) semantics of a P2P system is defined in terms of weak models. Under this semantics only facts not making the local databases inconsistent are imported, and the preferred weak models are those in which peers import maximal sets of facts not violating integrity constraints. An equivalent and alternative characterization of preferred weak model semantics, in terms of prioritized logic programs, is also introduced and the computational complexity of P2P logic queries is investigated. Copyright © 2006, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Confidentiality-preserving publishing of EDPs for credulous and skeptical users 1

引用

19th international conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th Workshop on logic programming, WLP 2011

作者： Inoue, Katsumi Sakama, Chiaki Wiese, Lena National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-kuTokyo101-8430 Japan Department of Computer and Communication Sciences Wakayama University 930 Sakaedani Wakayama640-8510 Japan Institute of Computer Science Georg-August-Universität Göttingen Goldschmidtstr. 7 Göttingen37077 Germany

ISBN: (数字)9783642415241

ISBN: (纸本)9783642415234

Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study the problem of confidentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality. © Springer-Verlag Berlin Heidelberg 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Proving pointer programs in higher-order logic 19th

引用

19th international conference on Automated Deduction (CADE-19)

作者： Mehta, F Nipkow, T ETH Dept Comp Sci Zurich Switzerland Tech Univ Munich Inst Informat D-8000 Munich Germany

ISBN: (纸本)3540405593;9783540405597

Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are mapped to higher-level data types for verification. the programming language is embedded in higher-order logic. Its Hoare logic is derived. the whole development is purely definitional and thus sound. Apart from some smaller examples, the viability of this approach is demonstrated with a non-trivial case study. We show the correctness of the Schorr-Waite graph marking algorithm and present part of its readable proof in Isabelle/HOL. (c) 2005 Elsevier Inc. All rights reserved.

关键词： pointer programs verification Hoare logic higher-order logic Schorr-Waite algorithm

来源：评论

学校读者我要写书评

暂无评论

A preliminary report on integrating of answer set and constraint solving

A preliminary report on integrating of answer set and constr...

引用

3rd international Workshop on Answer Set programming: Advances in theory and Implementation, ASP 2005, Co-located Event with the 19th international Joint conference on Artificial Intelligence, IJCAI 2005

作者： Baselice, Sabrina Bonatti, Piero Gelfond, M. Dipartimento di Scienze Fisiche Università Federico II Complesso Universitario di Monte Sant'Angelo Via Cinthia Napoli Italy Texas Tech. University Department of Computer Science Lubbock TX United States

Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning starts. this prevents ASP to be effective on several classes of problems. In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. We prove some theoretical results, introduce a provably sound and complete algorithm, and report experimental results showing that our approach can solve problem instances with significantly larger domains.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Based Approach of Botnet Detection in Computer Systems

Multi-agent Based Approach of Botnet Detection in Computer S...

引用

19th international conference on Computer Networks

作者： Savenko, Oleg Lysenko, Sergiy Kryschuk, Andriy Khmelnytskyi Natl Univ Inst Telecommun & Comp Syst Dept Syst Programming Khmelnytskyi Ukraine

ISBN: (纸本)9783642312168

A new approach for the botnet detection based on multi-agent system is proposed. For increasing of the efficiency of botnet detection multi-agent systems were involve that allowed to make antivirus diagnosis via agents' communication within corporate network. the structure and main principles of antiviral agents' functioning within multi-agent system are developed. the principles of communication between the agent's units before and after attack on the computer system were developed. A new technique for sensor diagnosis in monitor mode which uses fuzzy logic was developed. A new technique for sensor diagnosis in scanner mode with generation of detectors using the modified negative selection algorithm was developed.

关键词： botnet Trojan worm-virus antivirus detection multi-agent system agent sensor fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Automata, Languages and programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540472780

ISBN: (纸本)9783540557197

this volume presents the proceedings of the 19th international Colloquium onAutomata, Languages, and programming (ICALP 92) in a series of meetings sponsored by the European Association for theoretical Computer Science (EATCS). ICALP is a broadly based conference covering all aspects of theoretical computer science, including such topics as computability, automata, formal languages, term rewriting, analysis of algorithms, computational geometry, computational complexity, symbolic and algebraic computation, cryptography, data types and data structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design andlayout, parallel and distributed computation, theory of concurrency, and theory of robotics. the papers in the volume are grouped into thematic parts corresponding to their order of presentation at ICALP 92.

关键词： theory of Computation logics and Meanings of Programs Algorithm Analysis and Problem Complexity Mathematical logic and Formal Languages Data Structures Combinatorics

来源：评论

学校读者我要写书评

暂无评论

Unit testing in ASPIDE 19th

Unit testing in ASPIDE

引用

19th international conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th Workshop on logic programming, WLP 2011

作者： Febbraro, Onofrio Leone, Nicola Reale, Kristian Ricca, Francesco DLVSystem s.r.l. - P.zza Vermicelli Polo Tecnologico Rende87036 Italy Dipartimento di Matematica Università della Calabria Rende87036 Italy

ISBN: (纸本)9783642415234

Answer Set programming (ASP) is a declarative logic programming formalism, which is employed nowadays in both academic and industrial real-world applications. Although some tools for supporting the development of ASP programs have been proposed in the last few years, the crucial task of testing ASP programs received less attention and it is an Achilles’ heel of the available programming environments. In this paper we present a language for specifying and running unit tests on ASP programs. the testing language was implemented in ASPIDE, a comprehensive IDE for ASP, which supports the entire life cycle of ASP development with a collection of user-friendly graphical tools for program composition, testing, debugging, profiling, solver execution configuration, and output handling. © Springer-Verlag Berlin Heidelberg 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck (Extended Abstract) 39

Body-Decoupled Grounding via Solving: A Novel Approach on th...

引用

39th international conference on logic programming, iclp 2023

作者： Besin, Viktor Hecher, Markus Woltran, Stefan TU Wien Austria Massachusetts Institute of Technology United States

Answer-Set programming (ASP) has seen tremendous progress over the last two decades and is nowadays successfully applied in many real-world domains. However, for certain problems, the well-known ASP grounding bottleneck still causes severe problems. this becomes virulent when grounding of rules, where the variables have to be replaced by constants, leads to a ground program that is too huge to be processed by the ASP solver. In this work, we tackle this problem by a novel method that decouples non-ground atoms in rules in order to delegate the evaluation of rule bodies to the solving process. Our procedure translates a non-ground normal program into a ground disjunctive program that is exponential only in the maximum predicate arity, and thus polynomial if this arity is bounded by a constant. We demonstrate the feasibility of this new method experimentally by comparing it to standard ASP technology in terms of grounding size, grounding time and runtime. © 2023 Open Publishing Association. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A backjumping technique for disjunctive logic programming

A backjumping technique for disjunctive logic programming

引用

作者： Faber, Wolfgang Leone, Nicola Ricca, Francesco Italy

In this work we present a backjumping technique for Disjunctive logic programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been proposed for propositional satisfiability testing, which have been adapted to non-disjunctive Answer Set programming (ASP) recently [1,2]. We focus on backjumping without clause learning. We provide a new theoretical framework for backjumping on Disjunctive logic Programs. We optimize the reason calculus, reducing the information to be stored, while fully preserving the correctness and the efficiency of the jumping technique. We implement the proposed technique in DLV, the state-of-the-art DLP system. We have conducted several experiments on hard random problems in order to assess the impact of backjumping. Our conclusion is that when lookahead is employed, there is basically no advantage when enabling backjumping. However, when lookahead is disabled, we can observe that the number of choices in general decreases by a non-negligible factor. In our (naive) implementation this gain is (often more than) compensated by the additional overhead incurred by the reason calculus. It is unclear whether one can reduce this overhead by a more efficient implementation. We therefore conjecture that, at least on hard unstructured instances, backjumping only has an impact when lookahead is not active and when clause learning is employed in addition.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Argumentation-Based Semantics for logic Programs with First-Order Formulae 19th

Argumentation-Based Semantics for Logic Programs with First-...

引用

19th international conference on Principles and Practice of Multi-Agent Systems (PRIMA)

作者： Phan Minh Dung Tran Cao Son Phan Minh thang Asian Inst Technol Dept Comp Sci Klongluang Thailand New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Burapha Univ Int Coll Dept Comp Sci Bangsaen Thailand

ISBN: (纸本)9783319448329;9783319448312

this paper studies different semantics of logic programs with first order formulae under the lens of argumentation framework. It defines the notion of an argumentation-based answer set and the notion of an argumentation-based well-founded model for programs with first order formulae. the main ideas underlying the new approach lie in the notion of a proof tree supporting a conclusion given a program and the observation that proof trees can be naturally employed as arguments in an argumentation framework whose stable extensions capture the program's well justified answer semantics recently introduced in [23]. the paper shows that the proposed approach to dealing with programs with first order formulae can be easily extended to a generalized class of logic programs, called programs with FOL-representable atoms, that covers various types of extensions of logic programming proposed in the literature such as weight constraint atoms, aggregates, and abstract constraint atoms. For example, it shows that argumentation-based well-founded model is equivalent to the well-founded model in [27] for programs with abstract constraint atoms. Finally, the paper relates the proposed approach to others and discusses possible extensions.

关键词： logic programming formula Semantics semiotics Atoms Formal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：