咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 5,725 篇 工学
    • 5,324 篇 计算机科学与技术...
    • 3,510 篇 软件工程
    • 560 篇 电气工程
    • 309 篇 控制科学与工程
    • 170 篇 信息与通信工程
    • 84 篇 电子科学与技术(可...
    • 59 篇 机械工程
    • 39 篇 生物医学工程(可授...
    • 39 篇 生物工程
    • 36 篇 建筑学
    • 29 篇 土木工程
    • 26 篇 材料科学与工程(可...
    • 25 篇 仪器科学与技术
  • 1,418 篇 理学
    • 1,255 篇 数学
    • 119 篇 统计学(可授理学、...
    • 74 篇 生物学
    • 69 篇 系统科学
    • 50 篇 物理学
    • 26 篇 科学技术史(分学科...
  • 593 篇 管理学
    • 333 篇 图书情报与档案管...
    • 292 篇 管理科学与工程(可...
    • 118 篇 工商管理
  • 64 篇 法学
    • 39 篇 社会学
    • 24 篇 法学
  • 52 篇 哲学
    • 36 篇 哲学
  • 49 篇 教育学
    • 44 篇 教育学
  • 49 篇 医学
    • 36 篇 基础医学(可授医学...
    • 34 篇 临床医学
  • 35 篇 文学
    • 25 篇 外国语言文学
  • 33 篇 农学
    • 25 篇 作物学
  • 25 篇 经济学
  • 16 篇 艺术学
  • 4 篇 历史学
  • 2 篇 军事学

主题

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

机构

  • 33 篇 university of po...
  • 31 篇 univ minho ctr a...
  • 28 篇 tu wien austria
  • 26 篇 new mexico state...
  • 25 篇 univ pisa dipart...
  • 23 篇 katholieke univ ...
  • 22 篇 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 篇 univ maryland de...
  • 12 篇 school of comput...
  • 12 篇 univ london impe...

作者

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

语言

  • 7,931 篇 英文
  • 419 篇 其他
  • 32 篇 中文
  • 7 篇 日文
  • 4 篇 俄文
  • 2 篇 德文
  • 2 篇 法文
  • 2 篇 葡萄牙文
  • 1 篇 斯洛伐克文
  • 1 篇 土耳其文
检索条件"主题词=Logic Programming"
8401 条 记 录,以下是4091-4100 订阅
排序:
An analysis off critique diversity in case-based recommendation
An analysis off critique diversity in case-based recommendat...
收藏 引用
Recent Advances in Artifical Intelligence - Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2005
作者: McCarthy, Kevin Really, James McGinty, Lorraine Smyth, Barry Belfield Dublin 4 Ireland
Critiquing is a well-known form of user feedback in case-based recommender systems. A critique encodes the users preference in relation to a particular feature. For example, in a digital camera recommender a user may ... 详细信息
来源: 评论
A preliminary report on integrating of answer set and constraint solving
A preliminary report on integrating of answer set and constr...
收藏 引用
3rd International Workshop on Answer Set programming: Advances in Theory and Implementation, ASP 2005, Co-located Event with the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005
作者: Baselice, Sabrina Bonatti, Piero Gelfond, M. Dipartimento di Scienze Fisiche Università Federico II Complesso Universitario di Monte Sant'Angelo Via Cinthia Napoli Italy Texas Tech. University Department of Computer Science Lubbock TX United States
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning sta... 详细信息
来源: 评论
Probabilistic polynomial-time semantics for a protocol security logic
Probabilistic polynomial-time semantics for a protocol secur...
收藏 引用
32nd International Colloquium on Automata, Languages and programming, ICALP 2005
作者: Datta, Anupam Derek, Ante Mitchell, John C. Shmatikov, Vitaly Turuani, Mathieu Dept. Computer Science Stanford University Stanford CA United States Dept. Computer Science University of Texas Austin TX United States LORIA-INRIA Nancy France
We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach r... 详细信息
来源: 评论
Synthesis of distributed processes from scenario-based specifications
Synthesis of distributed processes from scenario-based speci...
收藏 引用
International Symposium of Formal Methods Europe, FM 2005
作者: Sun, Jun Dong, Jin Song School of Computing National University of Singapore Singapore
Given a set of sequence diagrams, the problem of synthesis is of deciding whether there exists a satisfying object system and if so, synthesize one automatically. It is crucial in the development of complex systems, s... 详细信息
来源: 评论
Realizability for monotone and clausular (Co)inductive definitions
Realizability for monotone and clausular (Co)inductive defin...
收藏 引用
Proceedings of the 11th Workshop on logic, Language, Information and Computation (WoLLIC 2004)
作者: Miranda-Perea, Favio E. Inst. F. Informatik Ludwig-M. Oettingenstr. 67 D-80538 München Germany
We develop an extension of second order logic (AF2) with monotone, and not only positive, (co)inductive definitions and a clausular feature which simplifies considerably the defining mechanism. A sound realizability i... 详细信息
来源: 评论
The Language χ: Circuits, computations and classical logic
The Language χ: Circuits, computations and classical logic
收藏 引用
9th Italian Conference on Theoretical Computer Science, ICTCS 2005
作者: Van Bakel, Steffen Lengrand, Steáphane Lescanne, Pierre Department of Computing Imperial College London 180 Queen's Gate London SW7 2BZ United Kingdom School of Computer Science University of St Andrews St Andrews Fife KY16 9SS United Kingdom Eácole Normale Supeárieure de Lyon 46 Alleáe d'Italie 69364 Lyon 07 France
We present the syntax and reduction rules for χ, an untyped language that is well suited to describe structures which we call "circuits" and which are made of parts that are connected by wires. To demonstra... 详细信息
来源: 评论
Playing with Maude
Playing with Maude
收藏 引用
Proceedings of the Fifth International Workshop on Rule-Based programming (RULE 2004)
作者: Palomino, Miguel Martí-Oliet, Narciso Verdejo, Alberto Depto. de Sist. Informaticos y P. Universidad Complutense de Madrid
This paper is an introduction to rule-based programming in Maude. We illustrate in particular the use of operator attributes to structure the state of a system, and the difference between equations and rules. We use w... 详细信息
来源: 评论
An algorithm retrieving rules from web page based on concept lattice
An algorithm retrieving rules from web page based on concept...
收藏 引用
International Conference on Machine Learning and Cybernetics, ICMLC 2005
作者: Du, Ya-Jun Xu, Yang Pei, Zheng Pen, Hong Li, Hai-Ming School of Computers and Mathematical-Physical Science Xihua University Chengdu 610039 China Department of Applied Mathematics Southwest Jiaotong University Chengdu 610031 China School of Information Science and Technology Zhe Jiang Forestry University Linan 311300 China
The emergence of World Wide Web has made flood of information. But the knowledge of the web resources has not been utilized fully yet. Traditional search engine does not satisfy user need. At this paper, the soft matc... 详细信息
来源: 评论
TRIPPER: Rule learning using taxonomies
TRIPPER: Rule learning using taxonomies
收藏 引用
AAAI-05 Workshop
作者: Vasile, Flavian Silvescu, Adrian Kang, Dae-Ki Honavar, Vasant Artificial Intelligence Research Laboratory Department of Computer Science Iowa State University Ames IA 50011 United States
In many application domains, there is a need for learning algorithms that generate accurate as well as comprehensible classifiers. In this paper, we present TRIPPER - a rule induction algorithm that extends RIPPER, a ... 详细信息
来源: 评论
Formalization of the DE2 language
收藏 引用
13th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2005
作者: Hunt Jr., Warren A. Reeber, Erik Department of Computer Sciences 1 University Station University of Texas Austin TX 78712-0233 United States
We formalized the DE2 hierarchical, occurrence-oriented finite state machine (FSM) language, and have developed a proof theory allowing the mechanical verification of PSM descriptions. Using the ACL2 functional logic,... 详细信息
来源: 评论