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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

254 篇 会议
24 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

235 篇 工学
- 230 篇 计算机科学与技术...
- 146 篇 软件工程
- 11 篇 电气工程
- 9 篇 控制科学与工程
- 8 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
77 篇 理学
- 73 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
11 篇 管理学
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 法学
1 篇 军事学
- 1 篇 军队指挥学

主题

58 篇 logic programmin...
34 篇 answer set progr...
18 篇 non-monotonic re...
15 篇 knowledge repres...
9 篇 semantics
7 篇 inductive logic ...
6 篇 computer circuit...
5 篇 fuzzy logic
5 篇 formal logic
5 篇 programming
4 篇 belief revision
4 篇 epistemic logic ...
4 篇 non-monotonic lo...
4 篇 model checking
4 篇 ontologies
4 篇 defeasible logic
4 篇 knowledge repres...
4 篇 machine learning
3 篇 equilibrium logi...
3 篇 abduction

机构

9 篇 univ potsdam pot...
6 篇 univ calabria ar...
5 篇 univ a coruna la...
4 篇 new mexico state...
4 篇 vrije univ bruss...
4 篇 imperial coll lo...
4 篇 univ milano bico...
4 篇 univ angers leri...
3 篇 tu wien austria
3 篇 univ genoa dibri...
3 篇 univ calabria de...
3 篇 vienna univ tech...
3 篇 tech univ dresde...
2 篇 university of ma...
2 篇 univ torino dipa...
2 篇 katholieke univ ...
2 篇 univ calabria di...
2 篇 univ hasselt has...
2 篇 univ politecn ma...
2 篇 univ ferrara dip...

作者

16 篇 ricca francesco
9 篇 cabalar pedro
8 篇 alviano mario
7 篇 fandinno jorge
6 篇 schaub torsten
6 篇 maratea marco
5 篇 maher michael j.
5 篇 gebser martin
4 篇 eiter thomas
4 篇 son tran cao
3 篇 akbar siami nami...
3 篇 governatori guid...
3 篇 gaggl sarah alic...
3 篇 perez gilberto
3 篇 riguzzi fabrizio
3 篇 penaloza rafael
3 篇 formisano andrea
3 篇 aguado felicidad
3 篇 russo alessandra
3 篇 ielo antonio

语言

282 篇 英文

检索条件"任意字段=17th International Conference on Logic Programming and Non-monotonic Reasoning"

共 282 条记录，以下是191-200 订阅

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

详细简洁

排序：

FCUBE: An Efficient Prover for Intuitionistic Propositional logic

FCUBE: An Efficient Prover for Intuitionistic Propositional ...

引用

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

作者： Ferrari, Mauro Fiorentini, Camillo Fiorino, Guido Univ Insubria DICOM Via Mazzini 5 I-21100 Varese Italy Univ degli Studi Milano DSI I-20135 Milan Italy Univ degli Studi Milano Bicocca DIMEQUANT Milan Italy

ISBN: (纸本)9783642162411

We present FCUBE, a theorem prover for Intuitionistic propositional logic based on a tableau calculus. the main novelty of FCUBE is that it implements several optimization techniques that allow to prune the search space acting on different aspects of proof-search. We tested the efficiency of our techniques by comparing FCUBE with other theorem provers. We found that our prover outperforms the other provers on several interesting families of formulas.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Extended Computation Tree logic

Extended Computation Tree Logic

引用

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

作者： Axelsson, Roland Hague, Matthew Kreutzer, Stephan Lange, Martin Latte, Markus Univ Munich Dept Comp Sci D-80539 Munich Germany

ISBN: (纸本)9783642162411

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may determine the moments along a path that an until property may be fulfilled. We consider several classes of languages leading to logics with different expressive power and complexity, whose importance is motivated by their use in model checking, synthesis, abstract interpretation, etc. We show that even with context-free languages on the until operator the logic still allows for polynomial time model-checking despite the significant increase in expressive power. this makes the logic a promising candidate for applications in verification. In addition, we analyse the complexity of satisfiability and compare the expressive power of these logics to CTL* and extensions of PDL.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Labelled Unit Superposition Calculi for Instantiation-Based reasoning

Labelled Unit Superposition Calculi for Instantiation-Based ...

引用

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

作者： Korovin, Konstantin Sticksel, Christoph Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

ISBN: (纸本)9783642162411

the Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order reasoning with efficient ground satisfiability checking which is delegated in a modular way to any state-of-the-art ground SMT solver. the first-order reasoning modulo equality employs a superposition-style calculus which generates the instances needed by the ground solver to refine a model of a ground abstraction or to witness unsatisfiability. In this paper we present and compare different labelling mechanisms in the unit superposition calculus that facilitates finding the necessary instances. We demonstrate and evaluate how different label structures such as sets, AND/OR trees and OBDDs affect the interplay between the proof procedure and blocking mechanisms for redundancy elimination.

关键词： Biomineralization

来源：评论

学校读者我要写书评

暂无评论

Automatic Synthesis of Reactive Agents

Automatic Synthesis of Reactive Agents

引用

11th international conference on Control, Automation, Robotics and Vision (ICARCV 2010)

作者： Song, Insu Governatori, Guido Diederich, Joachim James Cook Univ Australia Sch Business & IT Singapore Singapore NICTA Natl ICT Australia Educ Queensland Res Lab Sydney NSW Australia

ISBN: (纸本)9781424478132

this paper introduces a new approach to designing smart control chips that enables automatic synthesis of real-time control systems from agent specifications. An agent specification is compiled into a hardware description format, such as RTL-VHDL (Register Transfer Level-VLSI Hardware Description Language) or RTL Verilog, which is synthesized using computer-assisted tools to develop ASIC masks or FPGA configurations. A rule-based specification language called Layered Argumentation System ( LAS) is defined and a sound and complete mapping to Verilog is developed. LAS combines fuzzy reasoning and non-monotonic reasoning. this enables chip designers to capture commonsense knowledge and concepts having varying degrees of confidence collaboratively and incrementally.

关键词： control systems reactive systems circuit synthesis agent programming fuzzy controller logic controller

来源：评论

学校读者我要写书评

暂无评论

Tableau Calculus for the logic of Comparative Similarity over Arbitrary Distance Spaces

Tableau Calculus for the Logic of Comparative Similarity ove...

引用

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

作者： Alenda, Regis Olivetti, Nicola CNRS UMR 6168 LSIS F-13397 Marseille 20 France

ISBN: (纸本)9783642162411

the logic CSL (first introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev in 2005) allows one to reason about distance comparison and similarity comparison within a modal language. the logic can express assertions of the kind "A is closer/more similar to B than to C" and has a natural application to spatial reasoning, as well as to reasoning about concept similarity in ontologies. the semantics of CSL is defined in terms of models based on different classes of distance spaces and it generalizes the logic S4(u) of topological spaces. In this paper we consider CSL defined over arbitrary distance spaces. the logic comprises a binary modality to represent comparative similarity and a unary modality to express the existence of the minimum of a set of distances. We first show that the semantics of CSL can be equivalently defined in terms of preferential models. As a consequence we obtain the finite model property of the logic with respect to its preferential semantic, a property that does not hold with respect to the original distance-space semantics. Next we present an analytic tableau calculus based on its preferential semantics. the calculus provides a decision procedure for the logic, its termination is obtained by imposing suitable blocking restrictions.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Variable Compression in ProbLog

Variable Compression in ProbLog

引用

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

作者： Mantadelis, theofrastos Janssens, Gerda Katholieke Univ Leuven Dept Computerwetenschappen B-3001 Heverlee Belgium

ISBN: (纸本)9783642162411

In order to compute the probability of a query, ProbLog represents the proofs of the query as disjunctions of conjunctions, for which a Reduced Ordered Binary Decision Diagram (ROBDD) is computed. the paper identifies patterns of Boolean variables that occur in Boolean formulae, namely AND-clusters and OR-clusters. Our method compresses the variables in these clusters and thus reduces the size of ROBDDs without affecting the probability. We give a polynomial algorithm that detects AND-clusters in disjunctive normal form (DNF) Boolean formulae, or OR-clusters in conjunctive normal form (CNF) Boolean formulae. We do an experimental evaluation of the effects of AND-cluster compression for a real application of ProbLog. With our prototype implementation we have a significant improvement in performance (up to 87%) for the generation of ROBDDs. Moreover, compressing AND-clusters of Boolean variables in the DNFs makes it feasible to deal with ProbLog queries that give rise to larger DNFs.

关键词： ProbLog Statistical Relation Learning Probabilistic logic programming Variable Compression Binary Decision Diagrams

来源：评论

学校读者我要写书评

暂无评论

Synthesis of multi-level pipelines for programmable logic devices

Synthesis of multi-level pipelines for programmable logic de...

引用

2010 17th international conference on Telecommunications, ICT 2010

作者： Damaj, Issam Division of Sciences and Engineering American University of Kuwait P.O. Box 3323 Safat 13034 Kuwait

ISBN: (纸本)9781424452477

Recently, hardware and software engineers have been showing considerable attention to high-level parallelization and hardware synthesis methodologies. State-of-the-art approaches have benefited from the emergence of modern highdensity Field Programmable Gate Arrays. In this paper, we explore the effectiveness of a formal methodology in the design of pipelined versions of a matrix multiplication algorithm. the suggested methodology adopts a functional programming notation for specifying algorithms and for reasoning about them. the parallel behavior of the specification is then derived and mapped onto hardware. Several pipelined implementations are developed with different performance characteristics. the refined designs are tested under Agility's RC-1000 reconfigurable computer with its 2 million gates Virtex-E FPGA. Performance analysis and evaluation of the proposed implementations are presented in comparison with an Intel Core 2 DUO processor. © 2009 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

PBINT, A logic for Modelling Search Problems Involving Arithmetic

PBINT, A Logic for Modelling Search Problems Involving Arith...

引用

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

作者： Tasharrofi, Shahab Ternovska, Eugenia Simon Fraser Univ Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642162411

Motivated by computer science challenges, Gradel and Gurevich [13] suggested to extend the approach and methods of finite model theory beyond finite structures, an approach they called Metafinite Model theory. We develop this direction further, in application to constraint specification/modelling languages. Following [27], we use a framework based on embedded model theory, but with a different background structure, the structure of arithmetic which contains at least (N;0,1, +. <, parallel to parallel to), where parallel to x parallel to returns the size of the binary encoding of x. We prove that on these structures, we can unconditionally capture NP using a variant of a guarded logic. this improves the result of [27] (and thus indirectly [13]) by eliminating the small cost condition on input structures. As a consequence, our logic (an idealized specification language) allows one to represent common arithmetical problems such as integer factorization or disjoint scheduling naturally, with built-in arithmetic, as opposed to using a binary encoding. thus, this result gives a remedy to a problem with practical specification languages, namely that there are common arithmetical problems that can be decided in NP but cannot be axiomatized naturally in current modelling languages. We give some examples of such axiomatizations in PBINT and explain how our result applies to constraint specification/modelling languages.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

ENASE 2010 - Proceedings of the 5th international conference on Evaluation of Novel Approaches to Software Engineering

ENASE 2010 - Proceedings of the 5th International Conference...

引用

5th international conference on Evaluation of Novel Approaches to Software Engineering, ENASE 2010

ISBN: (纸本)9789898425218

the proceedings contain 35 papers. the topics discussed include: the evolving relationship between business and information systems;mental distance - and its implications for software and data design for e-business;detecting, recognizing and associating facial expressions for emotional behavior;a plea for pluggable programming language features;a systematic literature review of how to introduce data quality requirements into a software product development;towards a catalogue of conflicts among non-functional requirements;using aspect-orientation for software migration;a systematic review on the harmonization of reference models;absolute scales to express stakeholder value for improving support for prioritization;a method and a tool based on a conceptual graph for information systems engineering processes;non-monotonic reasoning for requirements engineering - state diagrams driven by plausible logic;and a change propagation process for distributed software architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：