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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,062 篇 会议
51 册 图书
43 篇 期刊文献

馆藏范围

2,156 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,279 篇 工学
- 1,032 篇 计算机科学与技术...
- 582 篇 软件工程
- 253 篇 电气工程
- 165 篇 控制科学与工程
- 77 篇 信息与通信工程
- 50 篇 机械工程
- 42 篇 材料科学与工程（可...
- 36 篇 电子科学与技术（可...
- 25 篇 安全科学与工程
- 23 篇 交通运输工程
- 19 篇 仪器科学与技术
- 17 篇 石油与天然气工程
- 13 篇 网络空间安全
- 12 篇 土木工程
- 12 篇 化学工程与技术
- 12 篇 生物医学工程（可授...
- 12 篇 生物工程
- 11 篇 冶金工程
- 11 篇 动力工程及工程热...
303 篇 理学
- 227 篇 数学
- 39 篇 统计学（可授理学、...
- 38 篇 物理学
- 34 篇 系统科学
- 24 篇 化学
- 22 篇 生物学
126 篇 管理学
- 91 篇 管理科学与工程(可...
- 40 篇 图书情报与档案管...
- 37 篇 工商管理
47 篇 教育学
- 46 篇 教育学
25 篇 医学
- 24 篇 临床医学
10 篇 法学
9 篇 经济学
5 篇 农学
4 篇 文学

主题

172 篇 logic gates
141 篇 fuzzy logic
129 篇 programming
118 篇 linear programmi...
94 篇 logic programmin...
65 篇 probabilistic lo...
59 篇 dynamic programm...
57 篇 optimization
52 篇 semantics
50 篇 training
49 篇 computer science
48 篇 logic
44 篇 object oriented ...
42 篇 computer archite...
41 篇 computational mo...
38 篇 hardware
38 篇 artificial intel...
37 篇 java
35 篇 computer program...
35 篇 software

机构

6 篇 laboratory of co...
5 篇 stevens inst tec...
5 篇 institute of log...
5 篇 university of to...
5 篇 institute for lo...
5 篇 chinese univ hon...
4 篇 univ oxford oxfo...
4 篇 school of electr...
4 篇 ibm corp thomas ...
3 篇 north carolina s...
3 篇 creighton univ o...
3 篇 univ politecn ca...
3 篇 ecole polytech f...
3 篇 tu wien austria
3 篇 department of co...
3 篇 department of el...
3 篇 rhein westfal th...
3 篇 school of comput...
3 篇 univ tokyo
3 篇 school of mathem...

作者

7 篇 inoue katsumi
5 篇 sakama chiaki
5 篇 gupta gopal
4 篇 wang liang
4 篇 iosif radu
4 篇 pontelli enrico
4 篇 liang wang
4 篇 tompits hans
4 篇 beck j. christop...
3 篇 kumar amruth n.
3 篇 chopra amit k.
3 篇 proietti maurizi...
3 篇 il han park
3 篇 m.-r. akbarzadeh...
3 篇 wei li
3 篇 riguzzi fabrizio
3 篇 schaub torsten
3 篇 melin p
3 篇 leonidas deligia...
3 篇 mcdirmid sean

语言

2,063 篇 英文
81 篇 其他
20 篇 中文
1 篇 西班牙文
1 篇 法文

检索条件"任意字段=22nd International Conference on Logic Programming"

共 2156 条记录，以下是1301-1310 订阅

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

详细简洁

排序：

Heuristic inverse subsumption in full-clausal theories

引用

22nd international conference on Inductive logic programming, ILP 2012

作者： Yamamoto, Yoshitaka Inoue, Katsumi Iwanuma, Koji University of Yamanashi 4-3-11 Takeda Kofu-shi Yamanashi 400-8510 Japan National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-ku Tokyo 101-8430 Japan

ISBN: (纸本)9783642388118

Inverse entailment (IE) is a fundamental approach for hypothesis finding in explanatory induction. Some IE systems can find any hypothesis in full-clausal theories, but need several non-deterministic operators that treat the inverse relation of entailment. In contrast, inverse subsumption (IS) is an alternative approach for finding hypotheses with the inverse relation of subsumption. Recently, it has been shown that IE can be logically reduced into a new form of IS, provided that it ensures the completeness of finding hypotheses in full-clausal theories. On the other hand, it is still open to clarify how the complete IS works well in the practical point of view. For the analysis, we have implemented it with heuristic lattice search techniques used in the state-of-the-art ILP systems. This paper first sketches our IS system, and then shows its experimental result suggesting that the complete IS can practically find better hypotheses with high predictive accuracies. © 2013 Springer-Verlag.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Proving properties of co-logic programs with negation by program transformations

Proving properties of co-logic programs with negation by pro...

引用

22nd international Symposium on logic-Based Program Synthesis and Transformation, LOPSTR 2012

作者： Seki, Hirohisa Dept. of Computer Science Nagoya Inst. of Technology Showa-ku Nagoya 466-8555 Japan

ISBN: (纸本)9783642381966

A framework for unfold/fold transformation of (constraint) co-logic programs has been proposed recently, which can be used to prove properties of co-logic programs, thereby allowing us to reason about infinite sequences of events such as behavior of reactive systems. The main problem with this approach is that only definite co-logic programs are considered, thus representing a rather narrow class of co-logic programs. In this paper we consider "negation elimination", a familiar program transformation method, tailored to co-logic programs;given a program for predicate p(X), negation elimination derives a program which computes its negation ¬p(X), when the program satisfies certain conditions. We show that negation elimination can be used for co-logic programs, and its application is correct under the alternating fixpoint semantics of co-logic programs. We show by examples how negation elimination, when incorporated into the previous framework for unfold/fold transformation, allows us to represent and reason about a wider class of co-logic programs. We also discuss the difference between negation elimination applied to co-logic programs and the conventional negative unfolding applied to stratified programs. © 2013 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

One-variable first-order linear temporal logics with counting 22

One-variable first-order linear temporal logics with countin...

引用

22nd Annual conference of the European Association for Computer Science logic EACSL, CSL 2013

作者： Hampson, Christopher Kurucz, Agi Department of Informatics King's College London United Kingdom

ISBN: (纸本)9783939897606

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various timelines. However, following the introduction of the monodic formulas (where temporal operators can be applied only to subformulas with at most one free variable), there has been a renewed interest in understanding extensions of the one-variable fragment and identifying those that are decidable. Here we analyse the one-variable fragment of temporal logic extended with counting (to two), interpreted in models with constant, decreasing, and expanding first-order domains. We show that over most classes of linear orders these logics are (sometimes highly) undecidable, even without constant and function symbols, and with the sole temporal operator 'eventually'. A more general result says that the bimodal logic of commuting linear and pseudo-equivalence relations is undecidable. The proofs are by reductions of various counter machine problems. © Christopher Hampson and Agi Kurucz.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Tableaux for Verification of Data-Centric Processes 1

引用

22nd international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Bauer, Andreas Baumgartner, Peter Diller, Martin Norrish, Michael NICTA Sydney NSW Australia ANU Hyderabad Andhra Pradesh India

ISBN: (数字)9783642405372

ISBN: (纸本)9783642405365

Current approaches to analyzing dynamic systems are mostly grounded in propositional (temporal) logics. As a consequence, they often lack expressivity for modelling rich data structures and reasoning about them in the course of a computation. To address this problem, we propose a rich modelling framework based on first-order logic over background theories (arithmetics, lists, records, etc) and state transition systems over corresponding interpretations. On the reasoning side, we introduce a tableau calculus for bounded model checking of properties expressed in a certain fragment of CTL* over that first-order logic. We also describe a k-induction scheme on top of that calculus for proving safety properties, and we report on first experiments with a prototypical implementation.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Probing the space of optimal Markov logic networks for sequence labeling

引用

22nd international conference on Inductive logic programming, ILP 2012

作者： Nair, Naveen Nagesh, Ajay Ramakrishnan, Ganesh IITB-Monash Research Academy Old CSE Building IIT Bombay India Department of Computer Science and Engineering IIT Bombay India Faculty of Information Technology Monash University Australia

ISBN: (纸本)9783642388118

Discovering relational structure between input features in sequence labeling models has shown to improve their accuracies in several problem settings. The problem of learning relational structure for sequence labeling can be posed as learning Markov logic Networks (MLN) for sequence labeling, which we abbreviate as Markov logic Chains (MLC). This objective in propositional space can be solved efficiently and optimally by a Hierarchical Kernels based approach, referred to as StructRELHKL, which we recently proposed. However, the applicability of StructRELHKL in complex first order settings is non-trivial and challenging. We present the challenges and possibilities for optimally and simultaneously learning the structure as well as parameters of MLCs (as against learning them separately and/or greedily). Here, we look into leveraging the StructRELHKL approach for optimizing the MLC learning steps to the extent possible. To this end, we categorize first order MLC features based on their complexity and show that complex features can be constructed from simpler ones. We define a self-contained class of features called absolute features (AF), which can be conjoined to yield complex MLC features. Our approach first generates a set of relevant AFs and then makes use of the algorithm for StructRELHKL to learn their optimal conjunctions. We demonstrate the efficiency of our approach by evaluating on a publicly available activity recognition dataset. © 2013 Springer-Verlag.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Leibniz international Proceedings in Informatics, LIPIcs

Leibniz International Proceedings in Informatics, LIPIcs

引用

22nd Annual conference of the European Association for Computer Science logic EACSL, CSL 2013

ISBN: (纸本)9783939897606

The proceedings contain 41 papers. The topics discussed include: Res Publica: the universal model of computation;means and limits of decision;from determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace;descriptive complexity of approximate counting CSPs;team building in dependence;unambiguity and uniformization problems on infinite trees;bounds for the quantifier depth in finite-variable logics: alternation hierarchy;annotation-free sequent calculi for full intuitionistic linear logic;infinite-state games with finitary conditions;innocent game semantics via intersection type assignment systems;deciding the weak definability of Büchi definable tree languages;and what is decidable about partially observable Markov decision processes with omega-regular objectives.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Tableau System for Right Propositional Neighborhood logic over Finite Linear Orders: An Implementation 1

引用

22nd international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Bresolin, Davide Della Monica, Dario Montanari, Angelo Sciavicco, Guido Univ Verona Dept Comp Sci I-37100 Verona Italy Univ Reykjavik Sch Comp Sci Reykjavik Iceland Univ Udine Dept Math & Comp Sci Udine Italy Univ Murcia Dept Informat Engn & Commun Murcia Spain

ISBN: (数字)9783642405372

ISBN: (纸本)9783642405365

Interval temporal logics are quite expressive temporal logics, which turn out to be difficult to deal with in many respects. Even finite satisfiability of simple interval temporal logics presents non-trivial technical issues when it comes to the implementation of efficient tableau-based decision procedures. We focus our attention on the logic of Allen's relation meets, a.k.a. Right Propositional Neighborhood logic (RPNL), interpreted over finite linear orders. Starting from a high-level description of a tableau system, we developed a first working implementation of a decision procedure for RPNL, and we made it accessible from the web. We report and analyze the outcomes of some initial tests.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Modal logic and distributed message passing automata 22

Modal logic and distributed message passing automata

引用

22nd Annual conference of the European Association for Computer Science logic EACSL, CSL 2013

作者： Kuusisto, Antti Institute of Computer Science University of Wroclaw Poland

ISBN: (纸本)9783939897606

In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic and deterministic distributed constant-time algorithms. The paper reports a variety of highly natural logical characterizations of classes of distributed message passing automata that run in constant time. The article leaves open the question of identifying related logical characterizations when the constant running time limitation is lifted. We obtain such a characterization for a class of finite message passing automata in terms of a recursive bisimulation invariant logic which we call modal substitution calculus (MSC). We also give a logical characterization of the related class A of infinite message passing automata by showing that classes of labelled directed graphs recognizable by automata in A are exactly the classes co-definable by a modal theory. A class C is co-definable by a modal theory if the complement of C is definable by a possibly infinite set of modal formulae. We also briefly discuss expressivity and decidability issues concerning MSC. We establish that MSC contains the 1μ fragment of the modal μ-calculus in the finite. We also observe that the single variable fragment MSC1 of MSC is not contained in MSO, and that the SAT and FINSAT problems of MSC1 are complete for PSPACE. © Antti Kuusisto;.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Subgraph frequencies: Mapping the empirical and extremal geography of large graph collections

Subgraph frequencies: Mapping the empirical and extremal geo...

引用

22nd international conference on World Wide Web, WWW 2013

作者： Ugander, Johan Backstrom, Lars Kleinberg, Jon Cornell University Ithaca NY United States Facebook Menlo Park CA United States

ISBN: (纸本)9781450320351

A growing set of on-line applications are generating data that can be viewed as very large collections of small, dense social graphs - these range from sets of social groups, events, or collaboration projects to the vast collection of graph neighborhoods in large social networks. A natural question is how to usefully define a domain-independent 'coordinate system' for such a collection of graphs, so that the set of possible structures can be compactly represented and understood within a common space. In this work, we draw on the theory of graph homomorphisms to formulate and analyze such a representation, based on computing the frequencies of small induced subgraphs within each graph. We find that the space of subgraph frequencies is governed both by its combinatorial properties-based on extremal results that constrain all graphs - as well as by its empirical properties - manifested in the way that real social graphs appear to lie near a simple one-dimensional curve through this space. We develop flexible frameworks for studying each of these aspects. For capturing empirical properties, we characterize a simple stochastic generative model, a single-parameter extension of Erdo″s- Rényi random graphs, whose stationary distribution over subgraphs closely tracks the one-dimensional concentration of the real social graph families. For the extremal properties, we develop a tractable linear program for bounding the feasible space of subgraph frequencies by harnessing a toolkit of known extremal graph theory. Together, these two complementary frameworks shed light on a fundamental question pertaining to social graphs: what properties of social graphs are 'social' properties and what properties are 'graph' properties? We conclude with a brief demonstration of how the coordinate system we examine can also be used to perform classification tasks, distinguishing between structures arising from different types of social graphs. Copyright is held by the international World Wide W

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

A Refined Tableau Calculus with Controlled Blocking for the Description logic SHOI 1

引用

22nd international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Khodadadi, Mohammad Schmidt, Renate A. Tishkovsky, Dmitry Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

ISBN: (数字)9783642405372

ISBN: (纸本)9783642405365

The paper presents a tableau calculus with several refinements for reasoning in the description logic SHOI. The calculus uses non-standard rules for dealing with TBox statements. Whereas in existing tableau approaches a fixed rule is used for dealing with TBox statements, we use a dynamically generated set of refined rules. This approach has become practical because reasoners with flexible sets of rules can be generated with the tableau prover generation prototype MetTeL. We also define and investigate variations of the unrestricted blocking mechanism in which equality reasoning is realised by ordered rewriting and the application of the blocking rule is controlled by excluding its application to a fixed, finite set of individual terms. Reasoning with the unique name assumption and excluding ABox individuals from the application of blocking can be seen as two separate instances of the latter. Experiments show the refinements lead to fewer rule applications and improved performance.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共216页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：