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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10 篇 会议
3 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

7 篇 工学
- 6 篇 计算机科学与技术...
- 1 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 软件工程
5 篇 理学
- 4 篇 数学
- 2 篇 生物学

主题

3 篇 semantics
2 篇 software enginee...
2 篇 computers and ed...
2 篇 computer languag...
2 篇 artificial intel...
2 篇 logics and meani...
2 篇 heuristic algori...
1 篇 object oriented ...
1 篇 conferences
1 篇 computer circuit...
1 篇 programming
1 篇 problem solving
1 篇 supercomputers
1 篇 information syst...
1 篇 electronic mail
1 篇 informatics
1 篇 computer communi...
1 篇 information tech...
1 篇 computer appl. i...
1 篇 computational mo...

机构

6 篇 department of th...
3 篇 kherson state un...
2 篇 institute of app...
2 篇 department of th...
2 篇 zaporizhzhya nat...
2 篇 lviv polytechnic...
2 篇 mayr application...
2 篇 department of in...
1 篇 dept. kino and a...
1 篇 school of mathem...
1 篇 department of co...
1 篇 school of mathem...
1 篇 faculty of mathe...
1 篇 department of ps...
1 篇 jülich supercomp...
1 篇 riken advanced i...
1 篇 department of th...
1 篇 hpc usability re...
1 篇 simulation labor...
1 篇 school of mathem...

作者

3 篇 aleksander spiva...
3 篇 vadim ermolayev
3 篇 heinrich c. mayr
3 篇 nikitchenko myko...
3 篇 mykola nikitchen...
2 篇 tymofieiev valen...
2 篇 nikitchenko myko...
2 篇 grygoriy zholtke...
2 篇 tymofieiev valen...
1 篇 shkilniak stepan
1 篇 yakovyna vitaliy
1 篇 vitaliy yakovyna
1 篇 spivakovsky alek...
1 篇 j. karam
1 篇 helias moritz
1 篇 volodymyr ovsyak
1 篇 kitayama itaru
1 篇 kunkel susanne
1 篇 dmytro bui
1 篇 s. polyakov

语言

14 篇 英文

检索条件"机构=Department of Theory and Technology of Programming"

共 14 条记录，以下是1-10 订阅

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

详细简洁

排序：

Semantics-based logics over hierarchical nominative data

Semantics-based logics over hierarchical nominative data

引用

8th International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer, ICTERI 2012

作者： Nikitchenko, M.N.S. Shkilniak, S.S. Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv Volodymyrska st 60 01601 Kyiv Ukraine

In the paper new logics oriented on hierarchical data are developed. Algebras of partial predicates over such data with special compositions as operations form a semantic base for constructed logics. Characteristic property of such logics is the usage of composite names in their languages. Semantic properties of these logics are studied;corresponding sequent calculi are defined, their soundness and completeness are proved for logics of renominative level.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Satisfiability in composition-nominative logics

Satisfiability in composition-nominative logics

引用

作者： Nikitchenko, Mykola Tymofieiev, Valentyn Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 64 Volodymyrska Street Kyiv01601 Ukraine

Composition-nominative logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming. They can be considered as generalizations of traditional logics on classes of partial predicates that do not have fixed arity. In this paper we present and investigate algorithms for solving the satisfiability problem in various classes of composition-nominative logics. We consider the satisfiability problem for logics of the propositional, renominative, and quantifier levels and prove the reduction of the problem to the satisfiability problem for classical logics. The method developed in the paper enables us to leverage existent state-of-the-art satisfiability checking procedures for solving the satisfiability problem in composition-nominative logics, which could be crucial for handling industrial instances coming from domains such as program analysis and verification. The reduction proposed in the paper requires extension of logic language and logic models with an infinite number of unessential variables and with a predicate of equality to a constant. © 2012 Versita Warsaw.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Satisfiability problem in composition-nominative logics of quantifier-equational level

Satisfiability problem in composition-nominative logics of q...

引用

8th International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer, ICTERI 2012

作者： Nikitchenko, Mykola S. Tymofieiev, Valentyn G. Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 64 Volodymyrska Street 01601 Kyiv Ukraine

We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming;they can be considered as generalizations of traditional logics on classes of partial predicates that do not have fixed arity. We show the reduction of the problem in hand to the satisfiability problem for classical first-order predicate logic with equality. The proposed reduction requires extension of logic language and logic models with an infinite number of unessential variables. The method developed in the paper enables us to use existent satisfiability checking procedures also for quantifier composition-nominative logic with equality.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Satisfiability and validity problems in many-sorted composition-nominative pure predicate logics

Satisfiability and validity problems in many-sorted composit...

引用

8th International Conference on ICT in Education, Research, and Industrial Applications, ICTERI 2012

作者： Nikitchenko, Mykola S. Tymofieiev, Valentyn G. Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 64 Volodymyrska Street 01601 Kyiv Ukraine

ISBN: (纸本)9783642357367

We propose methods for solving the satisfiability and validity problems in many-sorted composition-nominative pure predicate logics (without functions and with equality). These logics are algebra-based logics of many-sorted partial predicates constructed in a semantic-syntactic style on the methodological basis that is common with programming;they can be considered as generalizations of traditional many-sorted logics on classes of partial predicates that do not have fixed arity. We show the reduction of the satisfiability problem to the same problem for many-sorted classical first-order pure predicate logic with equality. As validity is dual to satisfiability, the method proposed can be adopted to the validity problem. This enables us to use existent satisfiability and validity checking procedures developed for classical logic also for solving these problems in composition-nominative pure predicate logics with equality. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Satisfiability problems in quasiary program logics 8

Satisfiability problems in quasiary program logics

引用

8th International Conference Advanced Computer Information Technologies, ACIT 2018

作者： Nikitchenko, Mykola Shkilniak, Stepan Tymofieiev, Valentyn Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 60 Volodymyrska Street City of Kyiv01033 Ukraine

ISBN: (纸本)9789666544899

In the paper we present special program specification algebras and logics defined for classes of quasiary mappings. Informally speaking, such mappings are partial mappings defined over partial states (partial assignments) of variables. Conventional n-ary mappings can be considered as a special case of quasiary mappings. Such mappings better reflect properties of software systems. We describe methods of reducibility of the satisfiability problem in quasiary logics to the satisfiability problem in logics of n-ary mappings. The methods proposed can be useful for software verification. Copyright © 2018 for the individual papers by the papers'authors.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Visual Language Plans - Formalization of a pedagogical learnflow modeling language

Visual Language Plans - Formalization of a pedagogical learn...

引用

International Workshop on Petri Nets and Software Engineering, PNSE 2014

作者： Irgang, Kerstin Irgang, Thomas Human-Centered Information Systems Clausthal University of Technology Germany Department of Software Engineering and Theory of Programming Fernuniversität Hagen Germany

In this paper we present an approach to support selfregulated learn-flows in the collaborative environment Metafora. In this environment students construct Visual Language Plans. Those plans model workflows of learning activities, which the students execute to solve complex learning scenarios across different tools. Visual Language plans were already used in the context of different pedagogical studies but have no formal syntax or semantics, yet. In this paper, we present the syntax of Visual Language Plans and develop a mapping from Visual Language Plans to Petri net defining semantics. With the help of this semantics, the environment can support the students executing their learnflows. If students execute activities given in a Visual Language Plan which are not enabled in the corresponding Petri net, feedback messages occur guiding the students. Students can refine their Visual Language Plan during execution. If a plan changes the corresponding Petri net model also changes. Analyzing the newly generated Petri net model can help to uncover faulty states of the learnflow model.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Mathematical foundations of multiple inheritance: Reflexive-transitive closure of the binary relations

Mathematical foundations of multiple inheritance: Reflexive-...

引用

International Conference on Perspective Technologies and Methods in MEMS Design (MEMSTECH)

作者： Dmytro Buy Olena Shyshatska Sunmade Fabunmi Karam Mohammed Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv Kyiv UKRAINE

ISBN: (纸本)9781509014149

The paper is devoted to the mathematical foundations of the linearization algorithms - the method of conflict resolution that occurs in object-oriented programming languages which support multiple inheritance. The main object of study is the reflexive-transitive closure of a binary relation. The basic properties of this closure are found: the criterion to be partial order, closure is the closure operator, denotative representations of closure in terms of its properties and as the least solution of some equation (the structure of the set of all solutions of this equation is established).

关键词： Standards Object oriented programming Heuristic algorithms Electronic mail Computer languages

来源：评论

学校读者我要写书评

暂无评论

ICT in Education, Research, and Industrial Applications 1

引用

丛书名： Communications in Computer and Information Science

1000年

作者： Vadim Ermolayev Heinrich C. Mayr Mykola Nikitchenko Aleksander Spivakovsky Grygoriy Zholtkevych

ISBN: (数字)9783642357374

ISBN: (纸本)9783642357367

This book constitutes the refereed proceedings of the 8th International Conference on ICT in Education, Research, and Industrial Applications, held in Kherson, Ukraine, in June 2012.;The 14 revised full papers were carefully reviewed and selected from 70 submissions. This book begins with an invited contribution presenting the substance of one of ICTERI 2012 invited talks. The chapter deals with the issues of abstraction and verification of properties in real-time Java programs. The rest of the volume is structured in four topical parts: ICT Frameworks, Infrastructures, Integration, and Deployment; Formal Logic and Knowledge-Based Frameworks; ICT-Based Systems Modeling, Specification, and Verification: ICT in Teaching and Learning.

关键词： Software Engineering Logics and Meanings of Programs programming Languages, Compilers, Interpreters Computer Communication Networks Artificial Intelligence Mathematical Logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

Linearization algorithms CLOS and LOOPS of the classes in programming languages: The formal definitions

Linearization algorithms CLOS and LOOPS of the classes in pr...

引用

IEEE International Scientific Conference on Informatics

作者： D. Buy J. Karam S. Kompan S. Polyakov Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv Kyiv Ukraine Kiivs'kij nacional'nij universitet imeni Tarasa Sevcenka Kiiv KiÃ¯v UA

The methods of conflict resolution of names in programming languages that allow multiple inheritance were researched. Those methods are based on the linearization of the classes. The idea of linearization is to reduce multiple inheritance to single, in which the problem of selecting a suitable attribute is solved trivially. The definition of a hierarchy of classes is introduced. The property of monotonicity was clarified. The idea of monotonicity is that all the attributes that the class inherits either identified in its direct ancestors, or inherited them. Methods of conflict resolution used in programming languages CLOS and LOOPS were formally defined.

关键词： Computer languages programming Heuristic algorithms Semantics Yttrium Conferences Informatics

来源：评论

学校读者我要写书评

暂无评论

Information and Communication Technologies in Education, Research, and Industrial Applications 1

引用

丛书名： Communications in Computer and Information Science

1000年

作者： Vadim Ermolayev Heinrich C. Mayr Mykola Nikitchenko Aleksander Spivakovsky Grygoriy Zholtkevych

ISBN: (数字)9783319039985

ISBN: (纸本)9783319039978

This book constitutes the thoroughly refereed proceedings of the 9th International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, held in Kherson, Ukraine, in June 2013. The 18 revised full papers presented were carefully reviewed and selected from 125 submissions. The papers are organized in topical sections on systems, infrastructures, and integration; semantics, knowledge engineering and management; ICT in teaching methodologies and didactics; model-driven software development and verification.

关键词： Computers and Education Software Engineering Logics and Meanings of Programs Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：