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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,428 篇 会议
70 册 图书
55 篇 期刊文献

馆藏范围

1,552 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,260 篇 工学
- 1,245 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

387 篇 logic programmin...
142 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
49 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
35 篇 logics and meani...
29 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
22 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
15 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,541 篇 英文
8 篇 中文
4 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1553 条记录，以下是1301-1310 订阅

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

详细简洁

排序：

13th international conference on theorem Proving in Higher Order logics, TPHOLs 2000

13th International Conference on Theorem Proving in Higher O...

引用

13th international conference on theorem Proving in Higher Order logics, TPHOLs 2000

ISBN: (纸本)9783540678632

the proceedings contain 33 papers. the special focus in this conference is on theorem Proving in Higher Order logics. the topics include: Fix-point equations for well-founded recursion in type theory;programming and computing in HOL;proof terms for simply typed higher order logic;routing information protocol in HOL/SPIN;recursive families of inductive types;aircraft trajectory modeling and alerting algorithm verification;intel formal verification experience on the Willamette development;proving ml type soundness within coq;on the mechanization of real analysis in Isabelle/HOL;equational reasoning via partial reflection;reachabihty programming in hol98 using BDDs;transcendental functions and continuity checking in PVS;verified optimizations for the intel IA-64 architecture;formal verification of ia-64 division algorithms;fast tactic-based theorem proving;implementing a program logic of objects in a higher-order logic theorem prover;a strong and mechanizable grand logic;inheritance in higher order logic: modeling and reasoning;total-correctness refinement for sequential reactive systems;divider circuit verification with model checking and theorem proving;specification and verification of a steam-boiler with signal-coq;functional procedures in higher-order logic;formalizing Stalmarck's algorithm in coq;a generic window inference system;weak alternating automata in Isabelle/HOL;graphical theories of interactive systems: can a proof assistant help?;dependently typed records for representing mathematical structure;towards a machine-checked java specification book;another look at nested recursion;automating the search for answers to open questions;conjectures concerning proof, design, and verification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Psychiatric diagnosis from the viewpoint of computational logic 1

引用

1st international conference on Computational logic, CL 2000

作者： Gartner, Joseph Swift, Terrance Tien, Allen Damásio, Carlos Viegas Pereira, Luís Moniz Medicine Rules Inc. 25 East Loop Rd. Stony Broon NY 11794 United States Department of Computer Science SUNY at Stony Brook Stony Brook NY United States Medical Decision Logic Inc. 7921 Ruxway Rd. Baltimore MD 21204-3515 United States A.I. Centre Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa 2825-114 Caparica Portugal

ISBN: (数字)9783540449577

ISBN: (纸本)3540677976

While medical information systems have become common in the United States, commercial systems that automate or assist in the process of medical diagnosis remain uncommon. this is not surprising, since automating diagnosis requires considerable sophistication both in the understanding of medical epidemeology and in knowledge representation techniques. this paper is an interdisciplinary study of how recent results in logic programming and non-monotonic reasoning can aid in psychiatric diagnosis. We argue that to logically represent psychiatric diagnosis as codified in the Diagnostic and Statistical Manual of Mental Disorders, 4th edition requires abduction over programs that include both explicit and non-stratified default negation, as well as dynamic rules that express preferences between conclusions. We show how such programs can be translated into abductive frameworks over normal logic programs and implemented using recently introduced logic programming techniques. Finally, we note how such programs are used in a commercial product Diagnostica. © Springer-Verlag Berlin Heidelberg 2000.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

11th international conference on Concurrency theory, CONCUR 2000

11th International Conference on Concurrency Theory, CONCUR ...

引用

11th international conference on Concurrency theory, CONCUR 2000

ISBN: (纸本)3540678972

the proceedings contain 42 papers. the special focus in this conference is on Concurrency theory. the topics include: Combining theorem proving and model checking through symbolic analysis;verification is experimentation;formal models for communication-based design;programming access control;exploiting hierarchical structure for efficient formal verification;from process calculi to process frameworks;verification using tabled logic programming;open systems in reactive environments;verifying quantitative properties of continuous probabilistic timed automata;the impressive power of stopwatches;reasoning about partial state spaces;reachability analysis for some models of infinite-state transition systems;failure semantics for the exchange of information in multi-agent systems;deriving bisimulation congruences for reactive systems;bisimilarity congruences for open terms and term graphs via tile logic;process languages for rooted eager bisimulation;a theory of testing for markovian processes;reasoning about probabilistic lossy channel systems;weak bisimulation for probabilistic systems;nondeterminism and probabilistic choice;secrecy and group creation;on the reachability problem in cryptographic protocols;secure information flow for concurrent processes;LP deadlock checking using partial order dependencies;functorial concurrent semantics for petri nets with read and inhibitor arcs;the control of synchronous systems;typing non-uniform concurrent objects;an implicitly-typed deadlock-free process calculus;emptiness is decidable for asynchronous cellular machines;revisiting safety and liveness in the context of failures;well-abstracted transition systems;a unifying approach to data-independence and chi calculus with mismatch.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the theory of total unary RPO is decidable 1

引用

1st international conference on Computational logic (CL 2000)

作者： Narendran, P Rusinowitch, M SUNY Albany Dept Comp Sci Inst Programming & Log Albany NY 12222 USA LORIA INRIA Lorraine F-54602 Villers Les Nancy France

ISBN: (数字)9783540449577

ISBN: (纸本)3540677976

the Recursive Path Ordering (rpo) is a syntactic ordering on terms that has been widely used for proving termination of term-rewriting systems [7,20]. How to combine term-rewriting with ordered resolution and paramodulation is now well-understood and it has been successfully applied in many theorem-proving systems [11, 16, 21]. In this setting an ordering such as rpo is used both to orient rewrite rules and to select, maximal literals to perform inferences on. In order to further prune the search space the ordering requirements on conditional inferences are better handled when they are treated as constraints [12, 18]. Typically a non-orientable equation s = t will be split as two constrained rewrite rules: s --> t\ s > t and t --> s\ t > s. Such constrained rules are useless when the constraint is unsatisfiable. therefore it is important for the efficiency of automated reasoning systems to investigate decision procedures for the theory of terms with ordering predicates. Other types of constraints can be introduced too such as disunification constraints [1]. It is often the case that they can be expressed with ordering constraints (although this might be inefficient). We prove that the first-order theory of the recursive path ordering is decidable in the case of unary signatures with total precedence. this solves a problem that was mentioned as open in [6]. the result has to be contrasted with the undecidability results of the lexicographic path ordering [6] for the case of symbols with arity greater than or equal to 2 and total precedence and for the case of unary signatures with partial precedence. We recall that lexicographic path ordering (lpo) and the recursive path ordering and many other orderings such as [13, 10] coincide in the unary case. Among the positive results it is known that the existential theory of total lpo is decidable [3, 17]. the same result holds for the case of total rpo [8, 15]. the proof technique we use for our decidability result might be

关键词： recursive path ordering first-order theory ground reducibility tree automata ordered rewriting

来源：评论

学校读者我要写书评

暂无评论

6th Pacific Rim international conference on artificial intelligence, PRICAI 2000

6th Pacific Rim International Conference on Artificial Intel...

引用

6th Pacific Rim international conference on artificial intelligence, PRICAI 2000

ISBN: (纸本)3540679251

the proceedings contain 121 papers. the special focus in this conference is on Foundations of AI, Induction, logic programming, Reinforcement Learning and Machine Learning. the topics include: Knowledge representation, belief revision, and the challenge of optimality;towards a next-generation search engine;an attempt to represent a database by predicate formulae;a unifying semantics for causal ramifications;inductive inference of chess player strategy;compiling logical features into specialized state-evaluators by partial evaluation, Boolean tables and incremental calculation;using domain knowledge in ILP to discover protein functional models;knowledge reformation for efficient first-order hypothetical reasoning;determination of general concept in learning default rules;a theory of profit sharing in dynamic environment;a region selecting method which performs observation and action in the multi-resolution environment;the lumberjack algorithm for learning linked decision forests;efficient iris recognition system by optimization of feature vectors and classifier;an efficient learning algorithm using natural gradient and second order information of error surface;fast and robust general purpose clustering algorithms;tropical cyclone intensity forecasting model;trading off granularity against complexity in predictive models for complex domains;efficient inference in dynamic belief networks with variable temporal resolution;epistemic states guiding the rational dynamics of information;perceiving environments for intelligent agents;constructing an autonomous agent with an interdependent heuristics;from brain theory to autonomous robotic agents and a multi-agent approach for optical inspection technology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CONCUR 2000 - Concurrency theory: 11th international conference, Proceedings

CONCUR 2000 - Concurrency Theory: 11th International Confere...

引用

11th international conference on Concurrency theory, CONCUR 2000

ISBN: (纸本)3540678972

the proceedings contain 42 papers. the topics discussed include: combining theorem proving and model checking through symbolic analysis;verification is experimentation!;compositional performance analysis using probabilistic I/O automata;formal models for communication-based design;exploiting hierarchical structure for efficient formal verification;from process calculi to process frameworks;verification using tabled logic programming;open systems in reactive environments: control and synthesis;model checking with finite complete prefixes is PSPACE-complete;verifying quantitative properties of continuous probabilistic timed automata;the impressive power of stopwatches;generalized model checking: reasoning about partial state spaces;reachability analysis for some models of infinite-state transition systems;process spaces;failure semantics for the exchange of information in multi-agent systems;proof-outlines for threads in java;and deriving bisimulation congruences for reactive systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

6th international Workshop on Agent theories Architectures, and Languages, ATAL 1999

6th International Workshop on Agent Theories Architectures, ...

引用

6th international Workshop on Agent theories Architectures and Languages, ATAL 1999

ISBN: (纸本)3540672001

the proceedings contain 28 papers. the special focus in this conference is on Relationships between the theory and Practice of Agents. the topics include: reasoning about visibility, perception and knowledge;a spectrum of modes of knowledge sharing between agents;observability-based nested belief computation for multiagent systems and its formalization;on the correctness of PRS agent programs;incorporating uncertainty in agent commitments;rational cognition in OSCAR;agents for information broadcasting;on the evaluation of agent architectures;toward a methodology for AI architecture evaluation;reactive-system approaches to agent architectures;a planning component for RETSINA agents;a scalable agent location mechanism;reactivity in a logic-based robot programming framework;operational semantics of multi-agent organisations;agent communication and integration;toward team-oriented programming;agent-oriented software engineering;multiagent system engineering;using multi-context systems to engineer executable agents;structuring BDI agents in functional clusters;towards a distributed, environment-centered agent framework;variable sociability in agent-based decision making;cooperation and group utility;relating quantified motivations for organizationally situated agents;the role and the impact of preferences on multiagent interaction and deliberate normative agents.

关键词：

来源：评论

学校读者我要写书评

暂无评论

27th international Colloquium on Automata, Languages and programming, ICALP 2000

27th International Colloquium on Automata, Languages and Pro...

引用

27th international Colloquium on Automata, Languages and programming, ICALP 2000

ISBN: (纸本)9783540450221

the proceedings contain 78 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: Approximating the independence number and the chromatic number in expected polynomial time;closed types as a simple approach to safe imperative multi-stage programing;a statically allocated parallel functional language;an optimal minimum spanning tree algorithm;improved shortest paths on the word RAM;improved algorithms for finding level ancestors in dynamic trees;lax logical relations;reasoning about idealized algol using regular languages;the measurement process in domain theory;graph transformation as a conceptual and formal framework for system modeling and model evolution;monotone proofs of the pigeon hole principle;fully-abstract statecharts semantics via intuitionistic kripke models;algebraic models for contextual nets;asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems;measures of nondeterminism in finite automata;LTL is expressively complete for mazurkiewicz traces;an automata-theoretic completeness proof for interval temporal logic;deterministic algorithms for k-SAT based on covering codes and local search;closest vectors, successive minima, and dual HKZ-bases of lattices;variable independence, quantifier elimination, and constraint representations;constraint satisfaction problems and finite algebras;an optimal online algorithm for bounded space variable-sized bin packing;resource augmentation for online bounded space bin packing;optimal projective algorithms for the list update problem;on the complexity of bisimulation problems for basic parallel processes and decidable first-order transition logics for PA-processes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient defeasible reasoning systems

Efficient defeasible reasoning systems

引用

international conference on Tools for artificial intelligence (ICTAI)

作者： M.J. Maher A. Rock G. Antoniou D. Billington T. Miller School of Computing & Information Technology Griffith University QLD Australia

For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonic reasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.

关键词： logic programming Computational complexity Information technology Australia NP-hard problem Electronic commerce Query processing

来源：评论

学校读者我要写书评

暂无评论

Constraint propagation for soft constraints: Generalization and termination conditions 6th

引用

6th international conference on Principles and Practice of Constraint programming, CP2000

作者： Bistarelli, S. Gennari, R. Rossi, F. Università di Pisa Dipartimento di Informatica Corso Italia 40 Pisa56125 Italy ILLC Institute of Logic Language and Computation University of Amsterdam N. Doelenstraat 15 Amsterdam1012 CP Netherlands Università di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy

ISBN: (纸本)3540410538

Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semiring. this framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems. Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft local consistency [BMR97]. On the other hand, in [Apt99a,Apt99b] it has been proved that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema. In this paper we combine these two schema and we show how the framework of [Apt99a,Apt99b] can be used for soft constraints. In doing so, we generalize the concept of soft local consistency, and we prove some convenient properties about its termination. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：