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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

检索条件"任意字段=7th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 719 条记录，以下是561-570 订阅

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

详细简洁

排序：

NoMoRe: A system for non-monotonic reasoning under answer set semantics

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Anger, Christian Konczak, Kathrin Linke, thomas Universitãt Potsdam Institut für Informatik Germany

ISBN: (纸本)3540425934

NoMoRe implements answer set semantics for normal logic programs. It realizes a novel paradigm to compute answer sets by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a labeled digraph) associated with a given program P (see [5] for details). Intuitively, an a-coloring reflects the set of generating rules for an answer set, which means that noMoRe is rule-based and not atom-based like most of the other known systems. Since the core system was designed for propositional programs only, we have integrated lparse [8] as a grounder in order to deal with variables. Furthermore, we have included an interface to the graph drawing tool DaVinci [6] for visualization of block graphs. this allows for a structural analysis of programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Principles and Practice of Constraint programming, CP 2001

引用

7th international conference on Principles and Practice of Constraint programming, CP 2001

ISBN: (纸本)3540428631

the proceedings contain 84 papers. the special focus in this conference is on Principles and Practice of Constraint programming. the topics include: Hybrid benders decomposition algorithms in constraint logic programming;a hybrid framework integrating mixed integer programming and constraint logic programming;towards stochastic constraint programming;global cut framework for removing symmetries;capturing structure with satisfiability;phase transitions and backbones of 3-sat and maximum 3-sat;solving non-binary CSPS using the hidden variable encoding;a filtering algorithm for the stretch constraint;network flow problems in constraint programming;pruning for the minimum constraint family and for the number of distinct values constraint family;components for state restoration in tree search;constraint-based verification of client-server protocols;lower bounds for non-binary constraint optimization problems;a general scheme for multiple lower bound computation in constraint optimization;solving disjunctive constraints for interactive graphical applications;non-overlapping constraints between convex polytopes;formal models of heavy-tailed behavior in combinatorial search;in search of a phase transition in the ac-matching problem;a CLP approach to the protein side-chain placement problem;solving constraints over floating-point numbers;optimal pruning in parametric differential equations;an efficient filtering technique combining domain partition and arc consistency;the expressive power of binary linear programming;the traveling tournament problem description and benchmarks;structural constraint-based modeling and reasoning with basic configuration cells;solving Boolean satisfiability using local search guided by unit clause elimination and fast optimal instruction scheduling for single-issue processors with arbitrary latencies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Searching for invariants using temporal resolution 1

引用

9th international conference on logic for programming, Artificial Intelligence and reasoning

作者： Brotherston, J Degtyarev, A Fisher, M Lisitsa, A Univ Edinburgh Div Informat Edinburgh EH1 1HN Midlothian Scotland Univ Liverpool Dept Comp Sci Liverpool L69 7ZF Merseyside England

ISBN: (数字)9783540360780

ISBN: (纸本)3540000100

In this paper, we show how the clausal temporal resolution technique developed for temporal logic provides an effective method for searching for invariants. and so is suitable for mechanising a wide class of temporal problems. We demonstrate that this scheme of searching for invariants can be also applied to a class of multi-predicate induction problems represented by mutually recursive definitions. Completeness of the approach, examples of the application of the scheme, and overview of the implementation are described.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Automatic certification of heap consumption

引用

11th international conference on logic for programming, Artificial Intelligence, and reasoning

作者： Beringer, L Hofmann, M Momigliano, A Shkaravska, O Univ Edinburgh Lab Fdn Comp Sci Edinburgh EH9 3JZ Midlothian Scotland Univ Munich Inst Informat D-80538 Munich Germany

ISBN: (纸本)3540252363

We present a program logic for verifying the heap consumption of low-level programs. the proof rules employ a uniform assertion format and have been derived from a general purpose program logic [1]. In a proof-carrying code scenario, the inference of invariants is delegated to the code provider, who employs a certifying compiler that generates a certificate from program annotations and analysis. the granularity of the proof rules matches that of the linear type system presented in [6], which enables us to perform verification by replaying typing derivations in a theorem prover, given the specifications of individual methods. the resulting verification conditions are of limited complexity, and are automatically discharged. We also outline a proof system that relaxes the linearity restrictions and relates to the type system of usage aspects presented in [2].

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Survey of Domain-Specific Languages for FPGA Computing 26

Survey of Domain-Specific Languages for FPGA Computing

引用

26th international conference on Field-Programmable logic and Applications (FPL)

作者： Kapre, Nachiket Bayliss, Samuel Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore Imperial Coll London Dept Elect & Elect Engn London SW7 2BT England

ISBN: (纸本)9782839918442

High-performance FPGA programming has typically been the exclusive domain of a small band of specialized hardware developers. they are capable of reasoning about implementation concerns at the register-transfer level (RTL) which is analogous to assembly-level programming in software. Sometimes these developers are required to push further down to manage even lower levels of abstraction closer to physical aspects of the design such as detailed layout to meet critical design constraints. In contrast, software programmers have long since moved away from textual assembly-level programming towards relying on graphical integrated development environments (IDEs), high-level compilers, smart static analysis tools and runtime systems that optimize, manage and assist the program development tasks. Domain-specific languages (DSLs) can bridge this productivity gap by providing higher levels of abstraction in environments close to the domain of application expert. DSLs carefully limit the set of programming constructs to minimize programmer mistakes while also enabling a rich set of domain-specific optimizations and program transformations. With a large number of DSLs to choose from, an inexperienced FPGA user may be confused about how to select an appropriate one for the intended domain. In this paper, we review a combination of legacy and state-of-the-art DSLs available for FPGA development and provide a taxonomy and classification to guide selection and correct use of the framework.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Handling equality in monodic temporal resolution 1

引用

10th international conference on logic for programming, Artificial Intelligence, and reasoning (LPAR2003)

作者： Konev, B Degtyarev, A Fisher, M Univ Liverpool Dept Comp Sci Liverpool L69 7ZF Merseyside England Kings Coll London Dept Comp Sci London WC2R 2LS England

ISBN: (数字)9783540398134

ISBN: (纸本)3540201017

First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments including the guarded fragment with equality. In this paper, we specialise the monodic resolution method to the guarded monodic fragment with equality and first-order temporal logic over expanding domains. We introduce novel resolution calculi that can be applied to formulae in the normal form associated with the clausal resolution method, and state correctness and completeness results.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Compacting boolean formulae for inference in probabilistic logic programming 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, LPNMR 2015

作者： Mantadelis, theofrastos Shterionov, Dimitar Janssens, Gerda CRACS and INESC TEC University of Porto Rua do Campo Alegre 1021/1055 Porto4169-007 Portugal Department of Computer Science KU Leuven Celestijnenlaan 200A Heverlee2402 3001 Belgium

ISBN: (纸本)9783319232638

Knowledge compilation converts Boolean formulae for which some inference tasks are computationally expensive into a representation where the same tasks are tractable. ProbLog is a state-of-the-art Probabilistic logic programming system that uses knowledge compilation to reduce the expensive probabilistic inference to an efficient weighted model counting. Motivated to improve ProbLog’s performance we present an approach that optimizes Boolean formulae in order to speed-up knowledge compilation. We identify 7 Boolean subformulae patterns that can be used to re-write Boolean *** implemented an algorithm with polynomial complexity which detects and compacts 6 of these patterns. We employ our method in the inference pipeline of ProbLog and conduct extensive experiments. We show that our compaction method improves knowledge compilation and consecutively the overall inference performance. Furthermore, using compaction reduces the number of time-outs, allowing us to solve previously unsolvable problems. © Springer international Publishing Switzerland 2015.

关键词： Compaction

来源：评论

学校读者我要写书评

暂无评论

Strong equivalence for logic programs and default theories (Made Easy)

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Turner, Hudson Computer Science Department University of Minnesota Duluth Duluth MN 55812 United States

ISBN: (纸本)3540425934

logic programs P and Q are strongly equivalent if, given any logic program R, programs P ∩ R and Q ∩ R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Recently, Lifschitz, Pearce and Valverde showedthat Heyting's logic of here-and-there can be used to characterize strong equivalence of logic programs. this paper offers a more direct characterization, and extends it to default logic. In their paper, Lifschitz, Pearce and Valverde study a very general form of logic programs, called" nested" programs. For the study of strong equivalence of default theories, it is convenient to introduce a corresponding "nested" version of default logic, which generalizes Reiter's default logic. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

An abductive approach for analysing event-based requirements specifications

引用

18th international conference on logic programming

作者： Russo, A Miller, R Nuseibeh, B Kramer, J Univ London Imperial Coll Sci Technol & Med London SW7 2BT England UCL London WC1E 6BT England Open Univ Milton Keynes MK7 6AA Bucks England

ISBN: (纸本)3540439307

We present a logic and logic programming based approach for analysing event-based requirements specifications given in terms of, a system's reaction to events and safety properties. the approach uses a variant of Kowalski and Sergot's Event Calculus to represent such specifications declaratively and an abductive reasoning mechanism for analysing safety properties. Given a system description and a safety property, the abductive mechanism is able to identify a complete set of counterexamples (if any exist) of the property in terms of symbolic ''current" states and associated event-based transitions. A case study of an automobile cruise control system specified in the SCR framework is used to illustrate our approach. the technique described is implemented. using existing tools for abductive logic programming.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic and Argumentation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Pietro Baroni Christoph Benzmüller Yὶ N. Wáng

ISBN: (数字)9783030893910

ISBN: (纸本)9783030893903

this book constitutes the refereed proceedings of the 4th international conference on logic and Argumentation, CLAR 2021, held in Hangzhou, China, in October 2021. the 20 full and 10 short papers presented together with 5 invited papers were carefully reviewed and selected from 58 submissions. the topics of accepted papers cover the focus of the CLAR series, including formal models of argumentation, a variety of logic formalisms, nonmonotonic reasoning, dispute and dialogue systems, formal treatment of preference and support, and well as applications in areas like vaccine information and processing of legal texts.

关键词： Artificial Intelligence programming Techniques programming Languages, Compilers, Interpreters Algorithm Analysis and Problem Complexity logics and Meanings of Programs Mathematical logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：