咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 8,406 篇 电子文献
  • 7 种 纸本馆藏

日期分布

学科分类号

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

主题

  • 8,410 篇 logic programmin...
  • 603 篇 computer science
  • 474 篇 computer languag...
  • 339 篇 application soft...
  • 304 篇 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
  • 53 篇 vicente henrique
  • 51 篇 gebser martin
  • 50 篇 eiter thomas
  • 49 篇 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,028 篇 英文
  • 322 篇 其他
  • 41 篇 中文
  • 10 篇 日文
  • 4 篇 俄文
  • 2 篇 德文
  • 2 篇 法文
  • 2 篇 葡萄牙文
  • 1 篇 斯洛伐克文
  • 1 篇 土耳其文
检索条件"主题词=Logic Programming"
8410 条 记 录,以下是4791-4800 订阅
排序:
On the strong completion of logic programs  2nd
收藏 引用
2nd International Conference on Algebraic and logic programming, 1990
作者: Dung, Phan Minh Division of Computer Science Asian Institute of Technology GPO Box 2754 Bangkok10501 Thailand Institute of Computer Science National Center for Scientific Research of Vietnam Lieugiai Badinh Hanoi Viet Nam
A new completion theory for logic programming called strong completion, is introduced. Similar to the Clark’s completion, the strong completion can be interpreted either in two-valued or three-valued logic. We show t... 详细信息
来源: 评论
Intermediate languages of ASP systems and tools
Intermediate languages of ASP systems and tools
收藏 引用
1st International Workshop on Software Engineering for Answer Set programming, SEA 2007 - Co-located Event with the 9th International Conference on logic programming and Nonmonotonic Reasoning, LPNMR 2007
作者: Janhunen, Tomi Helsinki University of Technology Department of Computer Science and Engineering P.O. Box 5400 FI-02015 TKK Finland
In answer set programming (ASP), a search problem is solved by describing its solutions in the input language of an answer set solver which is then used to compute solutions to the problem. Usually, the problem is con... 详细信息
来源: 评论
Scheduling Periodic Treatments via Answer Set programming  38
Scheduling Periodic Treatments via Answer Set Programming
收藏 引用
38th Italian Conference on Computational logic, CILC 2023
作者: Caruso, Simone Dodaro, Carmine Galatà, Giuseppe Maratea, Marco DIBRIS University of Genoa Genova Italy DeMaCS University of Calabria Rende Italy SurgiQ srl Genova Italy
The scheduling of periodic treatments consists of planning a care path over a period of several weeks, in which patients have to perform different treatments respecting a certain periodicity. Treatments must be assign... 详细信息
来源: 评论
Learning dishonesty
收藏 引用
22nd International Conference on Inductive logic programming, ILP 2012
作者: Sakama, Chiaki Department of Computer and Communication Sciences Wakayama University Sakaedani Wakayama 640-8510 Japan
Children behave dishonestly as a way of managing problems in daily life. Then our primary interest of this paper is how children learn dishonesty and how one could model human acquisition of dishonesty using machine l... 详细信息
来源: 评论
Demandness in rewriting and narrowing
Demandness in rewriting and narrowing
收藏 引用
WFLP 2002, 11th International Workshop on Functional and (Constraint) logic programming, Selected Papers
作者: Antoy, Sergio Lucas, Salvador Computer Science Department Portland State University Portland OR 97207 United States Universidad Politécnica de Valencia Spain
The traditional investigation of rewriting and narrowing strategies aims at establishing fundamental properties, such as soundness, completeness and/or optimality, of a strategy. In this work, we analyze and compare r... 详细信息
来源: 评论
Parallel and efficient implementation of the compartmentalized connection graph proof procedure: Resolution to unification
收藏 引用
International Workshop on Parallelization in Inference Systems, 1990
作者: Powers, David M. W. Universität Kaiserslautern KaiserslauternW-6750 Germany
This paper documents aspects of the development of a logic programming paradigm with implicit control, based in a compartmentalized con0ection graph theorem prover. Whilst the research has as it main goal the developm... 详细信息
来源: 评论
A lower-bound for answer set solver computation
A lower-bound for answer set solver computation
收藏 引用
5th Latin American Workshop on Non-Monotonic Reasoning, LANMR 2009
作者: Costantini, Stefania Provetti, Alessandro Dip. d'Informatica Universitía di l'Aquila Italy Dip. di Fisica Universitá di Messina Italy
We build upon recent work by Lierler that defines an abstract framework for describing the algorithm underlying many of the existing answer set solvers (for answer set programs, based upon the Answer Set Semantics), c... 详细信息
来源: 评论
Intrinsic Prioritization in Answer Set programming Based on an Adapted Notion of Tolerance  37
Intrinsic Prioritization in Answer Set Programming Based on ...
收藏 引用
37th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2024
作者: Wilhelm, Marco Spiegel, Lars-Phillip Kern-Isberner, Gabriele Dept. of Computer Science TU Dortmund University Dortmund Germany Dept. of Mathematics and Computer Science University of Hagen Hagen Germany
Answer set programming (ASP) is a declarative programming language suited to solve complex combinatorial search problems. Prioritized ASP is the subdiscipline of ASP which aims at prioritizing the models (answer sets)... 详细信息
来源: 评论
Optimizing the computation of heuristics for answer set programming systems
收藏 引用
6th International Conference on logic programming and Nonmonotonic Reasoning, LPNMR 2001
作者: Faber, Wolfgang Leone, Nicola Pfeifer, Gerald Institut fur Informationssysteme TU Wien A-1040 Wien Austria Italy
Most SAT solvers and Answer Set programming (ASP) systems employ a backtracking search by repeatedly assuming the truth of literals. The choice of these branching literals is crucial for the performance of these syste... 详细信息
来源: 评论
Combining an improvement to PARMA trailing with trailing analysis  02
Combining an improvement to PARMA trailing with trailing ana...
收藏 引用
Proceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative programming (PPDP'02)
作者: Schrijvers, Tom Demoen, Bart Department of Computer Science Katholieke Universiteit Leuven Celestijnenlaan 200A B-3001 Heverlee Belgium
Trailing of bindings in the PARMA variable representation is expensive in time and space. Two schemes are presented that lower its cost: the first is a technique that halves the space cost of trailing in PARMA. It can... 详细信息
来源: 评论