咨询与建议

限定检索结果

文献类型

  • 6,086 篇 会议
  • 2,197 篇 期刊文献
  • 106 册 图书
  • 18 篇 学位论文
  • 1 篇 科技报告

馆藏范围

  • 8,404 篇 电子文献
  • 6 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 8,408 篇 logic programmin...
  • 603 篇 computer science
  • 474 篇 computer languag...
  • 339 篇 application soft...
  • 306 篇 artificial intel...
  • 244 篇 programming prof...
  • 178 篇 computer archite...
  • 173 篇 programmable log...
  • 173 篇 hardware
  • 168 篇 control systems
  • 154 篇 logic design
  • 153 篇 computational mo...
  • 151 篇 prototypes
  • 149 篇 concurrent compu...
  • 148 篇 laboratories
  • 144 篇 object oriented ...
  • 144 篇 software enginee...
  • 135 篇 functional progr...
  • 130 篇 costs
  • 129 篇 semantics

机构

  • 33 篇 university of po...
  • 31 篇 univ minho ctr a...
  • 28 篇 tu wien austria
  • 26 篇 new mexico state...
  • 24 篇 univ pisa dipart...
  • 23 篇 katholieke univ ...
  • 21 篇 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 篇 inoue katsumi

语言

  • 8,029 篇 英文
  • 321 篇 其他
  • 39 篇 中文
  • 10 篇 日文
  • 4 篇 俄文
  • 2 篇 德文
  • 2 篇 法文
  • 2 篇 葡萄牙文
  • 1 篇 斯洛伐克文
  • 1 篇 土耳其文
检索条件"主题词=Logic Programming"
8408 条 记 录,以下是4721-4730 订阅
排序:
Conditional Narrowing without Conditions  03
Conditional Narrowing without Conditions
收藏 引用
Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative programming
作者: Antoy, Sergio Brassel, Bernd Hanus, Michael Department of Computer Science Portland State University P.O. Box 751 Portland OR 97207 United States Institut für Informatik Christian-Albrechts-Univ. Kiel Olshausenstr. 40 D-24098 Kiel Germany
We present a new evaluation strategy for functional logic programs described by weakly orthogonal conditional term rewriting systems. Our notion of weakly orthogonal conditional rewrite system extends a notion of Berg... 详细信息
来源: 评论
Implementing OCLP as a front-end for answer set solvers: From theory to practice
Implementing OCLP as a front-end for answer set solvers: Fro...
收藏 引用
2nd International Workshop on Answer Set programming Advances in Theory and Implementation, ASP 2003
作者: Brain, Martin De Vos, Marina Department of Computer Science University of Bath Bath United Kingdom
Ordered Choice logic programming (OCLP) allows for preference-based decision-making with multiple alternatives and without the burden of any form of negation. This complete absence of negation does not weaken the lang... 详细信息
来源: 评论
A new machine-checked proof of strong normalisation for display logic
A new machine-checked proof of strong normalisation for disp...
收藏 引用
CATS'03, Computing: The Australasian Theory Symposium
作者: Dawson, Jeremy E. Goré, Rajeev Department of Computer Science and Automated Reasoning Group Australian National University Canberra ACT 0200 Australia
We use a deep embedding of the display calculus for relation algebras δRA in the logical framework Isabelle/HOL to formalise a new, machine-checked, proof of strong normalisation and cut-elimination for δRA which do... 详细信息
来源: 评论
Multiplicative linear logics and fibrations
Multiplicative linear logics and fibrations
收藏 引用
CTCS'02, Category Theory and Computer Science
作者: Lamarche, François Projet Calligramme LORIA UMR N 7503 - INRIA Campus Scientifique B.P. 239 54506 Vandoeuvre les Nancy Cedex France
We define a notion of fibration on generalized operads (that we call structads) that automatically gives the categorical axiomatization of a large and specific class of multiplicative deductive linear systems, which c... 详细信息
来源: 评论
logic programs for consistently querying data integration systems
Logic programs for consistently querying data integration sy...
收藏 引用
18th International Joint Conference on Artificial Intelligence, IJCAI 2003
作者: Bravo, Loreto Bertossi, Leopoldo Pontificia Universidad Catolica de Chile Departamento de Ciencia de Computation Santiago Chile Carleton University School of Computer Science Ottawa ON Canada
We solve the problem of obtaining answers to queries posed to a mediated integration system under the local-as-view paradigm that are consistent wrt to certain global integrity constraints. For this, the query program... 详细信息
来源: 评论
Approximate reasoning and PT-resolution
Approximate reasoning and PT-resolution
收藏 引用
2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation, CIRA 2003
作者: Liu, Fqye F. Department of Computer Science and Computer Engineering La Trobe University BundooraVIC3083 Australia
This paper defines PT-resolution which is the integration of PT-resolution and approximate reasoning. PT-resolution is a deduction method based on partial intersection and truncation. The integration enables the deduc... 详细信息
来源: 评论
Subtyping in logical form
Subtyping in logical form
收藏 引用
ITRS '02, Intersection Types and Related Systems (FLoC Satellite Event)
作者: De'Liguoro, Ugo Dipartimento di Informatica Università di Torino c.so Svizzera 185 10149 Torino Italy
By using intersection types and filter models we formulate a theory of types for a λ-calculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the la... 详细信息
来源: 评论
Query answering in rough knowledge bases  9th
收藏 引用
9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, RSFDGrC 2003
作者: Vitória, Aida Damásio, Carlos Viegas Maluszyński, Jan Dept. of Science and Technology Linköping University NorrköpingS 601 74 Sweden Dept. Informática Universidade Nova de Lisboa Caparica2829-516 Portugal Dept. of Computer and Information Science Linköping University LinköpingS 581 83 Sweden
We propose a logic programming language which makes it possible to define and to reason about rough sets. In particular we show how to test for rough inclusion and rough equality. This extension to our previous work [... 详细信息
来源: 评论
Answer set optimization
Answer set optimization
收藏 引用
18th International Joint Conference on Artificial Intelligence, IJCAI 2003
作者: Brewka, Gerhard Niemela, Ilkka Truszczynski, Miroslaw Comp. Sci. Institute University of Leipzig Leipzig Germany Dept. of Comp. Sci. and Eng. Helsinki University of Technology Helsinki Finland Dept. of Comp. Sci. University of Kentucky Lexington KY 40506-0046 United States
We investigate the combination of answer set programming and qualitative optimization techniques. Answer set optimization programs (ASO programs) have two parts. The generating program Pyen produces answer sets repres... 详细信息
来源: 评论
Transforming equality logic to propositional logic
Transforming equality logic to propositional logic
收藏 引用
FTP'2003, 4th International Workshop on First-Order Theorem Proving (in Connection with RDP'03, Federated Conference on Rewriting, Deduction
作者: Zantema, Hans Groote, Jan Friso Department of Computer Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven Netherlands
We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We ... 详细信息
来源: 评论