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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是451-460 订阅

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

详细简洁

排序：

Sixth Workshop on Foundations of Aspect-oriented Languages, FOAL'07 was held at the Sixth international conference on Aspect-Oriented Software Development

Sixth Workshop on Foundations of Aspect-oriented Languages, ...

引用

6th Workshop on Foundations of Aspect-oriented Languages, FOAL'07 was held at the Sixth international conference on Aspect-Oriented Software Development

the proceedings contain 9 papers. the topics discussed include: fundamentals of concern manipulation;requirement enforcement by transformation automata;typing for a minimal aspect language: preliminary report;towards a type system for detecting never-matching pointcut compositions;on the relation of aspects and monads;on bytecode slicing and aspectJ interferences;specializing continuations a model for dynamic join points;and aspects and modular reasoning in nonmonotonic logic;and aspect-oriented programming with type classes.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

A common view on strong, uniform, and other notions of equivalence in answer-set programming

A common view on strong, uniform, and other notions of equiv...

引用

Workshop on Correspondence and Equivalence for nonmonotonic theories, CENT 2007, Colocated with 9th international conference on logic programming and nonmonotonic reasoning, LPNMR 2007

作者： Woltran, Stefan Institut für Informationssysteme 184/3 Technische Universität Wien Favoritenstraße 9-11 A-1040 Vienna Austria

logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. this is due to the fact that equivalence for substitution (known as strong equivalence), which holds between programs P and Q iff P can faithfully be replaced by Q within any context R, is a different concept than ordinary equivalence between P and Q, which holds if P and Q have the same answer sets. Notions inbetween strong and ordinary equivalence have therefore been obtained by either restricting the syntactic structure of R or bounding the set of atoms allowed to occur in R (relativized equivalence). For the former approach, however, it turned out that any "reasonable" syntactic restriction to R either coincides with strong equivalence or collapses to uniform equivalence where R ranges over arbitrary sets of facts. In this paper, we propose a parameterization for equivalence notions which takes care of both such kinds of restrictions simultaneously by bounding, on the one hand, the atoms which are allowed to occur in the rule heads of R and, on the other hand, the atoms which are allowed to occur in the rule bodies of R. We introduce a semantical characterization including known ones as SE-models or UE-models as special cases. Moreover, we provide complexity bounds for the problem in question.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Constraint-based temporal reasoning for e-learning with LODE

Constraint-based temporal reasoning for e-learning with LODE

引用

13th international conference on Principles and Practice of Constraint programming (CP 2007)

作者： Gennari, Rosella Mich, Ornella Free Univ Bozen Bolzano CS Fac KRDB I-39100 Bolzano Italy

ISBN: (纸本)9783540749691

LODE is a logic-based web tool for Italian deaf children. It aims at stimulating global reasoning on e-stories written in a verbal language. Presently, we are focusing on temporal reasoning, that is, LODE stimulates children to reason with global temporal relations between events possibly distant in a story. this is done through apt exercises and with the support of a constraint programming system. Children can also reinvent the e-story by rearranging its events along a new temporal order;it is the task of the constraint system to determine the consistency of the temporally reorganised story and provide children with feedback. To the best of our knowledge, LODE is the first e-learning tool for Italian deaf children that aims at stimulating global reasoning on whole e-stories.

关键词： constraint programming automated temporal reasoning e-learning assistive technology

来源：评论

学校读者我要写书评

暂无评论

Constructive techniques for meta- and model-level reasoning

Constructive techniques for meta- and model-level reasoning

引用

10th international conference on Model Driven Engineering Languages and Systems

作者： Jackson, Ethan K. Sztipanovits, Janos Vanderbilt Univ Inst Software Integrated Syst 221 Kirkland Hall Nashville TN 37235 USA

ISBN: (纸本)9783540752080

the structural semantics of UML-based metamodeling were recently explored[l], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expressed in a decidable subset of first-order logic, an extended Horn logic. We augment the constructive techniques found in logic programming, which are also based on an extended Horn logic, to produce constructive techniques for reasoning about models and metamodels. these methods have a number of practical applications: At the meta-level, it can be decided if a (composite) metamodel characterizes a non-empty set of models, and a member can be automatically constructed. At the model-level, it can be decided if a submodel has an embedding in a well-formed model, and the larger model can be constructed. this amounts to automatic model construction from an incomplete model. We describe the concrete algorithms for constructively solving these problems, and provide concrete examples.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Bounded model checking with description logic reasoning

引用

16th international conference on Automated reasoning with Analytic Tableaux and Related Methods

作者： Ben-David, Shoham Trefler, Richard Weddell, Grant Univ Waterloo David R Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783540730989

Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the system is unfolded until a given depth, and translated into a CNF formula. A SAT solver is then applied to the CNF formula, to find a satisfying assignment. Such a satisfying assignment, if found, demonstrates an error in the model of the concurrent system. Description logic (DL) is a family of knowledge representation formalisms, for which reasoning is based on tableaux techniques. We show how Description logic can serve as a natural setting for representing and solving a BMC problem. We formulate a bounded model checking problem as a consistency problem in the DL dialect ACCI. Our formulation results in a compact representation of the model, one that is linear in the size of the model description, and does not involve any unfolding of the model. Experimental results, using the DL reasoner FaCT(++), significantly improve on a previous approach that used DL reasoning for model checking.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logical foundations of (e)RDF(S): Complexity and reasoning

引用

6th international Semantic Web conference/2nd Asian Semantic Web conference (ISWC 2007/ASWC 2007)

作者： de Bruijn, Jos Heymans, Stijn Faculty of Computer Science Free University of Bozen-Bolzano Italy Digital Enterprise Research Institute (DERI) University of Innsbruck Austria

ISBN: (纸本)9783540762973

An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logics. In this paper we address this issue by considering embeddings of RDF and RDFS in logic. Using these embeddings, combined with existing results about various fragments of logic, we establish several novel complexity results. the embeddings we consider show how techniques from deductive databases and description logics can be used for reasoning with RDF(S). Finally, we consider querying RDF graphs and establish the data complexity of conjunctive querying for the various RDF entailment regimes.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

the complexity of translating BLPs to RMMs

The complexity of translating BLPs to RMMs

引用

16th international conference on Inductive logic programming

作者： Muggleton, Stephen Pahlavi, Niels Univ London Imperial Coll Sci Technol & Med Dept Comp 180 Queens Gate London SW7 2BZ England

ISBN: (纸本)9783540738466

Probabilistic logic Learning (PLL) aims at learning probabilistic logical frameworks on the basis of data. Such frameworks combine expressive knowledge representation formalisms with reasoning mechanisms grounded in probability theory. Numerous frameworks have already addressed this issue. therefore, there is a real need to compare these frameworks in order to be able to unify them. this paper provides a comparison of Relational Markov Models (RMMs) and Bayesian logic Programs (BLPs). We demonstrate relations between BLPs' and RMMs' semantics, arguing that RMMs encode the same knowledge as a sub-class of BLPs. We fully describe a translation from a sub-class of BLPs into RMMs and provide complexity results which demonstrate an exponential expansion in formula size, showing that RMMs are less compact than their equivalent BLPs with respect to this translation. the authors are unaware of any more compact translation between BLPs and RMMs. A full implementation has already been realized, consisting of meta-interpreters for both BLPs and RMMs and a translation engine. the equality of BLPs' and corresponding RMMs' probability distributions has been proven on practical examples.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

Policy-based computing: From systems and applications to theory

Policy-based computing: From systems and applications to the...

引用

9th international conference on logic programming and Nonmonotomic reasoning, LPNMR 2007

作者： Lobo, Jorge IBM T. J. Watson Research Center

ISBN: (纸本)9783540721994

the need for a more autonomous management of distributed systems and networks has driven research and industry to look for management frameworks that go beyond the direct manipulation of network devices and systems. One approach towards this aim is to build policy-based management systems. Policy-based computing refers to a software paradigm developed around the concept of building autonomous systems that provide system administrators and decision makers with interfaces that let them set general guiding principles and policies to govern the behavior and interactions of the managed systems. Although many of the tasks are still carried out manually and ad hoc, instances of limited policy-based systems can be found in areas such as Internet service management, privacy, security and access management, management of quality of service and service level agreements in networks. Policies can be specified at many levels of abstraction, from natural language specifications to more elementary condition-action rule specifications. From these specifications policy systems need to come up with implementations. Some of these implementations can be done automatically, others require manual steps. In some cases policies impose legal commitments and systems should be able to demonstrate compliance. there are also situations in which policies are in conflict with each other and a system cannot implement them simultaneously without providing methods for conflict resolution. In this presentation I will review a few policy systems, applications and specification languages. then I will provide a more formal characterization of policies and their computational model. I will show a simple policy language in the style of the action description language A. I will discuss current solutions to policy conflicts, discuss the problem of policy refinement, i.e. transformations from high level specifications to lower level specifications, current approaches to refinement and provide a partial formal

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Rule-based modelling of cellular signalling

Rule-based modelling of cellular signalling

引用

18th international conference on Concurrency theory

作者： Danos, Vincent Feret, Jerome Fontana, Walter Harmer, Russell Krivine, Jean Plectix Biosystems Ecole Normale Supérieure Harvard Medical School CNRS Université Denis Diderot École Polytechnique

ISBN: (纸本)9783540744061

Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualitative forms of reasoning. Yet, this same combinatorial explosion makes the traditional modelling paradigm based on systems of differential equations impractical. In contrast, agent-based or concurrent languages, such as kappa. [1,2,3] or the closely related BioNetGen language [4,5,6,7,8,9,10], describe biological interactions in terms of rules, thereby avoiding the combinatorial explosion besetting differential equations. Rules are expressed in an intuitive graphical form that transparently represents biological knowledge. In this way, rules become a natural unit of model building, modification, and discussion. We illustrate this with a sizeable example obtained from refactoring two models of EGF receptor signalling that are based on differential equations [11,12]. An exciting aspect of the agent-based approach is that it naturally lends itself to the identification and analysis of the causal structures that deeply shape the dynamical, and perhaps even evolutionary, characteristics of complex distributed biological systems. In particular, one can adapt the notions of causality and conflict, familiar from con-currency theory, to kappa, our representation language of choice. Using the EGF receptor model as an example, we show how causality enables the formalization of the colloquial concept of pathway and, perhaps more surprisingly, how conflict can be used to dissect the signalling dynamics to obtain a qualitative handle on the range of system behaviours. By taming the combinatorial explosion, and exposing the causal structures and key kinetic junctures in a model, agent- and rule-based representations hold promise for making modelling more powerful, more perspicuous, and of appeal to a wider audience.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Verification of java bytecode using analysis and transformation of logic programs 07

引用

Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

作者： Elvira Albert Miguel Gómez-Zamalloa Laurent Hubert Germán Puebla DSIC Complutense University of Madrid Madrid Spain CLIP Technical University of Madrid Madrid Spain

ISBN: (纸本)9783540696087

State of the art analyzers in the logic programming (LP) paradigm are nowadays mature and sophisticated. they allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. the aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (jvml). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a jvml interpreter implemented in LP together with (an LP representation of) a jvml program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original jvml programs. this can be seen as a decompilation from jvml to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of jvml programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：