咨询与建议

限定检索结果

文献类型

  • 6,094 篇 会议
  • 2,226 篇 期刊文献
  • 98 册 图书
  • 14 篇 学位论文

馆藏范围

  • 8,428 篇 电子文献
  • 5 种 纸本馆藏

日期分布

学科分类号

  • 5,750 篇 工学
    • 5,349 篇 计算机科学与技术...
    • 3,522 篇 软件工程
    • 564 篇 电气工程
    • 313 篇 控制科学与工程
    • 174 篇 信息与通信工程
    • 85 篇 电子科学与技术(可...
    • 59 篇 机械工程
    • 39 篇 生物医学工程(可授...
    • 39 篇 生物工程
    • 36 篇 建筑学
    • 29 篇 土木工程
    • 27 篇 材料科学与工程(可...
    • 25 篇 仪器科学与技术
  • 1,429 篇 理学
    • 1,266 篇 数学
    • 119 篇 统计学(可授理学、...
    • 74 篇 生物学
    • 69 篇 系统科学
    • 50 篇 物理学
    • 26 篇 科学技术史(分学科...
  • 602 篇 管理学
    • 336 篇 图书情报与档案管...
    • 298 篇 管理科学与工程(可...
    • 118 篇 工商管理
  • 67 篇 法学
    • 41 篇 社会学
    • 25 篇 法学
  • 56 篇 哲学
    • 36 篇 哲学
  • 50 篇 医学
    • 36 篇 基础医学(可授医学...
    • 35 篇 临床医学
  • 49 篇 教育学
    • 44 篇 教育学
  • 36 篇 文学
    • 26 篇 外国语言文学
  • 33 篇 农学
    • 25 篇 作物学
  • 25 篇 经济学
  • 16 篇 艺术学
  • 4 篇 历史学
  • 2 篇 军事学

主题

  • 8,432 篇 logic programmin...
  • 604 篇 computer science
  • 473 篇 computer languag...
  • 337 篇 application soft...
  • 308 篇 artificial intel...
  • 244 篇 programming prof...
  • 178 篇 computer archite...
  • 172 篇 programmable log...
  • 171 篇 hardware
  • 167 篇 control systems
  • 153 篇 computational mo...
  • 153 篇 logic design
  • 150 篇 prototypes
  • 149 篇 concurrent compu...
  • 148 篇 laboratories
  • 144 篇 object oriented ...
  • 144 篇 software enginee...
  • 134 篇 functional progr...
  • 131 篇 semantics
  • 130 篇 costs

机构

  • 33 篇 university of po...
  • 31 篇 univ minho ctr a...
  • 28 篇 tu wien austria
  • 27 篇 new mexico state...
  • 25 篇 univ pisa dipart...
  • 23 篇 katholieke univ ...
  • 23 篇 vienna univ tech...
  • 19 篇 university of ca...
  • 18 篇 univ kentucky de...
  • 17 篇 univ potsdam pot...
  • 17 篇 katholieke univ ...
  • 15 篇 univ evora escol...
  • 14 篇 suny stony brook...
  • 14 篇 univ manchester ...
  • 13 篇 texas tech univ ...
  • 13 篇 university of co...
  • 13 篇 univ minho dept ...
  • 12 篇 vienna universit...
  • 12 篇 univ maryland de...
  • 12 篇 school of comput...

作者

  • 82 篇 schaub torsten
  • 57 篇 ricca francesco
  • 54 篇 vicente henrique
  • 51 篇 gebser martin
  • 50 篇 eiter thomas
  • 50 篇 neves jose
  • 49 篇 woltran stefan
  • 43 篇 faber wolfgang
  • 39 篇 leone nicola
  • 38 篇 son tran cao
  • 37 篇 pontelli enrico
  • 37 篇 cabalar pedro
  • 31 篇 lifschitz vladim...
  • 30 篇 gupta gopal
  • 29 篇 sakama chiaki
  • 29 篇 denecker marc
  • 28 篇 maratea marco
  • 27 篇 inoue katsumi
  • 26 篇 proietti maurizi...
  • 26 篇 lierler yuliya

语言

  • 8,106 篇 英文
  • 275 篇 其他
  • 32 篇 中文
  • 7 篇 日文
  • 4 篇 俄文
  • 2 篇 德文
  • 2 篇 法文
  • 2 篇 葡萄牙文
  • 1 篇 斯洛伐克文
  • 1 篇 土耳其文
检索条件"主题词=Logic Programming"
8432 条 记 录,以下是4461-4470 订阅
排序:
ASP – PROLOG: A system for reasoning about answer set programs in prolog  6th
ASP – PROLOG: A system for reasoning about answer set progr...
收藏 引用
6th International Symposium on Practical Aspects of Declarative Languages, PADL 2004
作者: Elkhatib, Omar Pontelli, Enrico Son, Tran Cao Department of Computer Science New Mexico State University United States
We present a system (ASP − PROLOG) which provides a tight and well-defined integration of Prolog and Answer Set programming (ASP). The combined system enhances the expressive power of ASP, allowing us to write program... 详细信息
来源: 评论
Using circular programs to deforest in accumulating parameters
Using circular programs to deforest in accumulating paramete...
收藏 引用
作者: Voigtländer, Janis Department of Computer Science Dresden University of Technology 01062 Dresden Germany
This paper presents a functional program transformation that removes intermediate data structures in compositions of two members of a class of recursive functions with accumulating parameters. To avoid multiple traver... 详细信息
来源: 评论
Generation of disjoint cubes for multiple-valued functions
Generation of disjoint cubes for multiple-valued functions
收藏 引用
2004 IEEE International Symposium on Circuits and Systems - Proceedings
作者: Falkowski, Bogdan J. Lozano, Cicilia C. Rahardja, Susanto Sch. of Elec./Electron. Engineering Nanyang Technological University Block S1 50 Nanyang Avenue Singapore 639798 Institute for Infocomm Research 21 Heng Mui Keng Terrace Singapore 119613
In this paper, an algorithm to generate disjoint cubes representation of a multiple-valued logic function is presented. The algorithm converts an array of non-disjoint multiple-valued cubes to an array of disjoint mul... 详细信息
来源: 评论
Inheritance of multiple identity conditions in order-sorted logic
Inheritance of multiple identity conditions in order-sorted ...
收藏 引用
17th Australian Joint Conference on Artificial Intelligence, AI 2004: Advances in Artificial Intelligence
作者: Tun, Nwe Ni Tojo, Satoshi Japan Advanced Institute of Science and Technology Japan
Guarino and Welty have developed the notion of identity condition (IC) as a subsumption constraint of ontological analysis, that is, IC must be inherited or carried among sorts, In practical cases, a sort is often reg... 详细信息
来源: 评论
Answer set programming with clause learning  7
收藏 引用
7th International Conference on logic programming and Nonmonotonic Reasoning , LPNMR 2004
作者: Ward, Jeffrey Schlipf, John S. The Ohio State University United States University of Cincinnati United States
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search heuristic. The use of such clauses has be... 详细信息
来源: 评论
A high performance 32-bit ALU for programmable logic
A high performance 32-bit ALU for programmable logic
收藏 引用
ACM/SIGDA Twelfth ACM International Symposium on Field-Programmable Gate Arrays - FPGA 2004
作者: Metzgen, Paul Altera European Technology Center Holmers Farm Way High Wycombe HP12 4XF United Kingdom
The Arithmetic-logic-Unit (ALU) is at the heart of a modern microprocessor, and its size and speed are often significant contributors to the overall processor's cost and performance. This paper presents the design... 详细信息
来源: 评论
Binding-time analysis for MetaML via type inference and constraint solving
Binding-time analysis for MetaML via type inference and cons...
收藏 引用
10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
作者: Linger, N Sheard, T Oregon Hlth & Sci Univ Oregon Grad Inst Portland OR 97201 USA
The two predominant program specialization techniques, partial evaluation and staged programming, take opposite approaches to automating binding-time analysis (BTA). Despite their common goal, there are no systems int... 详细信息
来源: 评论
Definitions in answer set programming  7
收藏 引用
7th International Conference on logic programming and Nonmonotonic Reasoning , LPNMR 2004
作者: Erdoğan, Selim T. Lifschitz, Vladimir Department of Computar Sciences University of Texas Austin United States
In answer set programming, programs often contain auxiliary atoms, "defined" in terms of atoms introduced earlier. To prove that the answer sets of a program containing definitions correspond to the solution... 详细信息
来源: 评论
On the termination of non-deterministic programs based on the equivalent transformation computation model
On the termination of non-deterministic programs based on th...
收藏 引用
Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, MSV'04 and Proceedings of the Int. Conference on Algorithmic Mathematics and Comput. Sci., AMCS'04
作者: Takarajima, Itaru Shigeta, Yoshinori Akama, Kiyoshi Imani, Ikumi Department of Commerce Nagoya Gakuin University Seto 480-1298 Japan SoC Research and Development Center Toshiba Corporation Kawasaki 212-8520 Japan Information Initiative Center Hokkaido University Sapporo 060-0811 Japan Department of Foreign Studies Nagoya Gakuin University Seto 480-1298 Japan
A non-deterministic program is a program that may have more than one possible computation for a single input. It terminates with respect to a given set of inputs if and only if each possible computation of the program... 详细信息
来源: 评论
The Omega rule is II20-hard in the λβ-calculus
The Omega rule is II20-hard in the λβ-calculus
收藏 引用
Proceedings of the 19th Annual IEEE Symposium on logic in Computer Science
作者: Intrigua, Benedetto Statman, Richard Univ. degli Studi di l'Aquila L'Aquila Italy Carnegie-Mellon University Pittsburgh PA United States
We give a many-one reduction of the set of true II20 sentences to the set of consequences of the lambda calculus with the omega rule. This solves in the affirmative a well known problem of H. Barendregt. The technique... 详细信息
来源: 评论