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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是361-370 订阅

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

详细简洁

排序：

A Deductive System for FO(ID) Based on Least Fixpoint logic

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Hou, Ping Denecker, Marc Katholieke Univ Leuven Dept Comp Sci Louvain Belgium

ISBN: (纸本)9783642042379

the logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. the goal of this paper is to extend Gentzen's sequeut calculus to obtain a deductive inference method for FO(ID). the main difficulty in building Such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounded sets by least fixpoint expressions borrowed from stratified least fixpoint logic (SLFP), which is a logic with a least fixpoint operator and characterizes the expressibility of stratified logic programs. therefore, in this paper, we integrate least fixpoint expressions into FO(ID) and define the logic FO(ID,SLFP). We investigate a sequeut calculus for FO(ID,SLFP), which extends the sequent calculus for SLFP with inference rules for the inductive definitions of FO(ID). We show that this proof system is sound with respect to a slightly restricted fragment of FO(ID) and complete for a more restricted fragment of FO(ID).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Relevance-Driven Evaluation of Modular nonmonotonic logic Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Dao-Tran, Minh Eiter, thomas Fink, Michael Krennwallner, thomas Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783642042379

Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutually) recursive module calls. this call be used for more Succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at all efficient top-down evaluation of MLPs, considering only calls to relevant module instances. To this end, we generalize the well-known Splitting theorem to the MLP setting and present notions of call stratification, for which we determine sufficient conditions. Call-stratified MLPs allow to split module instantiations into two parts, one for computing input of module calls, and one for evaluating the calls themselves with subsequent computations. Based on these results, we develop a top-down evaluation procedure that expands only relevant module instantiations. Finally. we discuss syntactic conditions for its exploitation.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Computing Stable Models via Reductions to Difference logic

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Janhunen, Tomi Niemela, Ilkka Sevalnev, Mark Aalto Univ Dept Informat & Comp Sci FI-02015 Helsinki Finland

ISBN: (纸本)9783642042379

Propositional satisfiability (SAT) solvers provide a promising computational platform for logic programs under the stable model semantics. However. computing stable models of a logic program using a SAT solver presumes translating the program into a set of clauses which is the input form accepted by most SAT solvers. this leads to fairly complex super-linear translations. there are, however, interesting extensions to plain clausal propositional representations Such as difference logic. A number of solvers have been developed for difference logic, in particular in the context of the satisfiability modulo theories (SMT) framework. and the goal of the paper is to study whether Such engines could be harnessed to the computation of stable models for logic programs in an effective way. To this end, we provide succinct translations front logic programs to theories of difference logic and evaluate the potential of SMT solvers in the computation of stable models using, these translations and a selection of benchmarks.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Induction on Failure: Learning Connected Horn theories

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Kimber, Tim Broda, Krysia Russo, Alessandra Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England

ISBN: (纸本)9783642042379

Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed example. A common denominator of these systems, is a restricted hypothesis search space, within which each clause must individually explain some example E, or some member of an abductive explanation for E. this paper proposes a new IE approach, called Induction on Failure (IoF), that generalises existing Horn clause learning systems by allowing the computation of hypotheses within a larger search space, namely that of Connected theories. A proof procedure for IoF is proposed that generalises existing IE systems and also resolves Yamamoto's example. A prototype implementation is also described. Finally, a semantics is presented called Connected theory Generalisation, which is proved to extend Kernel Set Subsumption and to include hypotheses constructed within this new IoF approach.

关键词： Inductive logic programming Inverse Entailment Abduction

来源：评论

学校读者我要写书评

暂无评论

Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Ishebabi, Harold Mahr, Philipp Bobda, Christophe Gebser, Martin Schaub, Torsten Univ Potsdam Inst Informat D-14482 Potsdam Germany

ISBN: (纸本)9783642042379

Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility Of field-programmable devices to customize architectures for parallel programs, thereby alleviating technological limitations due to memory bandwidth and power Consumption. Given the huge size of the design Space Of Such Systems, it is important to automatically optimize design parameters in order to facilitate wide and disciplined explorations. Being a combinatorial problem. system design can be modeled and solved as Such, but the amount of parameters renders the problem difficult to Solve for large instances. However. its the synthesis problem usually exhibits structure, Answer Set programming (ASP), for which solvers utilizing techniques from the propositional satisfiability domain are available, can be effectively employed. this paper presents a design flow based on ASP that uses the solver clasp as back-end engine. Synthesis experiments demonstrate the effectiveness of the approach.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A General Approach to the Verification of Cryptographic Protocols Using Answer Set programming

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Delgrande, James P. Grote, Torsten Hunter, Aaron Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642042379

We introduce a general approach to cryptographic protocol verification based oil answer set programming. In our approach, cryptographic protocols are represented as extended logic programs where the answer Sets correspond to traces of protocol runs. Using queries, we can find attacks on a protocol by finding the answer sets for the corresponding logic program. Our encoding is modular, with different modules representing the message passing environment, the protocol Structure and the intruder model. We can easily tailor each module to suit a specific application, while keeping the rest of the encoding constant. As such. our approach is more flexible and elaboration tolerant than related formalizations. the present system is intended as a first step towards the development of a compiler from protocol specifications to executable programs: such a compiler would make verification a completely automated process. this work is also part of a larger project in which we are exploring the advantages of explicit, declarative representations of protocol verification problems.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

A Revised Concept of Safety for General Answer Set Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Cabalar, Pedro Pearce, David Valverde, Agustin Univ A Coruna La Coruna Spain Univ Politecn Madrid Madrid Spain Univ Malaga E-29071 Malaga Spain

ISBN: (纸本)9783642042379

To ensure a close relation between the answer sets of a program and those of its ground version, some answer set solvers deal with variables by requiring a safety condition on program rules. If we go beyond the syntax of disjunctive programs, for instance by allowing rules with nested expressions, or perhaps even arbitrary first-order formulas, new definitions of safety are required. In this paper we consider a new concept of safety for formulas in quantified equilibrium logic where answer sets can be defined for arbitrary first-order formulas. the new concept captures and generalises two recently proposed safety definitions: that of Lee, Lifschitz and Palla (2008) as well as that of Bria, Faber and Leone (2008). We Study the main metalogical properties of safe formulas.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Puehrer, Joerg Tompits, Hans Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria

ISBN: (纸本)9783642042379

In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at studying conditions under which certain syntactic constructs can be eliminated from programs preserving some given equivalence relation. In this paper, we continue this endeavour introducing novel conditions under which disjunction and negation can be eliminated from answer-set programs under relativised strong equivalence with projection. this notion is a generalisation of the usual strong-equivalence relation, as introduced by Lifschitz. Pearce, and Valverde, by allowing parametrisable context and Output alphabets, which is an important feature in view of practical programming techniques like the use of local variables and modules. We provide model-theoretic conditions that hold for a disjunctive logic program P precisely when there is a program Q, equivalent to P under our considered notion, Such that Q is either positive, normal, or Horn, respectively. Moreover, we outline how such a Q, called a casting of P, can be obtained, and consider complexity issues.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Manifold Answer-Set Programs for Meta-reasoning

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Faber, Wolfgang Woltran, Stefan Univ Calabria I-87030 Commenda Di Rende Italy Vienna Univ Technol A-1040 Vienna Austria

ISBN: (纸本)9783642042379

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but Slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P-1 as input to another program P-2 in order to provide the desired Solutions to the problem to be solved. In practice, the evaluation of the program P-1 Currently has to be decopuled from the evaluation of P-2 using an intermediate step which collects the desired consequences of P-1 and provides them as input to P-2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies oil rewriting P-1 into a so-called manifold program. which allows for accessing all desired consequences of P-1 within a single answer set. then, this manifold program can be evaluated jointly with P-2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As an application, we present all encoding for computing the ideal extension of,in abstract argumentation framework.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs

引用

10th international conference on logic programming and nonmonotonic reasoning

作者： Calimeri, Francesco Cozza, Susanna Ianni, Giovambattista Leone, Nicola Univ Calabria Dept Math I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783642042379

the support for function symbols in logic programming under answer set semantics allows to overcome some modeling limitations of traditional Answer Set programming (ASP) systems, Such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Lately. the research community is focusing on finding proper subclasses for which decidability of inference is guaranteed. the two major proposals, so far, are finitary programs and finitely-ground programs. these two proposals are somehow complementary: indeed, the former is conceived to allow decidable querying (by means of a top-down evaluation strategy), while file latter supports the computability of answer-sets (by means of a bottom-up evaluation strategy). One of the main advantages of finitely-ground programs is that they can be "directly" evaluated by Current ASP systems, which are based on a bottom-up computational model. However, there are also some interesting programs which are suitable for top-down query evaluation;but do not fall in the class of finitely-ground programs. In this paper, we focus on disjunctive finitely-recursive Positive (DFRP) programs. We present a proper adaptation of the magic-sets technique for DFRP programs, which ensures query equivalence under both brave and cautious reasoning. We show that, if the input program is DFRP, then its magic-set rewriting is guaranteed to be finitely ground. thus, reasoning oil DFRP programs turns Out to be decidable, and we provide an effective method for its computation on the ASP system DLV.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：