咨询与建议

限定检索结果

文献类型

  • 182 篇 会议
  • 14 册 图书
  • 11 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 149 篇 工学
    • 138 篇 计算机科学与技术...
    • 63 篇 软件工程
    • 35 篇 电气工程
    • 13 篇 控制科学与工程
    • 4 篇 信息与通信工程
    • 4 篇 生物工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 化学工程与技术
    • 2 篇 交通运输工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 安全科学与工程
  • 27 篇 理学
    • 21 篇 数学
    • 5 篇 生物学
    • 2 篇 物理学
    • 2 篇 化学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
  • 8 篇 管理学
    • 7 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 2 篇 法学
    • 2 篇 社会学
  • 2 篇 教育学
    • 2 篇 教育学
  • 1 篇 文学
    • 1 篇 外国语言文学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 临床医学
    • 1 篇 药学(可授医学、理...

主题

  • 49 篇 logic programmin...
  • 13 篇 fuzzy logic
  • 12 篇 mathematical log...
  • 11 篇 programming
  • 11 篇 artificial intel...
  • 10 篇 formal logic
  • 8 篇 programming lang...
  • 7 篇 software enginee...
  • 7 篇 logics and meani...
  • 6 篇 programming tech...
  • 6 篇 probabilistic lo...
  • 5 篇 computer science
  • 5 篇 logic gates
  • 5 篇 semantics
  • 4 篇 programming prof...
  • 4 篇 constraint logic...
  • 4 篇 application soft...
  • 4 篇 kripke logical r...
  • 4 篇 mathematical mod...
  • 4 篇 algorithm analys...

机构

  • 3 篇 univ kentucky de...
  • 2 篇 industrial softw...
  • 2 篇 max planck inst ...
  • 2 篇 vienna univ tech...
  • 2 篇 univ cyprus dept...
  • 2 篇 institute of log...
  • 2 篇 ben gurion univ ...
  • 2 篇 imdea software i...
  • 2 篇 international in...
  • 2 篇 aarhus univ dk-8...
  • 2 篇 wakayama univ de...
  • 2 篇 michigan state u...
  • 2 篇 kings coll londo...
  • 1 篇 mpi informat d-6...
  • 1 篇 transmeta corpor...
  • 1 篇 inria
  • 1 篇 ist austria klos...
  • 1 篇 kielce univ tech...
  • 1 篇 vig impex craiov...
  • 1 篇 department of ma...

作者

  • 4 篇 eiter thomas
  • 3 篇 truszczynski mir...
  • 3 篇 dimopoulos y
  • 2 篇 egly uwe
  • 2 篇 sarna-starosta b...
  • 2 篇 stepanova daria
  • 2 篇 woltran stefan
  • 2 篇 dillon laura k.
  • 2 篇 birkedal lars
  • 2 篇 chlipala adam
  • 2 篇 andrei voronkov
  • 2 篇 dreyer derek
  • 2 篇 turon aaron
  • 2 篇 brewka gerhard
  • 2 篇 kyaw myat thu
  • 2 篇 myo thet naung
  • 2 篇 brafman ri
  • 2 篇 stirewalt r. e. ...
  • 2 篇 krishnaswami nee...
  • 1 篇 miller r

语言

  • 202 篇 英文
  • 4 篇 其他
  • 1 篇 中文
检索条件"任意字段=18th International Conference on Logic Programming, ICLP 2002"
207 条 记 录,以下是131-140 订阅
排序:
Efficient algorithms for decision tree cross-validation
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2003年 第4-5期3卷 621-650页
作者: Blockeel, H Struyf, J Katholieke Univ Leuven Dept Comp Sci B-3001 Louvain Belgium
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward implementation of the technique is it... 详细信息
来源: 评论
Finite domain constraint solver learning
Finite domain constraint solver learning
收藏 引用
18th international Joint conference on Artificial Intelligence, IJCAI 2003
作者: Lallouet, Arnaud Dao, thi-Bich-Hanh Legtchenko, Andrei Ed-Dbali, AbdelAli University d'Orleans LIFO BP 6759 45067 Orleans France
In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. the behavior of the consistency to be learned is taken as the set o... 详细信息
来源: 评论
From logic programming semantics to the consistency of syntactical treatments of knowledge and belief
From logic programming semantics to the consistency of synta...
收藏 引用
18th international Joint conference on Artificial Intelligence, IJCAI 2003
作者: Bolander, thomas Informatics and Mathematical Modelling Technical University of Denmark Denmark
this paper concerns formal theories for reasoning about the knowledge and belief of agents. It has seemed attractive to researchers in artificial intelligence to formalise these propositional attitudes as predicates o... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV
Aggregate functions in disjunctive logic programming: Semant...
收藏 引用
18th international Joint conference on Artificial Intelligence, IJCAI 2003
作者: Dell'Armi, Tina Faber, Wolfgang Ielpa, Giuseppe Leone, Nicola Pfeifer, Gerald Italy Inst. f. Informationssysteme 184/3 TU Wien A-1040Wien Austria
Disjunctive logic programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class E∧ (NPNH). Despite the high expressiveness of DLP... 详细信息
来源: 评论
logic databases on the Semantic Web: Challenges and opportunities
收藏 引用
18th international conference on logic programming
作者: Decker, S Stanford Univ Dept Comp Sci Stanford CA 94305 USA
An extended version of the abstract is available at {urhttp://***/iclp2002}
来源: 评论
Using smodels (declarative logic programming) to verify correctness of certain active rules
Using smodels (declarative logic programming) to verify corr...
收藏 引用
18th international conference on Data Engineering
作者: Nakamura, M Elmasri, R Univ Texas Dept Comp Sci & Engn Arlington TX 76019 USA
In this paper we show that the language of declarative logic programming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness o... 详细信息
来源: 评论
logical algorithms
收藏 引用
18th international conference on logic programming
作者: Ganzinger, H McAllester, D MPI Informat D-66123 Saarbrucken Germany AT&T Labs Res Murray Hill NJ USA
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because t... 详细信息
来源: 评论
A logic program characterization of domain reduction approximations in finite domain CSPs
收藏 引用
18th international conference on logic programming
作者: Ferrand, G Lallouet, A Univ Orleans LIFO F-45067 Orleans 2 France
We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.
来源: 评论
Multi-adjoint logic programming:: A neural net approach
收藏 引用
18th international conference on logic programming
作者: Medina, J Mérida-Casermeiro, E Ojeda-Aciego, M Univ Malaga Dept Matemat Aplicada E-29071 Malaga Spain
A neural implementation which provides an interesting massively parallel model for computing a fixed-point semantics of a program is introduced for multiadjoint logic programming [3]. Distinctive features of this prog...
来源: 评论