咨询与建议

限定检索结果

文献类型

  • 298 篇 会议
  • 27 篇 期刊文献
  • 4 册 图书

馆藏范围

  • 329 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 245 篇 工学
    • 229 篇 计算机科学与技术...
    • 117 篇 软件工程
    • 19 篇 电气工程
    • 17 篇 控制科学与工程
    • 14 篇 信息与通信工程
    • 6 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 5 篇 生物工程
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 2 篇 建筑学
    • 2 篇 农业工程
    • 1 篇 光学工程
  • 53 篇 理学
    • 39 篇 数学
    • 8 篇 生物学
    • 4 篇 系统科学
    • 4 篇 统计学(可授理学、...
    • 3 篇 化学
    • 2 篇 物理学
  • 23 篇 管理学
    • 14 篇 管理科学与工程(可...
    • 9 篇 图书情报与档案管...
    • 5 篇 工商管理
  • 6 篇 经济学
    • 3 篇 理论经济学
    • 3 篇 应用经济学
  • 3 篇 教育学
    • 2 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 3 篇 农学
    • 2 篇 作物学
  • 2 篇 法学
    • 2 篇 社会学
  • 1 篇 医学

主题

  • 70 篇 logic programmin...
  • 18 篇 inductive logic ...
  • 12 篇 programming
  • 10 篇 logic gates
  • 7 篇 computer science
  • 7 篇 semantics
  • 6 篇 computer circuit...
  • 6 篇 inductive logic ...
  • 6 篇 probabilistic lo...
  • 6 篇 artificial intel...
  • 5 篇 optimization
  • 5 篇 logic
  • 5 篇 machine learning
  • 4 篇 formal logic
  • 4 篇 computer archite...
  • 4 篇 model checking
  • 4 篇 java
  • 4 篇 computer languag...
  • 4 篇 integer programm...
  • 4 篇 hardware

机构

  • 5 篇 inria rennes ren...
  • 5 篇 university of po...
  • 3 篇 microsoft res re...
  • 3 篇 univ paris 13 li...
  • 3 篇 carnegie mellon ...
  • 3 篇 aalto university...
  • 3 篇 univ penn philad...
  • 2 篇 univ wales dept ...
  • 2 篇 stanford univ ct...
  • 2 篇 politecn torino ...
  • 2 篇 indian inst tech...
  • 2 篇 univ freiburg in...
  • 2 篇 univ wisconsin d...
  • 2 篇 czech tech univ ...
  • 2 篇 univ london impe...
  • 2 篇 department of in...
  • 2 篇 univ paris 13 li...
  • 2 篇 harvard univ cam...
  • 2 篇 columbia univ ct...
  • 2 篇 ibm unternehmens...

作者

  • 8 篇 gebser martin
  • 6 篇 srinivasan ashwi...
  • 6 篇 alphonse erick
  • 5 篇 schaub torsten
  • 5 篇 ricca francesco
  • 4 篇 osmani aomar
  • 4 篇 page david
  • 4 篇 camacho rui
  • 3 篇 yamamoto akihiro
  • 3 篇 king ross
  • 3 篇 rouveirol celine
  • 3 篇 moreno gines
  • 3 篇 leger hippolyte
  • 3 篇 janhunen tomi
  • 3 篇 maratea marco
  • 3 篇 bouthinon domini...
  • 3 篇 lebbah mustapha
  • 2 篇 muggleton stephe...
  • 2 篇 fronhöfer b
  • 2 篇 khatibsyarbini

语言

  • 317 篇 英文
  • 7 篇 其他
  • 5 篇 中文
检索条件"任意字段=13th International Conference on Inductive Logic Programming"
329 条 记 录,以下是241-250 订阅
排序:
A comparison of reasoning techniques for querying large description logic ABoxes
收藏 引用
13th international conference on logic for programming, Artificial Intelligence, and Reasoning
作者: Motik, Boris Sattler, Ulrike Univ Manchester Manchester Lancs England
Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies. For such applications, we conjectured that reusing ideas... 详细信息
来源: 评论
A tableau decision procedure for propositional intuitionistic logic
A tableau decision procedure for propositional intuitionisti...
收藏 引用
6th international Workshop on the Implementation of logics, IWIL 2006 - Held at the 13th international conference on logic for programming, Artificial Intelligence and Reasoning
作者: Avellone, Alessandro Fiorino, Guido Moscato, Ugo Dipartimento di Metodi Quantitativi per l'Economia Università Milano-Bicocca Piazza dell'Ateneo Nuovo 1 20126 Milano Italy
the contribution of this paper consists in some techniques to bound the proof search space in propositional intuitionistic logic. these techniques are justified by Kripke semantics and they are the backbone of a table... 详细信息
来源: 评论
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
收藏 引用
13th international conference on logic for programming, Artificial Intelligence, and Reasoning
作者: Blanqui, Frederic Riba, Colin UHP UMR 7503 CNRSLORIA INPLINRIA Campus SciBP 239 F-54506 Vandoeuvre Les Nancy France
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size based termination and initially devel... 详细信息
来源: 评论
A web architecture for data mining in biology
A web architecture for data mining in biology
收藏 引用
20th international conference on Advanced Information Networking and Applications
作者: Doncescu, Andrei Farmer, Muhammad Inoue, Katsumi Richard, Gibes LAAS Toulouse 7 Ave Colonel Roche F-31077 Toulouse France BITE London E13 0RA England NII Tokyo 101840 Japan Univ Toulouse 3 IRIT F-31062 Toulouse France
In this paper, we present a current cooperative work involving different institutes around the world. Our aim is to provide an online inductive logic programming tool. this is the first step in a more complete structu... 详细信息
来源: 评论
Randomised restarted search in ILP
Randomised restarted search in ILP
收藏 引用
13th international conference on inductive logic programming
作者: Zelezny, Filip Srinivasan, Ashwin Page, C. David, Jr. Czech Tech Univ CR-16635 Prague Czech Republic IBM India Res Lab New Delhi India Univ Wisconsin Madison WI USA
Recent statistical performance studies of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that i... 详细信息
来源: 评论
Context-sensitive multivariant assertion checking in modular programs
收藏 引用
13th international conference on logic for programming, Artificial Intelligence, and Reasoning
作者: Pietrzak, Pawel Correas, Jesus Puebla, German Hermenegildo, Manuel V. Tech Univ Madrid Sch Comp Sci UPM Madrid Spain Univ Complutense Madrid Sch Comp Sci Madrid Spain Univ New Mexico CS Dept Albuquerque NM 87131 USA Univ New Mexico ECE Dept Albuquerque NM 87131 USA
We propose a modular, assertion-based system for verification and debugging of large logic programs, together with several interesting models for checking assertions statically in modular programs, each with different... 详细信息
来源: 评论
SAT solving for argument filterings
收藏 引用
13th international conference on logic for programming, Artificial Intelligence, and Reasoning
作者: Codish, Michael Schneider-Kamp, Peter Lagoon, Vitaly thiemann, Rene Giesl, Juergen Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Rhein Westfal TH Aachen LuFG Informat 2 D-5100 Aachen Germany Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic Australia
this paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. this facilitates the application of SAT solvers for termination analysis of term rewrite systems based ... 详细信息
来源: 评论
Constructing Camin-Sokal phylogenies via answer set programming
收藏 引用
13th international conference on logic for programming, Artificial Intelligence, and Reasoning
作者: Kavanagh, Jonathan Mitchell, David Ternovska, Eugenia Manuch, Jan Zhao, Xiaohong Gupta, Arvind Simon Fraser Univ Burnaby BC V5A 1S6 Canada
Constructing parsimonious phylogenetic trees from species data is a central problem in phylogenetics, and has diverse applications, even outside biology. Many variations of the problem, including the cladistic Camin-S... 详细信息
来源: 评论
LIFT-UP: Lifted first-order planning under uncertainty
LIFT-UP: Lifted first-order planning under uncertainty
收藏 引用
6th international Workshop on the Implementation of logics, IWIL 2006 - Held at the 13th international conference on logic for programming, Artificial Intelligence and Reasoning
作者: Hölldobler, Steffen Skvortsova, Olga International Center for Computational Logic Technische Universität Dresden Dresden Germany
We present a new approach for solving first-order Markov decision processes combining first-order state abstraction and heuristic search. In contrast to existing systems, which start with propositionalizing the decisi... 详细信息
来源: 评论
Multiple preprocessing for systematic SAT solvers
Multiple preprocessing for systematic SAT solvers
收藏 引用
6th international Workshop on the Implementation of logics, IWIL 2006 - Held at the 13th international conference on logic for programming, Artificial Intelligence and Reasoning
作者: Anbulagan Slaney, John Logic and Computation Program National ICT Australia Ltd. Australia Computer Sciences Laboratory Australian National University Australia
High-performance SAT solvers based on systematic search generally use either conflict driven clause learning (CDCL) or lookahead techniques to gain efficiency. Both styles of reasoning can gain from a preprocessing ph... 详细信息
来源: 评论