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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

59 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 35 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
20 篇 理学
- 17 篇 数学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 化学

主题

19 篇 logic programmin...
5 篇 semantics
4 篇 computer circuit...
3 篇 well-founded sem...
3 篇 temporal logic
2 篇 linear logic
2 篇 fixpoint semanti...
2 篇 time granularity
2 篇 bottom-up evalua...
2 篇 static analysis
2 篇 computers
2 篇 automata theory
2 篇 non-monotonic re...
1 篇 intrusion detect...
1 篇 calml3 gene
1 篇 constraint logic...
1 篇 lattices
1 篇 formal logic
1 篇 prolog (programm...
1 篇 higher-order log...

机构

2 篇 univ koblenz dep...
2 篇 department of co...
2 篇 artificial intel...
2 篇 univ udine dept ...
2 篇 univ g dannunzio...
2 篇 institut für inf...
2 篇 univ genoa dipar...
2 篇 irst itc i-38050...
1 篇 facoltà di scien...
1 篇 univ ghent dept ...
1 篇 information engi...
1 篇 stanford univers...
1 篇 dept. computer s...
1 篇 liens ecole norm...
1 篇 28660-boadilla d...
1 篇 university of te...
1 篇 department of co...
1 篇 knowledge based ...
1 篇 cognitive engine...
1 篇 dipartimento di ...

作者

3 篇 you jia-huai
2 篇 stolzenburg f
2 篇 konczak kathrin
2 篇 martelli m
2 篇 schaub torsten
2 篇 montanari a
2 篇 franceschet m
2 篇 bozzano m
2 篇 gelfond michael
2 篇 brogi a
2 篇 delzanno g
2 篇 linke thomas
2 篇 dix j
2 篇 konolige kurt
1 篇 mileo alessandra
1 篇 risch v.
1 篇 shen yi-dong
1 篇 mancarella p
1 篇 wakayama toshiro
1 篇 alvaro peter

语言

61 篇 英文
1 篇 其他

检索条件"任意字段=2nd International Workshop on Non-Monotonic Extensions of Logic Programming"

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

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

详细简洁

排序：

Temporalized logics and automata for time granularity

Temporalized logics and automata for time granularity

引用

2nd international workshop on Verification and Computational logic (VCL 2001)

作者： Franceschet, M Montanari, A Univ G dAnnunzio Dept Sci Pescara Italy Univ Udine Dept Math & Comp Sci I-33100 Udine Italy

The ability of providing and relating temporal representations at different 'grain levels' of the same reality is an important research theme in computer science and a major requirement for many applications, including formal specification and verification, temporal databases, data mining, problem solving, and natural language understanding. In particular, the addition of a granularity dimension to a temporal logic makes it possible to specify in a concise way reactive systems whose behaviour can be naturally modeled with respect to a (possibly infinite) set of differently-grained temporal domains. Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the monadic second-order theories of downward unbounded layered structures, which are infinitely refinable structures consisting of a coarsest domain and an infinite number of finer and finer domains, and of upward unbounded layered structures, which consist of a finest domain and an infinite number of coarser and coarser domains, with expressively complete and elementarily decidable temporal logic counterparts. We obtain such a result in two steps. First, we define a new class of combined automata, called temporalized automata, which can be proved to be the automata-theoretic counterpart of temporalized logics, and show that relevant properties, such as closure under Boolean operations, decidability, and expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones. Then, we exploit the correspondence between temporalized logics and automata to reduce the task of finding the temporal logic counterparts of the given theories of time granularity to the easier one of finding temporalized automata counterparts of them.

关键词： time granularity temporal logic automata theory

来源：评论

学校读者我要写书评

暂无评论

A nonmonotonic logic for reasoning about speech acts and belief revision 2nd

A nonmonotonic logic for reasoning about speech acts and bel...

引用

2nd international workshop on non-monotonic Reasoning, 1988

作者： Appelt, Douglas E. Konolige, Kurt Artificial Intelligence Center Center for the Study of Language and Information SRI International Menlo ParkCA94025 United States

ISBN: (纸本)9783540507017

A prerequisite to a theory of the way agents understand speech acts is a theory of how their beliefs and intentions are revised as a consequence of events. This process of attitude revision is an interesting domain for the application of nonmonotonic reasoning because speech acts have a conventional aspect that is readily represented by defaults, but that interacts with an agent's beliefs and intentions in many complex ways that may override the defaults. Perrault has developed a theory of speech acts, based on Rieter's default logic, that captures the conventional aspect;it does not, however, adequately account for certain easily observed facts about attitude revision resulting from speech acts. A natural theory of attitude revision seems to require a method of stating preferences among competing defaults. We present here a speech act theory, formalized in hierarchic autoepistemic logic (a refinement of Moore's autoepistemic logic), in which revision of both the speaker's and hearer's attitudes can be adequately described. As a collateral benefit, efficient automatic reasoning methods for the formalism exist. The theory has been implemented and is now being employed by an utterance-planning system. © Springer-Verlag Berlin Heidelberg 1989.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Ranking Services Using Fuzzy HEX Programs

引用

2nd international Conference on Web Reasoning and Rule Systems

作者： Heymans, Stijn Toma, Ioan Vienna Univ Technol Knowledge Based Syst Grp Inst Informat Syst Vienna Austria Univ Ghent Dept Appl Math & Comp Sci Computat Web Intelligence B-9000 Ghent Belgium Univ Innsbruck STI A-6020 Innsbruck Austria

ISBN: (纸本)9783540887362

The need to reason with knowledge expressed in both logic programming (LP) and Description logics (DLs) paradigms on the Semantic Web lead to several integrating formalisms, e.g., Description logic programs (dl-programs) allow a logic program to retrieve results front and feed results to a DL knowledge base. Two functional extensions of (dl-programs are HEX programs and fuzzy dl-programs. The former abstract away from DLs, allowing for general external queries, the latter deal with the uncertain, vague, and inconsistent nature of knowledge oil the Web by means of fuzzy logic mechanisms. In this paper, we generalize both HEX programs and fuzzy dl-programs to fuzzy HEX programs: a LP-based paradigm, supporting both fuzziness is well as reasoning with external sources. We define basic syntax and semantics and analyze the framework semantically, e.g., by investigating the complexity. Additionally, we provide a translation front fuzzy HEX programs to HEX programs, enabling an implementation via the dlvhex reasoner. Finally, we illustrate the use of fuzzy HEX programs for ranking services by using them to model non-functional properties of services and user preferences.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

2nd Joint international workshop on Process Algebra and Probabilistic Methods: Performance Modeling and Verification PAPM-PROBMIV 2002

引用

2nd Joint international workshop on Process Algebra and Probabilistic Methods and Performance Modeling and Verification, PAPM-PROBMIV 2002 held as part of the Federated logic Conference, FLoC 2002

ISBN: (纸本)9783540439134

The proceedings contain 16 papers. The special focus in this conference is on Process Algebra, Probabilistic Methods. The topics include: Failure detection vs group membership in fault-tolerant distributed systems;challenges for secure programming;security analysis of a probabilistic non-repudiation protocol;the mean value of the maximum;reduction and refinement strategies for probabilistic analysis;action refinement for probabilistic processes with true concurrency models;probabilistic unfoldings and partial order fairness in petri nets;possibilistic and probabilistic abstraction-based model checking;out-of-core solution of large linear systems of equations arising from stochastic modelling;model checking CSL until formulae with random time bounds;deriving symbolic representations from stochastic process algebras;a generalization of equational proof theory;an integrated approach for the specification and analysis of stochastic real-time systems;probabilistic abstract interpretation and statistical testing and approximate verification of probabilistic systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A circumscriptive theorem prover 2nd

A circumscriptive theorem prover

引用

2nd international workshop on non-monotonic Reasoning, 1988

作者： Ginsberg, Matthew L. Computer Science Department Stanford University StanfordCA94305 United States

ISBN: (纸本)9783540507017

In [6], a generalization of first-order logic was introduced that led to the development of an effective theorem prover for some simple sorts of default reasoning. In this paper, we show that these ideas can also be used to construct a theorem prover for a wide class of circumscriptive theories. The ideas to be discussed have been implemented, and the resulting system has been applied to the canonical birds flying example, to a non-separable circumscription [9], and to the Yale shooting problem. In all of these cases, the implementation returns the circumscriptively correct answer. © Springer-Verlag Berlin Heidelberg 1989.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Hierarchic autoepistemic theories for nonmonotonic reasoning: Preliminary report 2nd

Hierarchic autoepistemic theories for nonmonotonic reasoning...

引用

2nd international workshop on non-monotonic Reasoning, 1988

作者： Konolige, Kurt Artificial Intelligence Center Center for the Study of Language and Information SRI International Menlo ParkCA94025 United States

ISBN: (纸本)9783540507017

nonmonotonic logics are meant to be a formalization of nonmonotonic reasoning. However, for the most part they fail to embody two of the most important aspects of such reasoning: the explicit computational nature of nonmonotonic inference, and the assignment of preferences among competing inferences. We propose a method of nonmonotonic reasoning in which the notion of inference from specific bodies of evidence plays a fundamental role. The formalization is based on autoepistemic logic, but introduces additional structure, a hierarchy of evidential spaces. The method offers a natural formalization of many different applications of nonmonotonic reasoning, including reasoning about action, speech acts, belief revision, and various situations involving competing defaults. © Springer-Verlag Berlin Heidelberg 1989.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Confluence analysis for distributed programs: A model-theoretic approach

Confluence analysis for distributed programs: A model-theore...

引用

2nd international workshop on Datalog in Academia and Industry, Datalog 2.0

作者： Marczak, William R. Alvaro, Peter Conway, Neil Hellerstein, Joseph M. Maier, David University of California Berkeley CA United States Portland State University United States

ISBN: (纸本)9783642329241

Building on recent interest in distributed logic programming, we take a model-theoretic approach to analyzing confluence of asynchronous distributed programs. We begin with a model-theoretic semantics for Dedalus and introduce the ultimate model, which captures non-deterministic eventual outcomes of distributed programs. After showing the question of confluence undecidable for Dedalus, we identify restricted sub-languages that guarantee confluence while providing adequate expressivity. We observe that the semipositive restriction Dedalus+ guarantees confluence while capturing PTIME, but show that its restriction of negation makes certain simple and practical programs difficult to write. To remedy this, we introduce DedalusS , a restriction of Dedalus that allows a kind of stratified negation, but retains the confluence of Dedalus+ and similarly captures PTIME. © 2012 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

The near-horn approach to disjunctive logic programming 2nd

The near-horn approach to disjunctive logic programming

引用

2nd international workshop on extensions of logic programming, ELP 1991

作者： Reed, David W. Loveland, Donald W. Smith, Bruce T. Department of Computer Science Duke University DurhamNC27706 United States Department of Computer Science University of North Carolina Chapel HillNC27599 United States

ISBN: (纸本)9783540554981

This paper presents an overview of the near-Horn Prolog project at Duke University. The basic goal behind this project has been to extend Prolog to disjunctive logic programs (and thus full first-order expressibility) while retaining as much of the clarity and procedural simplicity of Prolog as possible. The approach taken to achieve this goal has been to combine Prolog with case analysis reasoning. The research work within the project can roughly be divided into three areas: procedure design, semantics, and implementation. Three different variants of Near-Horn Prolog have been devised, of which the most recent, Inheritance near-Horn Prolog (InH-Prolog), is the variant currently being favored. The semantics for the near-Horn Prologs, specifically for InH-Prolog, have been investigated, resulting in a case-analysis based fixpoint semantics which mimics the procedural behavior of InH-Prolog. Also, both classical and default negation have been incorporated into the neaz-Horn Prolog systems. Finally, an interpreter for the original near-Horn Prolog variant has been implemented, and a compiler for the Intt-Prolog variant is currently nearing completion. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

programming Language Semantics with Isabelle/HOL

Programming Language Semantics with Isabelle/HOL

引用

workshop-School on Theoretical Computer Science (WEIT)

作者： Alfio Martini Faculty of Informatics PUCRS Porto Alegre Brazil

Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order logic. In programming language theory, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages. In this paper we develop a relational denotational semantics for a small imperative programming language and implement it as a theory in Isabelle/HOL. We give special attention to the specification of monotonic fix point functional for loops and provide non-trivial proofs of interesting lemmas and properties with the structured proof language Isar.

关键词： Semantics Syntactics Equations Computer languages Lattices Computers Abstracts

来源：评论

学校读者我要写书评

暂无评论

Using static analysis to compile non-sequential functional logic programs 2nd

引用

2nd international workshop on Practical Aspects of Declarative Languages, PADL 2000

作者： Mariño, Julio Moreno-Navarro, Juan José Universidad Politécnica de Madrid Dpto. LSIIS Campus de Montegancedo s/n Madrid28660 Spain

ISBN: (纸本)3540669922

The efficient implementation of functional logic languages relies on finding (if it exists) an optimal evaluation order for the arguments of functions. The problems of finding the best evaluation order, and the sequentiality of program rules are both difficult and can benefit from using static analysis techniques. The second problem is of special interest because the parallel evaluation of arguments is out of the question due to the possibility of backtracking and sharing of free logical variables among different arguments. However, the lack of sequentiality is often syntactic rather than semantic. In this paper we show that an adequate use of type information and strictness analysis can help a compiler to (i) derive an efficient evaluation order, and (ii) generate sequential code from most programs. Data structures (new versions of definitional trees) are introduced to take advantage of this kind of information and manage run time tests when the computation cannot be made sequential at compile time. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：