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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

136 篇 会议
11 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

119 篇 工学
- 118 篇 计算机科学与技术...
- 66 篇 软件工程
- 5 篇 电气工程
- 4 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 生物医学工程（可授...
37 篇 理学
- 36 篇 数学
- 1 篇 生物学
4 篇 管理学
- 3 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

37 篇 logic programmin...
10 篇 program transfor...
8 篇 computer circuit...
8 篇 semantics
8 篇 logics and meani...
7 篇 artificial intel...
6 篇 mathematical log...
5 篇 program analysis
5 篇 programming tech...
4 篇 program synthesi...
4 篇 software enginee...
4 篇 software enginee...
4 篇 constraint handl...
4 篇 programming lang...
3 篇 static analysis
3 篇 source-to-source...
2 篇 program debuggin...
2 篇 floating-point n...
2 篇 concurrent const...
2 篇 types

机构

4 篇 katholieke univ ...
4 篇 univ politecn va...
3 篇 nagoya inst tech...
2 篇 univ politecn ma...
2 篇 univ fed rio gra...
2 篇 univ politecn va...
2 篇 katholieke univ ...
2 篇 univ southern de...
2 篇 rhein westfal th...
2 篇 univ complutense...
2 篇 univ north texas...
2 篇 tech u madrid sc...
2 篇 imdea software i...
2 篇 univ new mexico ...
2 篇 univ new mexico ...
2 篇 ecole polytech l...
2 篇 univ ulm d-89069...
2 篇 ecole polytech i...
2 篇 german univ cair...
2 篇 nagoya institute...

作者

6 篇 vidal german
4 篇 schneider-kamp p...
4 篇 silva josep
4 篇 falaschi moreno
4 篇 seki hirohisa
4 篇 abdennadher slim
4 篇 giesl juergen
3 篇 proietti maurizi...
3 篇 de schreye danny
3 篇 leuschel michael
3 篇 lucas salvador
3 篇 meseguer jose
2 篇 puebla german
2 篇 vanhoof w
2 篇 bruynooghe mauri...
2 篇 senni valerio
2 篇 michael hanus
2 篇 gallagher john p...
2 篇 komendantskaya e...
2 篇 sharaf nada

语言

145 篇 英文
3 篇 中文

检索条件"任意字段=18th International Symposium on Logic-Based Program Synthesis and Transformation"

共 148 条记录，以下是111-120 订阅

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

详细简洁

排序：

Polynomial Approximation to Well-Founded Semantics for logic programs with Generalized Atoms: Case Studies 24th

Polynomial Approximation to Well-Founded Semantics for Logic...

引用

24th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Chowdhury, Md. Solimul Liu, Fangfang Chen, Wu Karimi, Arash You, Jia-Huai Univ Alberta Dept Comp Sci Edmonton AB Canada Shanghai Univ Coll Comp & Informat Sci Baoshan Peoples R China Southwest Univ Coll Comp & Informat Sci Chongqing Peoples R China

ISBN: (纸本)9783319178226;9783319178219

the well-founded semantics of normal logic programs has two main utilities, one being an efficiently computable semantics with a unique intended model, and the other serving as polynomial time constraint propagation for the computation of answer sets of the same program. When logic programs are generalized to support constraints of various kinds, the semantics is no longer tractable, which makes the second utility doubtful. this paper considers the possibility of tractable but incomplete methods, which in general may miss information in the computed result, but never generates wrong conclusions. For this goal, we first formulate a well-founded semantics for logic programs with generalized atoms, which generalizes logic programs with arbitrary aggregates/constraints/dl-atoms. As a case study, we show that the method of removing non-monotone dl-atoms for the well-founded semantics by Eiter et al. actually falls into this category. We also present a case study for logic programs with standard aggregates.

关键词： Polynomial approximation Well-founded semantics Generalized atoms

来源：评论

学校读者我要写书评

暂无评论

A Generalized Model for Algorithmic Debugging 25th

A Generalized Model for Algorithmic Debugging

引用

25th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Insa, David Silva, Josep Univ Politecn Valencia E-46022 Valencia Spain

ISBN: (纸本)9783319274362;9783319274355

Algorithmic debugging is a semi-automatic debugging technique that is present in practically all mature programming languages. In this paper we claim that the state of the practice in algorithmic debugging is a step forward compared to the state of the theory. In particular, we argue that novel techniques for algorithmic debugging cannot be supported by the standard internal data structures used in this technique, and a generalization of the standard definitions and algorithms is needed. We identify two specific problems of the standard formulation and implementations of algorithmic debugging, and we propose a reformulation to solve both problems. the reformulation has been done in a paradigm-independent manner to make it useful and reusable in different programming languages.

关键词： program debugging

来源：评论

学校读者我要写书评

暂无评论

Supervising offline partial evaluation of logic programs using online techniques

Supervising offline partial evaluation of logic programs usi...

引用

16th international symposium on logic-based program synthesis and transformation

作者： Leuschel, Michael Craig, Stephen-John Elphick, Dan Univ Dusseldorf Inst Informat D-4000 Dusseldorf Germany

ISBN: (纸本)9783540714095

A major impediment for more widespread use of offline partial evaluation is the difficulty of obtaining and maintaining annotations for larger, realistic programs. Existing automatic binding-time analyses still only have limited applicability and annotations often have to be created or improved and maintained by hand, leading to errors. We present a technique to help overcome this problem by using online control techniques which supervise the specialisation process in order to detect such errors. We discuss an implementation in the LOGEN system and show on a series of examples that this approach is effective: very few false alarms were raised while infinite loops were detected quickly. We also present the integration of this technique into a web interface, which highlights problematic annotations directly in the source code. A method to automatically fix incorrect annotations is presented, allowing the approach to be also used as a pragmatic binding time analysis. Finally we show how our method can be used for efficiently locating errors with built-ins inside Prolog source code.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Fred Mesnard Peter J. Stuckey

ISBN: (数字)9783030138387

ISBN: (纸本)9783030138370

this book constitutes the thoroughly refereed post-conference proceedings of the 28th international symposium on logic-based program synthesis and transformation, LOPSTR 2018, held in Frankfurt/Main, Germany, in September 2018.;the 11 revised full papers were carefully reviewed and selected from 29 submissions. In addition to the 11 papers, this volume includes 3 abstracts of invited talks and 2 abstracts of invited tutorials. the papers are grouped into the following topics: analysis of term rewriting; logic-based distributed/concurrent programming; analysis of logic programming; and program analysis.

关键词： logics and Meanings of programs Software Engineering programming Languages, Compilers, Interpreters programming Techniques Artificial Intelligence Mathematical logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

Analysis of Rewriting-based Systems as First-Order theories 27th

Analysis of Rewriting-Based Systems as First-Order Theories

引用

27th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Lucas, Salvador Univ Politecn Valencia DSIC Valencia Spain

ISBN: (纸本)9783319944609;9783319944593

Computational systems based on a first-order language that can be given a canonical model which captures provability in the corresponding calculus can often be seen as first-order theories S, and computational properties of such systems can be formulated as first-order sentences. that hold in such a canonical model of S. In this setting, standard results regarding the preservation of satisfiability of different classes of first-order sentences yield a number of interesting applications in program analysis. In particular, properties expressed as existentially quantified boolean combinations of atoms (for instance, a set of unification problems) can then be disproved by just finding an arbitrary model of the considered theory plus the negation of such a sentence. We show that rewriting-based systems fit into this approach. Many computational properties (e.g., infeasibility and non-joinability of critical pairs in (conditional) rewriting, non-loopingness, or the secure access to protected pages of a web site) can be investigated in this way. Interestingly, this semantic approach succeeds when specific techniques developed to deal with the aforementioned problems fail.

关键词： logical models program analysis Rewriting-based systems

来源：评论

学校读者我要写书评

暂无评论

Symbolic Execution and thresholding for Efficiently Tuning Fuzzy logic programs 26th

Symbolic Execution and Thresholding for Efficiently Tuning F...

引用

26th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Moreno, Gines Penabad, Jaime Riaza, Jose A. Vidal, German UCLM Dept Comp Syst Albacete 02071 Spain UCLM Dept Math Albacete 02071 Spain Univ Politecn Valencia MiST DSIC Valencia Spain

ISBN: (纸本)9783319631394;9783319631387

Fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. One of the most difficult tasks when specifying a fuzzy logic program is determining the right weights for each rule, as well as the most appropriate fuzzy connectives and operators. In this paper, we introduce a symbolic extension of fuzzy logic programs in which some of these parameters can be left unknown, so that the user can easily see the impact of their possible values. Furthermore, given a number of test cases, the most appropriate values for these parameters can be automatically computed. Finally, we show some benchmarks that illustrate the usefulness of our approach.

关键词： Fuzzy logic programming Symbolic execution Tuning

来源：评论

学校读者我要写书评

暂无评论

lpopt: A Rule Optimization Tool for Answer Set programming 26th

lpopt: A Rule Optimization Tool for Answer Set Programming

引用

26th international symposium on logic-based program synthesis and transformation (LOPSTR)

作者： Bichler, Manuel Morak, Michael Woltran, Stefan TU Wien Vienna Austria

ISBN: (纸本)9783319631394;9783319631387

State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional programs. the size of this grounding depends heavily on the size of the non-ground rules, and thus, reducing the size of such rules is a promising approach to improve solving performance. To this end, in this paper we announce lpopt, a tool that decomposes large logic programming rules into smaller rules that are easier to handle for current solvers. the tool is specifically tailored to handle the standard syntax of the ASP language (ASP-Core) and makes it easier for users to write efficient and intuitive ASP programs, which would otherwise often require significant hand-tuning by expert ASP engineers. It is based on an idea proposed by Morak and Woltran (2012) that we extend significantly in order to handle the full ASP syntax, including complex constructs like aggregates, weak constraints, and arithmetic expressions. We present the algorithm, the theoretical foundations on how to treat these constructs, as well as an experimental evaluation showing the viability of our approach.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Denotation by transformation towards obtaining a denotational semantics by transformation to point-free style

引用

17th international symposium on logic-based program synthesis and transformation, LOPSTR 2007

作者： Braßel, Bernd Christiansen, Jan Institute of Computer Science University of Kiel Kiel 24098 Germany

ISBN: (纸本)3540787682

It has often been observed that a point-free style of programming provides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semantics for functional logic languages in a straightforward way. Here we propose a set of basic operations based on which arbitrary functional logic programs can be transformed to point-free programs. the semantics of the resulting programs are strict but, nevertheless, the semantics of the original program is preserved. there is a one-to-one mapping from the primitives introduced by the transformation to operations in relation algebra. this mapping can be extended to obtain a relation algebraic model for the whole program. this yields a denotational semantics which is on one hand closely related to point-free functional logic programs and on the other hand connects to the well-developed field of algebraic logic including automatic proving. © 2008 Springer Berlin Heidelberg.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Completeness of unfolding for rewriting logic theories

Completeness of unfolding for rewriting logic theories

引用

作者： Alpuente, María Baggi, Michele Falaschi, Moreno Ballis, Demis DSIC Universidad Politécnica de Valencia Camino de Vera s/n 46071 Valencia Spain Dip. di Scienze Matematiche e Informatiche Pian dei Mantellini 44 53100 Siena Italy Dip. Matematica e Informatica Via delle Scienze 206 33100 Udine Italy

ISBN: (纸本)9780769543246

Many transformation systems for program optimization, program synthesis, and program specialization are based on fold/unfold transformations. In this paper, we investigate the semantic properties of a narrowing-based unfolding transformation that is useful to transform rewriting logic theories. We also present a transformation methodology that is able to determine whether an unfolding transformation step would cause incompleteness and avoid this problem by completing the transformed rewrite theory with suitable extra rules. More precisely, our methodology identifies the sources of incompleteness and derives a set of rules that are added to the transformed rewrite theory in order to preserve the semantics of the original theory. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient local unfolding with ancestor stacks for full Prolog

引用

14th international symposium on logic based program synthesis and transformation

作者： Puebla, G Albert, E Hermenegildo, M Tech U Madrid Sch Comp Sci Madrid Spain Univ Complutense Madrid Sch Comp Sci Madrid Spain Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Univ New Mexico Dept Elect & Comp Engn Albuquerque NM 87131 USA

ISBN: (纸本)3540266550

the integration of powerful partial evaluation methods into practical compilers for logic programs is still far from reality. this is related both to 1) efficiency issues and to 2) the complications of dealing with practical programs. Regarding efficiency, the most successful unfolding rules used nowadays are based on structural orders applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with any structural order and allows a stack-based implementation without losing any opportunities for specialization. Regarding the second issue, we propose assertion-based techniques which allow our approach to deal with real programs that include (Prolog) built-ins and external predicates in a very extensible manner. Finally, we report on our implementation of these techniques in a practical partial evaluator, embedded in a state of the art compiler which uses global analysis extensively (the Ciao compiler and, specifically, its preprocessor CiaoPP). the performance analysis of the resulting system shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：