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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,159 篇 会议
58 册 图书
37 篇 期刊文献

馆藏范围

1,253 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

922 篇 工学
- 869 篇 计算机科学与技术...
- 470 篇 软件工程
- 94 篇 控制科学与工程
- 67 篇 电气工程
- 43 篇 信息与通信工程
- 13 篇 机械工程
- 10 篇 土木工程
- 9 篇 石油与天然气工程
- 8 篇 建筑学
- 7 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 仪器科学与技术
- 6 篇 电子科学与技术（可...
- 6 篇 生物医学工程（可授...
- 5 篇 力学（可授工学、理...
242 篇 理学
- 203 篇 数学
- 19 篇 系统科学
- 17 篇 物理学
- 15 篇 生物学
- 7 篇 统计学（可授理学、...
- 5 篇 化学
97 篇 管理学
- 62 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 37 篇 工商管理
13 篇 教育学
- 12 篇 教育学
11 篇 医学
- 8 篇 基础医学(可授医学...
- 7 篇 临床医学
10 篇 法学
- 6 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
7 篇 农学
- 6 篇 作物学
4 篇 文学
3 篇 哲学

主题

254 篇 logic programmin...
53 篇 artificial intel...
50 篇 fuzzy logic
42 篇 semantics
40 篇 formal logic
40 篇 mathematical log...
32 篇 computer circuit...
31 篇 logics and meani...
26 篇 software enginee...
23 篇 integer programm...
22 篇 temporal logic
21 篇 programming tech...
20 篇 programming lang...
19 篇 programming
19 篇 calculations
19 篇 knowledge repres...
17 篇 computer science
17 篇 logic
17 篇 answer set progr...
14 篇 software enginee...

机构

9 篇 univ bath dept c...
9 篇 vienna univ tech...
5 篇 univ london impe...
5 篇 rhein westfal th...
5 篇 univ london impe...
5 篇 univ texas dept ...
4 篇 tu wien austria
4 篇 simon fraser uni...
4 篇 department of co...
4 篇 guangxi key labo...
4 篇 univ liverpool d...
4 篇 univ potsdam ins...
4 篇 carnegie mellon ...
4 篇 univ glamorgan c...
4 篇 univ potsdam ins...
3 篇 univ potsdam ins...
3 篇 theoretical comp...
3 篇 saitama univ dep...
3 篇 microsoft resear...
3 篇 univ potsdam pot...

作者

12 篇 schaub torsten
12 篇 de vos marina
10 篇 brain martin
9 篇 ricca francesco
8 篇 gebser martin
8 篇 russo alessandra
7 篇 gore rajeev
6 篇 leone nicola
6 篇 andrei voronkov
6 篇 xu yang
6 篇 giesl juergen
5 篇 cliffe owen
5 篇 eiter thomas
5 篇 faber wolfgang
5 篇 cabalar pedro
5 篇 gupta gopal
5 篇 tompits hans
5 篇 schaub t
4 篇 mileo alessandra
4 篇 chang liang

语言

1,233 篇 英文
13 篇 其他
8 篇 中文
1 篇 葡萄牙文

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

共 1254 条记录，以下是751-760 订阅

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

详细简洁

排序：

EXPTIME tableaux with global caching for description logics with transitive roles, inverse roles and role hierarchies

引用

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

作者： Gore, Rajeev Nguyen, Linh Anh Australian Natl Univ NICTA GPO Box 4 Canberra ACT 0200 Australia Warsaw Univ Inst Informat PL-02097 Warsaw Poland

ISBN: (纸本)9783540730989

the description logic SHI extends the basic description logic ALC with transitive roles, role hierarchies and inverse roles. the known tableau-based decision procedure [9] for SHI exhibit (at least) NEXP-TIME behaviour even though SHI is known to be EXPTIME-complete. the automata-based algorithms for SHI often yield optimal worst-case complexity results, but do not behave well in practice since good optimisations for them have yet to be found. We extend our method for global caching in ALC to SHI by adding analytic cut rules, thereby giving the first EXPTIME tableau-based decision procedure for SHI, and showing one way to incorporate global caching and inverse roles.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

the logic of reasoning by procedural argumentation for knowledge sharing

The logic of reasoning by procedural argumentation for knowl...

引用

7th international conference on Computational Intelligence and Multimedia Applications

作者： Mahalakshmi, G. S. Geetha, T. V. Anna Univ Dept Comp Sci & Engn Madras 600025 Tamil Nadu India

ISBN: (纸本)9780769530505

this paper discusses the argumentative reasoning methodology adopted during knowledge sharing and the special techniques utilized from Indian logic to reason with inconsistent knowledge. Winning or losing arguments are not important;the amount of valid information shared between the arguers during rational debate qualifies for the scope of discussion. Proponent's arguments explain one's thoughts or beliefs to the opponent. the knowledge shared by the proponent may be invalid or inconsistent with respect to the opponent's common sense knowledge. therefore, the opponent reverts rationally through a counter argument. the proponent then removes the contradictions and proposes subsequent argument to the opponent. this exchange of propositions or arguments continues until the participant(s) is convinced about the shared knowledge. the validity of the shared knowledge shall be evaluated by measuring the components of the participants knowledge base.

关键词： Information dissemination

来源：评论

学校读者我要写书评

暂无评论

A purely model-theoretic semantics for disjunctive logic programs with negation

A purely model-theoretic semantics for disjunctive logic pro...

引用

9th international conference on logic programming and Nonmonotonic reasoning

作者： Cabalar, Pedro Pearce, David Rondogiannis, Panos Wadge, William W. Corunna Univ Dept Comp Sci Corunna Spain Univ Rey Juan Carlos Dept Informat Statist & Telemat Madrid Spain Univ Athens Dept Informat & Telecommun Athens Greece Univ Victoria Dept Comp Sci Victoria BC Canada

ISBN: (纸本)9783540721994

We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic programs [9]. In particular, we show that every disjunctive logic program with negation has a non-empty set of minimal infinite-valued models. Moreover, we show that the infinite-valued semantics can be equivalently defined using Kripke models, allowing us to prove some properties of the new semantics more concisely. In particular, for programs without negation, the new approach collapses to the usual minimal model semantics, and when restricted to normal logic programs, it collapses to the well-founded semantics. Lastly, we show that every (propositional) program has a finite set of minimal infinite-valued models which can be identified by restricting attention to a finite subset of the truth values of the underlying logic.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

APE: An AnsProlog* environment

APE: An AnsProlog* environment

引用

1st international Workshop on Software Engineering for Answer Set programming, SEA 2007 - Co-located Event with the 9th international conference on logic programming and Nonmonotonic reasoning, LPNMR 2007

作者： Sureshkumar, Adrian De Vos, Marina Brain, Martin Fitch, John Department of Computer Science University of Bath Bath BA2 7AY United Kingdom

It has been recognised that better programming tools are required to support the logic programming paradigm of Answer Set programming (ASP), especially when larger scale applications need to be developed. In order to meet this demand, the aspects of programming in ASP that require better support need to be investigated, and suitable tools to support them identified and implemented. In this paper we detail an exploratory development approach to implementing an Integrated Development Environment (IDE) for ASP, the AnsProlog* programming Environment (APE). APE is implemented as a plug-in for the Eclipse platform. Given that an IDE is itself composed of a set of programming tools, this approach is used to identify a set of tool requirements for ASP, together with suggestions for improvements to existing tools and programming practices.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Experimenting with look-back heuristics for hard ASP programs

Experimenting with look-back heuristics for hard ASP program...

引用

9th international conference on logic programming and Nonmonotonic reasoning

作者： Faber, Wolfgang Leone, Nicola Maratea, Marco Ricca, Francesco Univ Calabria Dept Math I-87036 Arcavacata Di Rende Italy

ISBN: (纸本)9783540721994

Competitive native solvers for Answer Set programming (ASP) perform a backtracking search by assuming the truth of literals. the choice of literals (the heuristic) is fundamental for the performance of these systems. Most of the efficient ASP systems employ a heuristic based on look-ahead, that is, a literal is tentatively assumed and its heuristic value is based on its deterministic consequences. However, looking ahead is a costly operation, and indeed look-ahead often accounts for the majority of time taken by ASP solvers. For Satisfiability (SAT), a radically different approach, called look-back heuristic, proved to be quite successful: Instead of looking ahead, one uses information gathered during the computation performed so far, thus looking back. In this approach, atoms which have been frequently involved in inconsistencies are preferred. In this paper, we carry over this approach to the framework of disjunctive ASP. We design a number of look-back heuristics exploiting peculiarities of ASP and implement them in the ASP system DLV. We compare their performance on a collection of hard ASP programs both structured and randomly generated. these experiments indicate that a very basic approach works well, outperforming all of the prominent disjunctive ASP systems - DLV (with its traditional heuristic), GnT, and CModels3 - on many of the instances considered.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

An argumentation-based negotiation for distributed extended logic programs

引用

7th international Workshop on Computational logic in Multi-Agent Systems

作者： de Almeida, Iara Carnevale Alferes, Jose Julio Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Evora Coll Luis Verney Dept Comp Sci P-7000671 Evora Portugal

ISBN: (纸本)9783540696186

the paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules of a logic program are viewed as encoding arguments of an agent, and the meaning of the program is determined by those arguments that somehow (depending on the specific semantics) can defend themselves from the attacks of other arguments. Most of the work on argumentation-based logic programs semantics has focused on assigning meaning to single programs. In this paper we propose an argumentation-based negotiation semantics for distributed knowledge bases represented as extended logic programs that extends the existing ones by considering sets of (distributed) logic programs, rather than single ones. For specifying the ways in which the various logic programs may combine their knowledge we make use of concepts that had been developed in the areas of defeasible reasoning, distributed knowledge bases, and multi-agent setting. In particular, we associate to each program P a cooperation set (the set of programs that can be used to complete the knowledge in P) and the argumentation set (the set of programs with which P has to reach a consensus).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Debugging ASP programs by means of ASP

Debugging ASP programs by means of ASP

引用

9th international conference on logic programming and Nonmonotonic reasoning

作者： Brain, Martin Gebser, Martin Puehrer, Jorg Schaub, Torsten Tompits, Hans Woltran, Stefan Univ Potsdam Inst Informat D-14482 Potsdam Germany Univ Bath Dept Comp Sci Bath BA2 7AY Avon England Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783540721994

Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the development of software-engineering tools is vital. In particular, the area of debugging provides a challenge in both theoretical and practical terms. this is due to the purely declarative nature of ASP that, on the one hand, calls for solver-independent methodologies and, on the other hand, does not directly apply to tracing techniques. In this paper, we propose a novel methodology, which rests within ASP itself, to sort out errors on the conceptual level. Our method makes use of tagging, where the program to be analyzed is rewritten using dedicated control atoms. this provides a flexible way to specify different types of debugging requests and a first step towards a dedicated (meta level) debugging language.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Verifying UML diagrams with model checking: A rewriting logic based approach

Verifying UML diagrams with model checking: A rewriting logi...

引用

7th international conference on Quality Software

作者： Mokhati, Farid Gagnon, Patrice Badri, Mourad Department of Computer Science University of Oum-El-Bouaghi Algeria Department of Mathematics and Computer Science University of Québec Trois-Rivières Canada

ISBN: (纸本)9780769530352

the present, in this paper, a framework supporting a formal verification of UML diagrams using the Maude language. the approach considers both static and dynamic features of object-oriented systems. We focus, in particular, on UML class, state and communication diagrams. the formal and object-oriented language Maude, based on rewriting logic, supports formal specification and programming of concurrent systems, as well as model checking. the major motivations of this work are: (1) bind together the UML notation and the Maude language (2) preserve the coherence in object-oriented systems description, (3) use model checking techniques to support formally their verification process. the generated Maude specifications, from the considered UML diagrams, are validated by simulation and model checking. the approach is illustrated using a concrete case study.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Tableau systems for logics of subinterval structures over dense orderings

引用

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

作者： Bresolin, Davide Goranko, Valentin Montanari, Angelo Sala, Pietro Univ Verona Dept Comp Sci I-37100 Verona Italy Univ Witwatersrand Sch Math Johannesburg South Africa Univ Udine Dept Math & Comp Sci Udine Italy

ISBN: (纸本)9783540730989

We construct a sound, complete, and terminating tableau system for the interval temporal logic D interpreted in interval structures over dense linear orderings endowed with strict subinterval relation (where both endpoints of the sub-interval are strictly inside the interval). In order to prove the soundness and completeness of our tableau construction, we introduce a kind of finite pseudo-models for our logic, called D(sic)-structures, and show that every formula satisfiable in D(sic): is satisfiable in such pseudo-models, thereby proving small-model property and decidability in PSPACE of D(sic) a result established earlier by Shapirovsky and Shehtman by means of filtration. We also show how to extend our results to the interval logic D(sic) interpreted over dense interval structures with proper (irreflexive) subinterval relation, which differs substantially from DE and is generally more difficult to analyze. Up to our knowledge, no complete deductive systems and decidability results for D(sic) have been proposed in the literature so far.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Prototyping 3APL in the Maude term rewriting language 06

引用

7th international Workshop on Computational logic in Multi-Agent Systems

作者： van Riemsdijk, M. Birna de Boer, Frank S. Dastani, Mehdi Meyer, John-Jules Ch. Univ Utrecht ICS NL-3508 TC Utrecht Netherlands CWI Amsterdam Netherlands Leiden Univ LIACS Leiden Netherlands

ISBN: (纸本)9783540696186

this paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on the mathematical theory of rewriting logic. the language has been shown to be suitable both as a logical framework in which many other logics can be represented, and as a semantic framework, through which programming languages with an operational semantics can be implemented in a rigorous way. We explore the usage of Maude in the context of agent programming languages, and argue that, since agent programming languages such as 3APL have both a logical and a semantic component, Maude is very well suited for prototyping such languages. Further, we show that, since Maude is reflective, 3APL's meta-level reasoning cycle or deliberation cycle can be implemented very naturally in Maude. Moreover, although we have implemented a simplified version of 3APL, we argue that Maude is very well suited for implementing various extensions of this implemented version. An important advantage of Maude, besides the fact that it is well suited for prototyping agent programming languages, is that it can be used for verification as it comes with an LTL model checker. Although this paper does not focus on model checking 3APL, the fact that Maude provides these verification facilities is an important motivation for our effort of implementing 3APL in Maude.

关键词： agent programming languages term rewriting prototyping

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：