咨询与建议

限定检索结果

文献类型

  • 1,156 篇 会议
  • 58 册 图书
  • 37 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 921 篇 工学
    • 869 篇 计算机科学与技术...
    • 470 篇 软件工程
    • 93 篇 控制科学与工程
    • 66 篇 电气工程
    • 43 篇 信息与通信工程
    • 13 篇 机械工程
    • 10 篇 土木工程
    • 8 篇 建筑学
    • 8 篇 石油与天然气工程
    • 7 篇 交通运输工程
    • 7 篇 生物工程
    • 6 篇 生物医学工程(可授...
    • 5 篇 力学(可授工学、理...
    • 5 篇 仪器科学与技术
    • 5 篇 电子科学与技术(可...
    • 5 篇 农业工程
  • 241 篇 理学
    • 203 篇 数学
    • 19 篇 系统科学
    • 17 篇 物理学
    • 15 篇 生物学
    • 7 篇 统计学(可授理学、...
  • 97 篇 管理学
    • 62 篇 管理科学与工程(可...
    • 41 篇 图书情报与档案管...
    • 37 篇 工商管理
  • 13 篇 教育学
    • 12 篇 教育学
  • 11 篇 医学
    • 8 篇 基础医学(可授医学...
    • 7 篇 临床医学
  • 10 篇 法学
    • 6 篇 社会学
  • 7 篇 经济学
    • 7 篇 应用经济学
  • 7 篇 农学
    • 6 篇 作物学
  • 4 篇 文学
  • 3 篇 哲学

主题

  • 254 篇 logic programmin...
  • 53 篇 artificial intel...
  • 50 篇 fuzzy logic
  • 42 篇 semantics
  • 40 篇 formal logic
  • 40 篇 mathematical log...
  • 32 篇 computer circuit...
  • 31 篇 logics and meani...
  • 26 篇 software enginee...
  • 23 篇 integer programm...
  • 22 篇 temporal logic
  • 21 篇 programming tech...
  • 20 篇 programming lang...
  • 19 篇 programming
  • 19 篇 calculations
  • 19 篇 knowledge repres...
  • 17 篇 computer science
  • 17 篇 logic
  • 17 篇 answer set progr...
  • 14 篇 software enginee...

机构

  • 9 篇 univ bath dept c...
  • 9 篇 vienna univ tech...
  • 5 篇 univ london impe...
  • 5 篇 rhein westfal th...
  • 5 篇 univ london impe...
  • 5 篇 univ texas dept ...
  • 4 篇 tu wien austria
  • 4 篇 simon fraser uni...
  • 4 篇 department of co...
  • 4 篇 guangxi key labo...
  • 4 篇 univ liverpool d...
  • 4 篇 univ potsdam ins...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ glamorgan c...
  • 4 篇 univ potsdam ins...
  • 3 篇 univ potsdam ins...
  • 3 篇 theoretical comp...
  • 3 篇 saitama univ dep...
  • 3 篇 microsoft resear...
  • 3 篇 univ potsdam pot...

作者

  • 12 篇 schaub torsten
  • 12 篇 de vos marina
  • 10 篇 brain martin
  • 9 篇 ricca francesco
  • 8 篇 gebser martin
  • 8 篇 russo alessandra
  • 7 篇 gore rajeev
  • 6 篇 leone nicola
  • 6 篇 andrei voronkov
  • 6 篇 xu yang
  • 6 篇 giesl juergen
  • 5 篇 cliffe owen
  • 5 篇 eiter thomas
  • 5 篇 faber wolfgang
  • 5 篇 cabalar pedro
  • 5 篇 gupta gopal
  • 5 篇 tompits hans
  • 5 篇 schaub t
  • 4 篇 mileo alessandra
  • 4 篇 chang liang

语言

  • 1,235 篇 英文
  • 8 篇 其他
  • 8 篇 中文
  • 1 篇 葡萄牙文
检索条件"任意字段=7th International Conference on Logic for Programming and Automated Reasoning"
1251 条 记 录,以下是991-1000 订阅
排序:
Computational space efficiency and minimal model generation for guarded formulae  8
收藏 引用
8th international conference on logic for programming, Artificial Intelligence and reasoning, LPAR 2001
作者: Georgieva, Lilia Hustadt, Ullrich Schmidt, Renate A. Department of Computer Science University of Manchester ManchesterM13 9PL United Kingdom Department of Computer Science University of Liverpool LiverpoolL69 7ZF United Kingdom
this paper describes a number of hyperresolution-based decision procedures for a subfragment of the guarded fragment. We first present a polynomial space decision procedure of optimal worst-case space and time complex... 详细信息
来源: 评论
Hybrid benders decomposition algorithms in constraint logic programming
收藏 引用
7th international conference on Principles and Practice of Constraint programming, CP 2001
作者: Eremin, Andrew Wallace, Mark IC-Parc London United Kingdom
Benders Decomposition is a form of hybridisation that allows linear programming to be combined with other kinds of algorithms. It extracts new constraints for one subproblem from the dual values of the other subproble... 详细信息
来源: 评论
A filtering algorithm for the stretch constraint  1
收藏 引用
7th international conference on Principles and Practice of Constraint programming, CP 2001
作者: Pesant, Gilles Centre for Research on Transportation Université de Montréal C.P. 6128 succ. Centre-ville MontrealH3C 3J7 Canada École Polytechnique de Montréal Montreal Canada
this paper describes a filtering algorithm for a type of constraint that often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the... 详细信息
来源: 评论
CardS4: Modal theorem proving on java smartcards
收藏 引用
international conference on Research in Smart Cards, E-smart 2001
作者: Goré, Rajeev Prabhakar Nguyên, Phuong thê Automated Reasoning Group Computer Sciences Laboratory Res. Sch. of Inf. Sci. and Eng Institute of Advanced Studies Australian National University Australia Formal Methods Group Dept. of Computer Science Inf. Tech Australian National University Australia
We describe a successful implementation of a theorem prover for modal logic S4 that runs on a Java smart card with only 512 KBytes of RAM and 32KBytes of EEPROM. Since proof search in S4 can lead to infinite branches,... 详细信息
来源: 评论
reasoning about the elementary functions of complex analysis  5th
Reasoning about the elementary functions of complex analysis
收藏 引用
5th international conference on Artificial Intelligence and Symbolic Computation, AISC 2000
作者: Corless, Robert M. Davenport, James H. Jeffrey, David J. Litt, Gurjeet Watt, Stephen M. Ontario Research Centre for Computer Algebra University of Western Ontario Canada Dept. Mathematical Sciences University of Bath BathBA2 7AY United Kingdom
there are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding ... 详细信息
来源: 评论
Solving disjunctive constraints for interactive graphical applications  7
收藏 引用
7th international conference on Principles and Practice of Constraint programming, CP 2001
作者: Marriott, Kim Moulder, Peter Stuckey, Peter J Borning, Alan School of Comp. Science & Soft. Eng Monash University Australia Dept. of Comp. Science & Soft. Eng University of Melbourne Australia Dept. of Computer Science & Eng University of Washington Seattle United States
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortunately, disjunctions are typically no... 详细信息
来源: 评论
On-line signature verification using a computational intelligence approach
收藏 引用
7th international conference on Computational Intelligence: theory and Applications, Fuzzy Days 2001
作者: Sardha Wijesoma, W. Mingming, Ma Yue, K.W. School of Electrical and Electronics Engineering Nanyang Technological University Singapore 639798 Singapore
For signature verification, there can be a large number of features available in a signature and not all these features are of use as some even could be unfavorable for verification of particular signatures. Also, the... 详细信息
来源: 评论
Developing control system of field boiler-house on the basis of modern programmable logical controllers
Developing control system of field boiler-house on the basis...
收藏 引用
international Scientific and Practical conference of Students, Post-graduates and Young Scientists Modern Technique and Technologies
作者: O. Andreev V.A. Ovchinnikova Tyumen State Oil and Gas University USA
Boiler-houses technical operation involves labor-intensive processes. Indispensable condition of boiler-houses operation is the automation of primary and support equipment. At present the automation level of technolog... 详细信息
来源: 评论
Translations for comparing soft frameworks  7
收藏 引用
7th international conference on Principles and Practice of Constraint programming, CP 2001
作者: Gennari, Rosella Computational and Applied Logic Group CWI & ILLC Kruislaan 413 Amsterdam1098 SJ Netherlands
there are various formalizations of soft constraints in the literature; so far, we have analyzed the semiring-based approach of [BMR97], the fuzzy ones in [Rut94] and the Max-CSP’s from [FW92]. If we abstrac...
来源: 评论
Graph operations and monadic second-order logic: A survey  7th
收藏 引用
7th international conference on logic for programming and automated reasoning
作者: Courcelle, B Univ Bordeaux 1 LaBRI CNRS UMR 5800 F-33405 Talence France
We handle finite graphs in two ways, as relational structures on the one hand, and as algebraic objects, i.e., as elements of algebras, based on graph operations on the other.
来源: 评论