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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

95 篇 会议
7 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

70 篇 工学
- 67 篇 计算机科学与技术...
- 53 篇 软件工程
- 7 篇 电气工程
- 4 篇 控制科学与工程
- 3 篇 仪器科学与技术
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 生物医学工程（可授...
24 篇 理学
- 24 篇 数学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 3 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
2 篇 法学
- 2 篇 法学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...

主题

25 篇 logic gates
20 篇 logic programmin...
9 篇 silicon
5 篇 capacitance
5 篇 answer set progr...
4 篇 delays
4 篇 mathematical log...
4 篇 algorithm design...
4 篇 programming tech...
4 篇 hardware
4 篇 logics and meani...
3 篇 registers
3 篇 stream reasoning
3 篇 films
3 篇 vectors
3 篇 linear programmi...
3 篇 overgrounding
3 篇 probabilistic lo...
3 篇 electric fields
3 篇 grounding

机构

3 篇 univ calabria de...
2 篇 department of ph...
2 篇 abb research lad...
2 篇 dipartimento di ...
2 篇 univ new s wales...
2 篇 department of mi...
2 篇 institute of sol...
1 篇 univ paris cnrs ...
1 篇 wesleyan univers...
1 篇 science and tech...
1 篇 tyndall national...
1 篇 department of co...
1 篇 univ porto dep c...
1 篇 univ calabria de...
1 篇 the pennsylvania...
1 篇 vienna universit...
1 篇 katholieke univ ...
1 篇 univ wisconsin d...
1 篇 univ nova lisboa...
1 篇 univ rennes inri...

作者

4 篇 zangari jessica
3 篇 ianni giovambatt...
3 篇 pacenza francesc...
2 篇 i. pappas
2 篇 maher michael j.
2 篇 dovier agostino
2 篇 peter j. stuckey
2 篇 gennady i. zebre...
2 篇 calimeri frances...
2 篇 n. novkovski
2 篇 perri simona
1 篇 sun yanchun
1 篇 ali khayri a. m.
1 篇 karlsson roland
1 篇 mileo alessandra
1 篇 bhattacharya sam...
1 篇 sileno giovanni
1 篇 kaminski r.
1 篇 chun-hung chen
1 篇 polleres axel

语言

104 篇 英文
2 篇 其他

检索条件"任意字段=28th International Conference on Logic Programming, ICLP 2012"

共 106 条记录，以下是51-60 订阅

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

详细简洁

排序：

A Machine Learning guided Rewriting Approach for ASP logic Programs 36

A Machine Learning guided Rewriting Approach for ASP Logic P...

引用

36th international conference on logic programming (iclp)

作者： Mastria, Elena Zangari, Jessica Perri, Simona Calimeri, Francesco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

Answer Set programming (ASP) is a declarative logic formalism that allows to encode computational problems via logic programs. Despite the declarative nature of the formalism, some advanced expertise is required, in general, for designing an ASP encoding that can be efficiently evaluated by an actual ASP system. A common way for trying to reduce the burden of manually tweaking an ASP program consists in automatically rewriting the input encoding according to suitable techniques, for producing alternative, yet semantically equivalent, ASP programs. However, rewriting does not always grant benefits in terms of performance;hence, proper means are needed for predicting their effects with this respect. In this paper we describe an approach based on Machine Learning (ML) to automatically decide whether to rewrite. In particular, given an ASP program and a set of input facts, our approach chooses whether and how to rewrite input rules based on a set of features measuring their structural properties and domain information. To this end, a Multilayer Perceptrons model has then been trained to guide the ASP grounder I -DLV on rewriting input rules. We report and discuss the results of an experimental evaluation over a prototypical implementation.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Sampling-Based SAT/ASP Multi-model Optimization as a Framework for Probabilistic Inference 1

引用

28th international conference on Inductive logic programming (ILP)

作者： Nickles, Matthias Natl Univ Ireland Sch Engn & Informat Galway Ireland

ISBN: (数字)9783319999609

ISBN: (纸本)9783319999609;9783319999593

this paper proposes multi-model optimization through SAT witness or answer set sampling, with common probabilistic reasoning tasks as primary use cases (including deduction-style probabilistic inference and hypothesis weight learning). Our approach enhances a state-of-the-art SAT/ASP solving algorithm with Gradient Descent as branching literal decision approach, and optionally a cost backtracking mechanism. Sampling of models using these methods minimizes a task-specific, user-provided multi-model cost function while adhering to given logical background knowledge (either a Boolean formula in CNF or a normal logic program under stable model semantics). Features of the framework include its relative simplicity and high degree of expressiveness, since arbitrary differentiable cost functions and background knowledge can be provided.

关键词： Probabilistic logic programming SAT Answer set programming Projective gradient descent Numerical optimization Relational AI

来源：评论

学校读者我要写书评

暂无评论

ChatGPT for PLC/DCS Control logic Generation 28

ChatGPT for PLC/DCS Control Logic Generation

引用

28th IEEE international conference on Emerging Technologies and Factory Automation, ETFA 2023

作者： Koziolek, Heiko Gruener, Sten Ashiwal, Virendra ABB Research Ladenburg Germany

ISBN: (纸本)9798350339918

Large language models (LLMs) providing generative AI have become popular to support software engineers in creating, summarizing, optimizing, and documenting source code. It is still unknown how LLMs can support control engineers using typical control programming languages in programming tasks. Researchers have explored Github CoPilot or DeepMind AlphaCode for source code generation but did not yet tackle control logic programming. A key contribution of this paper is an exploratory study, for which we created 100 LLM prompts in 10 representative categories to analyze control logic generation for of PLCs and DCS from natural language. We tested the prompts by generating answers with ChatGPT using the GPT-4 LLM. It generated syntactically correct IEC 61131-3 Structured Text code in many cases and demonstrated useful reasoning skills that could boost control engineer productivity. Our prompt collection is the basis for a more formal LLM benchmark to test and compare such models for control logic generation. © 2023 IEEE.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Computational logic — CL 2000 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： John Lloyd Veronica Dahl Ulrich Furbach Manfred Kerber Kung-Kiu Lau Catuscia Palamidessi Luís Moniz Pereira Yehoshua Sagiv Peter J. Stuckey

ISBN: (数字)9783540449577

ISBN: (纸本)9783540677970

these are the proceedings of the First international conference on Compu- tional logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. the theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. the conference was collocated with the following events: { 6th international conference on Rules and Objects in Databases (DOOD 2000) { 10th international Workshop on logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th international conference on Inductive logic programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { logic programming: theory and Extensions { Constraints { Automated Deduction: Putting theory into Practice { Knowledge Representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { logic programming: Implementations and Applications. the LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. the acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream.

关键词： Artificial Intelligence Software Engineering/programming and Operating Systems Computer System Implementation Mathematical logic and Formal Languages logics and Meanings of Programs programming Techniques

来源：评论

学校读者我要写书评

暂无评论

2SAT based Infeasibility Resolution during Design Rule Correction on Layouts with Multiple Grids 28

2SAT based Infeasibility Resolution during Design Rule Corre...

引用

28th international conference on VLSI Design (VLSID) / 14th international conference on Embedded Systems

作者： Salodkar, Nitin Rajagopalan, Subramanian Bhattacharya, Sambuddha Batterywala, Shabbir Samsung Res Inst Bangalore Karnataka India Synopsys India Pvt Ltd Bangalore Karnataka India

ISBN: (纸本)9781479966585

Traditionally, automatic design rule correction (DRC) problem is modeled as a linear program with technology rules and design intents modeled as difference constraints under a minimum perturbation objective. However, these linear programs are often infeasible due to conflicts arising from rules and intents, lack of space or due to incomplete modeling. It is then required to identify problematic constraints and either dilute or drop them to make the linear program feasible. In presence of uniform grid and only difference type constraints, a weighted constraint graph is constructed and infeasibilities are detected as positive cycles. However, this approach breaks down in presence of multiple layer specific grids or discrete track patterns. In this paper, we suggest a novel method for Infeasible Constraint Set Identification (ICSI) for such layouts. Our method transforms the constraint set into a Boolean implications set. Since each implication has only two variables, solving the ICSI problem amounts to determining 2-Satisfiability of the implications set. We then suggest various strategies to resolve infeasibilities.

关键词： Boolean functions computability integrated circuit layout logic design 2SAT based infeasibility resolution Boolean implications set ICSI design rule correction discrete track patterns infeasible constraint set identification multiple layer specific grids Algorithm design and analysis Geometry Layout Shape Transforms Vectors Very large scale integration DRC VLSI grid Very large scale integration layouts Algorithm design and analysis grids Intracytoplasmic Sperm Injections integrated circuit layout logic design computability Transform Boolean functions linear programming geometry distributed revision control system

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal logic 28th

Operational Semantics and Program Verification Using Many-So...

引用

28th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Leustean, Ioana Moanga, Natalia Serbanuta, Traian Florin Univ Bucharest Fac Math & Comp Sci Str Academiei 14 Bucharest 010014 Romania

ISBN: (纸本)9783030290269;9783030290252

We propose a general framework to allow: (a) specifying the operational semantics of a programming language;and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal logic, for which we prove its completeness results. We believe that our approach to program verification improves over the existing approaches within modal logic as (1) it is based on operational semantics which enables a more natural description of the execution than Hoare-style weakest precondition used by dynamic logic;(2) since it is multi-sorted, it allows for a clearer encoding of semantics, with a smaller representational distance to its intended meaning.

关键词： Operational semantics Program verification Hybrid modal logic Many sorted logic

来源：评论

学校读者我要写书评

暂无评论

Model checking communication protocols 28th

引用

28th international conference on Current Trends in theory and Practice of Informatics, SOFSEM 2001

作者： Argón, Pablo Delzanno, Giorgio Mukhopadhyay, Supratik Podelski, Andreas IRCyN 1 rue de la Noë BP 92101 Nantes44321 France Max-Planck-Institut für Informatik Im Stadtwald Saarbrücken66123 Germany

ISBN: (纸本)9783540429128

Brand and Zafiropulo [1] introduced the model of communicating finite-state machines to represent a distributed system connected with FIFO channels. Several different communication protocols can be specified with this simple model. In this paper we address the problem of automatically validating protocols by verifying properties such as well-formedness and absence of deadlock. Our method is based on a representation of communicating finite-state machines in terms of logic programs. this leads to efficient verification algorithms based on the ground and non-ground semantics of logic programming. © Springer-Verlag Berlin Heidelberg 2001.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 28th IEEE international conference on Software Maintenance, ICSM 2012

Proceedings of the 28th IEEE International Conference on Sof...

引用

28th IEEE international conference on Software Maintenance, ICSM 2012

ISBN: (纸本)9781467323123

the proceedings contain 82 papers. the topics discussed include: an industrial case study of Coman's automated task detection algorithm: what worked, what didn't, and why;Vasco: a visual approach to explore object churn in framework-intensive applications;what makes a good code example? a study of programming Q&A in-stack overflow;code coverage-based regression test selection and prioritization in the webkit system;an empirical analysis of the distribution of unit test smells and their impact on software maintenance;interactive fault localization leveraging simple user feedbacks;finding errors from reverse-engineered equality models using a constraint solver;the order of things: how developers sort fields and methods;a change-impact analysis to characterize evolving program behaviors;fine-grained change impact analysis for component-based product families;and configuration selection using code change impact analysis for regression testing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated hypothesis cover set testing for learning in logic 28

GPU-accelerated hypothesis cover set testing for learning in...

引用

Up-and-Coming and Short Papers of the 28th international conference on Inductive logic programming, UCS-ILP 2018

作者： Algahtani, Eyad Kazakov, Dimitar University of York Heslington YorkYO10 5GH United Kingdom

ILP learners are commonly implemented to consider sequentially each training example for each of the hypotheses tested. Computing the cover set of a hypothesis in this way is costly, and introduces a major bottleneck in the learning process. this computation can be implemented more efficiently through the use of data level parallelism. Here we propose a GPU-accelerated approach to this task for propositional logic and for a subset of first order logic. this approach can be used with one’s strategy of choice for the exploration of the hypothesis space. At present, the hypothesis language is limited to logic formulae using unary and binary predicates, such as those covered by certain types of description logic. the approach is tested on a commodity GPU and datasets of up to 200 million training examples, achieving run times of below 30ms per cover set computation. © 2018 CEUR-WS. All rights reserved.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：