咨询与建议

限定检索结果

文献类型

  • 883 篇 期刊文献
  • 590 篇 会议
  • 103 册 图书
  • 18 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 1,374 篇 工学
    • 1,339 篇 计算机科学与技术...
    • 1,202 篇 软件工程
    • 28 篇 控制科学与工程
    • 20 篇 电气工程
    • 17 篇 信息与通信工程
    • 15 篇 机械工程
    • 7 篇 建筑学
    • 5 篇 电子科学与技术(可...
    • 4 篇 土木工程
    • 4 篇 交通运输工程
    • 4 篇 生物医学工程(可授...
    • 3 篇 仪器科学与技术
    • 3 篇 农业工程
    • 3 篇 网络空间安全
  • 928 篇 理学
    • 901 篇 数学
    • 31 篇 系统科学
    • 14 篇 统计学(可授理学、...
    • 7 篇 生物学
    • 2 篇 物理学
  • 67 篇 管理学
    • 41 篇 管理科学与工程(可...
    • 26 篇 图书情报与档案管...
    • 22 篇 工商管理
  • 16 篇 教育学
    • 14 篇 教育学
  • 6 篇 医学
    • 5 篇 基础医学(可授医学...
    • 5 篇 临床医学
    • 4 篇 公共卫生与预防医...
    • 3 篇 药学(可授医学、理...
  • 3 篇 哲学
    • 2 篇 哲学
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 农学
    • 3 篇 作物学
  • 1 篇 法学
  • 1 篇 文学

主题

  • 274 篇 answer set progr...
  • 248 篇 logic programmin...
  • 71 篇 software enginee...
  • 67 篇 mathematical log...
  • 60 篇 logics and meani...
  • 59 篇 programming lang...
  • 45 篇 semantics
  • 41 篇 knowledge repres...
  • 34 篇 constraint logic...
  • 32 篇 constraint progr...
  • 30 篇 programming tech...
  • 27 篇 constraint theor...
  • 27 篇 prolog
  • 25 篇 answer-set progr...
  • 24 篇 artificial intel...
  • 23 篇 software enginee...
  • 22 篇 inductive logic ...
  • 21 篇 program transfor...
  • 20 篇 theory
  • 20 篇 non-monotonic re...

机构

  • 39 篇 univ potsdam pot...
  • 22 篇 tu wien austria
  • 18 篇 new mexico state...
  • 16 篇 imdea software i...
  • 15 篇 univ genoa dibri...
  • 15 篇 univ kentucky de...
  • 14 篇 univ a coruna la...
  • 14 篇 univ texas austi...
  • 13 篇 univ calabria ar...
  • 12 篇 univ texas dalla...
  • 11 篇 katholieke univ ...
  • 11 篇 katholieke univ ...
  • 11 篇 vienna univ tech...
  • 10 篇 katholieke univ ...
  • 10 篇 imperial coll lo...
  • 10 篇 vienna univ tech...
  • 9 篇 univ politecn ma...
  • 9 篇 univ genoa genoa
  • 9 篇 univ nebraska om...
  • 9 篇 sabanci univ fac...

作者

  • 48 篇 schaub torsten
  • 34 篇 dodaro carmine
  • 30 篇 eiter thomas
  • 30 篇 cabalar pedro
  • 30 篇 ricca francesco
  • 26 篇 lierler yuliya
  • 26 篇 fandinno jorge
  • 26 篇 gupta gopal
  • 23 篇 riguzzi fabrizio
  • 23 篇 maratea marco
  • 22 篇 alviano mario
  • 21 篇 woltran stefan
  • 21 篇 lifschitz vladim...
  • 19 篇 pontelli enrico
  • 18 篇 gebser martin
  • 17 篇 erdem esra
  • 13 篇 leone nicola
  • 13 篇 carro manuel
  • 13 篇 calimeri frances...
  • 13 篇 oetsch johannes

语言

  • 1,539 篇 英文
  • 30 篇 其他
  • 26 篇 中文
检索条件"任意字段=Theory and Practice of Logic Programming"
1595 条 记 录,以下是1201-1210 订阅
排序:
programming pearl - Computing convex hulls with a linear solver
收藏 引用
theory and practice of logic programming 2005年 第1-2期5卷 259-271页
作者: Benoy, F King, A Mesnard, F Univ Kent Comp Lab Canterbury Kent England
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for po... 详细信息
来源: 评论
CHR grammars
收藏 引用
theory and practice of logic programming 2005年 第4-5期5卷 467-501页
作者: Christiansen, H Roskilde Univ Dept Comp Sci DK-4000 Roskilde Denmark
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatmen... 详细信息
来源: 评论
Abductive logic programs with penalization: semantics, complexity and implementation
收藏 引用
theory and practice of logic programming 2005年 第1-2期5卷 123-159页
作者: Perri, S Scarcello, F Leone, N Univ Calabria Dept Math I-87030 Commenda Di Rende Italy Univ Calabria DEIS I-87030 Arcavacata Di Rende CS Italy Univ Calabria Dept Math I-87030 Arcavacata Di Rende CS Italy
Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study abduction with penalization in the logic... 详细信息
来源: 评论
Automatic generation of CHR constraint solvers
收藏 引用
theory and practice of logic programming 2005年 第4-5期5卷 403-418页
作者: Abdennadher, S Rigotti, C German Univ Cairo Dept Comp Sci Cairo Egypt INSA Lyon LIRIS Lab Lyon France
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic pr... 详细信息
来源: 评论
Integrating design synthesis and assembly of structured objects in a visual design language
收藏 引用
theory and practice of logic programming 2005年 第6期5卷 601-621页
作者: Banyasad, O Cox, PT Dalhousie Univ Halifax NS B3H 1W5 Canada
Computer Aided Design systems provide tools for building and manipulating models of solid objects. Some also provide access to programming languages so that parametrised designs can be expressed. There is a sharp dist... 详细信息
来源: 评论
FLUX: A logic programming method for reasoning agents
收藏 引用
theory and practice of logic programming 2005年 第4-5期5卷 533-565页
作者: Thielscher, M Tech Univ Dresden D-01062 Dresden Germany
FLUX is a programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledge. The core of FLUX is a system of Constraint Handling Rules... 详细信息
来源: 评论
A uniform approach to logic programming semantics
收藏 引用
theory and practice of logic programming 2005年 第1-2期5卷 93-121页
作者: Hitzler, P Wendt, M Univ Karlsruhe Inst AIFB Karlsruhe Germany Univ Leipzig Dept Math & Comp Sci Leipzig Germany
Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some ... 详细信息
来源: 评论
cTI: a constraint-based termination inference tool for ISO-Prolog - Technical note
收藏 引用
theory and practice of logic programming 2005年 第1-2期5卷 243-257页
作者: Mesnard, F Bagnara, R Univ La Reunion Saint Denis France Univ Parma Dept Math Parma Italy
We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove th... 详细信息
来源: 评论
On applying or-parallelism and tabling to logic programs
收藏 引用
theory and practice of logic programming 2005年 第1-2期5卷 161-205页
作者: Rocha, R Silva, F Costa, VS Univ Porto P-4100 Oporto Portugal Univ Fed Rio de Janeiro COPPE Syst & LIACC Rio De Janeiro Brazil
logic programming languages, such as Prolog, provide a high-level, declarative approach to programming. logic programming offers great potential for implicit parallelism, thus allowing parallel systems to often reduce... 详细信息
来源: 评论
A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics
收藏 引用
theory and practice of logic programming 2005年 第1-2期5卷 207-242页
作者: Schweimeier, R Schroeder, M Camtec Software GmbH D-12435 Berlin Germany Tech Univ Dresden Dept Comp Sci Dresden Germany
Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to... 详细信息
来源: 评论