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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

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

共 719 条记录，以下是621-630 订阅

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

详细简洁

排序：

A Hoare-like calculus using the SROIQσ logic on transformations of graphs

A Hoare-like calculus using the SROIQσ logic on transformat...

引用

8th IFIP TC 1/WG 2.2 international conference on theoretical Computer Science, TCS 2014

作者： Brenas, Jon Haël Echahed, Rachid Strecker, Martin CNRS University of Grenoble France Université de Toulouse IRIT France

ISBN: (纸本)9783662446010

We tackle the problem of partial correctness of programs processing structures defined as graphs. We introduce a kernel imperative programming language endowed with atomic actions that participate in the transformation of graph structures and provide a decidable logic for reasoning about these transformations in a Hoare-style calculus. the logic for reasoning about the transformations (baptized SROIQσ) is an extension of the Description logic (DL) SROIQ, and the graph structures manipulated by the programs are models of this logic. the programming language is non-standard in that it has an instruction set targeted at graph manipulations (such as insertion and deletion of arcs), and its conditional statements (in loops and selections) are SROIQσ formulas. the main challenge solved in this paper is to show that the resulting proof problems are decidable. © 2014 IFIP international Federation for Information Processing.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Bounded model checking with description logic reasoning

引用

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

作者： Ben-David, Shoham Trefler, Richard Weddell, Grant Univ Waterloo David R Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783540730989

Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the system is unfolded until a given depth, and translated into a CNF formula. A SAT solver is then applied to the CNF formula, to find a satisfying assignment. Such a satisfying assignment, if found, demonstrates an error in the model of the concurrent system. Description logic (DL) is a family of knowledge representation formalisms, for which reasoning is based on tableaux techniques. We show how Description logic can serve as a natural setting for representing and solving a BMC problem. We formulate a bounded model checking problem as a consistency problem in the DL dialect ACCI. Our formulation results in a compact representation of the model, one that is linear in the size of the model description, and does not involve any unfolding of the model. Experimental results, using the DL reasoner FaCT(++), significantly improve on a previous approach that used DL reasoning for model checking.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Planning with different forms of domain-dependent control knowledge - An answer set programming approach

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Son, Tran Cao Baral, Chitta McIlraith, Sheila Department of Computer Science New Mexico State University MSC CS PO Box 30001 Las Cruces NM 88003 United States Department of Computer Science and Engineering Arizona State University Tempe AZ 85287 United States Knowledge Systems Laboratory Computer Science Stanford University Stanford CA 94305 United States

ISBN: (纸本)3540425934

In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning with temporal knowledge into ASP. To do so, we view domain-dependent control knowledge as sets of independent constraints. An advantage of this approach is that domain-dependent control knowledge can be modularly formalized and added to the planning problem as desired. We define a set of constructs for constraint representation and provide a set of domain-independent logic programming rules for checking constraint satisfaction. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Cplus 2ASP: Computing action language C+ in answer set programming

Cplus 2ASP: Computing action language C+ in answer set progr...

引用

12th international conference on logic programming and nonmonotonic reasoning, LPNMR 2013

作者： Babb, Joseph Lee, Joohyung School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ United States

ISBN: (纸本)9783642405631

We present Version 2 of system Cplus2ASP, which implements the definite fragment of action language C+. Its input language is fully compatible with the language of the Causal Calculator Version 2, but the new system is significantly faster thanks to modern answer set solving techniques. the translation implemented in the system is a composition of several recent theoretical results. the system orchestrates a tool chain, consisting of f2lp, clingo, iclingo, and as2transition. Under the incremental execution mode, the system translates a C+ description into the input language of iclingo, exploiting its incremental grounding mechanism. the correctness of this execution is justified by the module theorem extended to programs with nested expressions. In addition, the input language of the system has many useful features, such as external atoms by means of Lua calls and the user interactive mode. the system supports extensible multi-modal translations for other action languages, such as B and BC, as well. © 2013 Springer-Verlag.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Web Stream reasoning in Practice: On the Expressivity vs. Scalability Tradeoff 1

引用

9th international conference on Web reasoning and Rule Systems (RR)

作者： Germano, Stefano Pham, thu-Le Mileo, Alessandra Univ Calabria Dept Math & Comp Sci I-87036 Cosenza Italy Natl Univ Ireland Insight Ctr Data Analyt Galway Ireland

ISBN: (数字)9783319220024

ISBN: (纸本)9783319220024;9783319220017

Advances in the Internet of things and the Web of Data created huge opportunities for developing applications that can generate actionable knowledge out of streaming data. the trade-off between scalability and expressivity is a key challenge in this setting, and more investigation is required to identify what are the relevant features in optimizing this trade-off, and what role do they have in the optimization. In this paper we motivate the need for heuristics to design adaptive solutions and, following an empirical approach, we highlight some key concepts and ideas that can guide the design of heuristics for adaptive optimization of Web Stream reasoning.

关键词： Stream reasoning logic programming Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Beyond logic programming for Legal reasoning 39

Beyond Logic Programming for Legal Reasoning

引用

39th international conference on logic programming Workshops, ICLP Workshops 2023

作者： Nguyen, Ha thanh Toni, Francesca Stathis, Kostas Satoh, Ken 2-1-2 Hitotsubashi Chiyoda City Tokyo Japan Imperial College London Exhibition Rd South Kensington LondonSW7 2BX United Kingdom Royal Holloway University of London Egham Hill EghamTW20 0EX United Kingdom

logic programming has long being advocated for legal reasoning, and several approaches have been put forward relying upon explicit representation of the law in logic programming terms. In this position paper we focus on the PROLEG logic-programming-based framework for formalizing and reasoning with Japanese presupposed ultimate fact theory. Specifically, we examine challenges and opportunities in leveraging deep learning techniques for improving legal reasoning using PROLEG, identifying four distinct options ranging from enhancing fact extraction using deep learning to end-to-end solutions for reasoning with textual legal descriptions. We assess advantages and limitations of each option, considering their technical feasibility, interpretability, and alignment with the needs of legal practitioners and decision-makers. We believe that our analysis can serve as a guideline for developers aiming to build effective decision-support systems for the legal domain, while fostering a deeper understanding of challenges and potential advancements by neuro-symbolic approaches in legal applications. 2023 Copyright for this paper by its authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Optimizing the computation of heuristics for answer set programming systems

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Faber, Wolfgang Leone, Nicola Pfeifer, Gerald Institut fur Informationssysteme TU Wien A-1040 Wien Austria Italy

ISBN: (纸本)3540425934

Most SAT solvers and Answer Set programming (ASP) systems employ a backtracking search by repeatedly assuming the truth of literals. the choice of these branching literals is crucial for the performance of these systems. Competitive ASP systems employ advanced heuristics to select branching literals, which are usually based on "look-ahead" techniques: To evaluate the heuristic value of a literal L, truth and falsity of L are assumed in the current interpretation, consequences are derived, and the quality of the resulting interpretations is evaluated. this process can be very expensive, and often consumes most of the time taken by an ASP system. In this paper, we present two techniques to optimize the computation of the heuristics in the ASP system DLV. the first technique singles out pairs of literals {A, not B) having precisely the same consequences, which allows for making only one look-ahead for each of these pairs. the second technique (inspired by SAT solvers) is a 2-layered heuristic, in which a simple heuristic criterion reduces the set of literals to be looked-ahead. We implement both techniques in the ASP system DLV and evaluate their efficiency on a number of benchmark problems taken from various domains. the experiments confirm the usefulness of both techniques, sensibly improving the performance of DLV. © Springer-Verlag Berlin Heidelberg 2001.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Fundamentals of Computation theory, FCT 1989

引用

7th international conference on Fundamentals of Computation theory, FCT 1989

ISBN: (纸本)9783540514985

the proceedings contain 47 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Completeness in approximation classes;separating completely complexity classes related to polynomial size Ω-decision trees;on product hierarchies of automata;on the communication complexity of planarity;Context-free NCE graph grammars;dynamic data structures with finite population: A combinatorial analysis;iterated deterministic top-down look-ahead;using generating functions to compute concurrency;a logic for nondeterministic functional programs;Complexity classes with complete problems between P and NP-C;decision problems and Coxeter groups;complexity of formula classes in first order logic with functions;normal and sinkless Petri nets;descriptive and computational complexity;the effect of null-chains on the complexity of contact schemes;monte-Carlo inference and its relations to reliable frequency identification;semilinear real-time systolic trellis automata;inducibility of the composition of frontier-to-root tree transformations;on oblivious branching programs of linear length;some time-space bounds for one-tape deterministic turing machines;interpretations of synchronous flowchart schemes;rank of rational finitely generated W-languages;extensional properties of sets of time bounded complexity;learning under uniform distribution;an extended framework for default reasoning;logic programming of some mathematical paradoxes;analysis of compact 0-complete trees: A new access method to large databases;representation of recursively enumerable languages using alternating finite tree recognizers;about a family of binary morphisms which stationary words are Sturmian;on the finite degree of ambiguity of finite tree automata;approximation algorithms for channel assignment in cellular radio networks;Generalized Boolean hierarchies and Boolean hierarchies over RP.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Omega-restricted logic programs

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Syrjanen, Tommi Helsinki University of Technology Dept. of Computer Science and Eng. Laboratory for Theoretical Computer Science P.O. Box 5400 FIN-02015 Hut Finland

ISBN: (纸本)3540425934

We define a new syntactic class of logic programs, omega-restricted programs. We divide the predicate symbols of a logic program into two parts: domain and non-domain predicates, where the domain predicates are defined by the maximal stratifiable subset of the rules of the program. We extend the usual definition of stratification by adding a special omega-stratum that holds all unstratifiable predicates of the program. We demand that all variables that occur in a rule also occur in the rule body in a positive literal that is on a lower stratum than rule head. this restriction is syntactic and can be checked efficiently. the existence of a stable model of an omega-restricted program is decidable even when function symbols are allowed. We prove that the problem is 2-NEXP-complete and identify subclasses of omega-restricted programs such that the problem stays in NEXP or NP. the class of omega-restricted programs is implemented in the SMODELS system. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

A Coalgebraic Approach to Linear-Time logics

引用

17th international conference on the Foundations of Software Science and Computation Structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of Software (ETAPS)

作者： Cirstea, Corina Univ Southampton Southampton Hants England

ISBN: (纸本)9783642548307;9783642548291

We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model systems with branching as coalgebras whose type arises as the composition of a branching monad and a polynomial endofunctor on the category of sets, and employ a set of truth values induced canonically by the branching monad. this yields logics for reasoning about quantitative aspects of linear-time behaviour. Examples include reasoning about the probability of a linear-time behaviour being exhibited by a system with probabilistic branching, or about the minimal cost of a linear-time behaviour being exhibited by a system with weighted branching. In the case of non-deterministic branching, our logic supports reasoning about the possibility of exhibiting a given linear-time behaviour, and therefore resembles an existential version of the logic LTL.

关键词： branches Formal logic time characteristic reasoning Probability WDR92 gene set value

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 59 60 61 62 63 64 65 66 67 68 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：