咨询与建议

限定检索结果

文献类型

  • 14 篇 会议
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 13 篇 工学
    • 13 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
  • 4 篇 理学
    • 4 篇 数学
    • 1 篇 物理学

主题

  • 4 篇 computer circuit...
  • 4 篇 logic programmin...
  • 2 篇 semantics
  • 1 篇 constraint logic...
  • 1 篇 theory of comput...
  • 1 篇 program transfor...
  • 1 篇 computer system ...
  • 1 篇 mathematical log...
  • 1 篇 computers
  • 1 篇 programming tech...
  • 1 篇 programming lang...
  • 1 篇 artificial intel...
  • 1 篇 temporal logic
  • 1 篇 finite domains

机构

  • 1 篇 institute for lo...
  • 1 篇 dept. of computi...
  • 1 篇 department of co...
  • 1 篇 department of co...
  • 1 篇 computer science...
  • 1 篇 faculty of infor...
  • 1 篇 facultad de info...
  • 1 篇 research institu...
  • 1 篇 institute for pr...
  • 1 篇 university of tr...
  • 1 篇 fg intellektik t...
  • 1 篇 the university o...
  • 1 篇 dept. of math. a...
  • 1 篇 depaxtment of co...
  • 1 篇 dept. of comp. s...
  • 1 篇 artificial intel...
  • 1 篇 irst - istituto ...
  • 1 篇 fachbereich info...

作者

  • 1 篇 duggan dominic
  • 1 篇 avenhaus jürgen
  • 1 篇 darlington john
  • 1 篇 egly uwe
  • 1 篇 guo yike
  • 1 篇 ramesh anavai
  • 1 篇 bruynooghc m.
  • 1 篇 giunchiglia faus...
  • 1 篇 hong hoon
  • 1 篇 codish m.
  • 1 篇 de schreye danny
  • 1 篇 duan zhenhua
  • 1 篇 lopes josé gabri...
  • 1 篇 hermenegildo m.
  • 1 篇 beckert bernhard
  • 1 篇 loŕa-sáenz carlo...
  • 1 篇 murray neil v.
  • 1 篇 holt chris
  • 1 篇 garcía de la ban...
  • 1 篇 koutny maciej

语言

  • 15 篇 英文
检索条件"任意字段=5th International Conferenceon Logic Programming and Automated Reasoning, LPAR 1994"
15 条 记 录,以下是1-10 订阅
排序:
5th international Conference on logic programming and automated reasoning, lpar 1994
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
the proceedings contain 24 papers. the special focus in this conference is on logic programming and automated reasoning. the topics include: Generalization and reuse of tactic proofs;program tactics and logic tactics;...
来源: 评论
Implementing a finite-domain CLP-language on top of prolog: A transformational approach  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Vandecasteele, Henk de Schreye, Danny Department of Computer Science K. U. Leuven Celestijnenlaan 200A HeverleeB-3001 Belgium
来源: 评论
Constraint logic programming in the sequent calculus  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Darlington, John Guo, Yike Dept. of Computing Imperial College 180 Queen’s Gate LondonSW7 2BZ United Kingdom
In this paper, we are developing a new logical semantics of CLP. It is shown that CLP is based on an amalgamated logic embedding the entailment relation of constraints into a fragment of intuitionistic logic. Constrai... 详细信息
来源: 评论
Program tactics and logic tactics  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Giunchiglia, Fausto Traverso, Paolo IRST - Istituto per la Pdcerca Scientifica e Tecnologica Povo Trento38050 Italy University of Trento Via Inama 5 Trento38100 Italy
In the past, tactics have been mostly implemented as programs written in some programming language, e.g. ML. We call the tactics of this kind, Program Tactics. In this paper we present a first order classical metatheo... 详细信息
来源: 评论
logical closures  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Duggan, Dominic Department of Computer Science University of Waterloo WaterlooONN2L 3G1 Canada
Uniform proof procedures for hereditary Harrop formulae have been proposed as a foundation for logic programming. A non-standard approach to defining hereditary Harrop formula is given, allowing quantification over pr... 详细信息
来源: 评论
On conditional rewrite systems with extra variables and deterministic logic programs  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Avenhaus, Jürgen Loŕa-Sáenz, Carlos Fachbereich Informatik Universität Kaiserslautern Kaiserslautern67653 Germany
We study deterministic conditional rewrite systems, i.e. conditional rewrite systems where the extra variables are not totally free but ‘input bounded’. If such a system R is quasi-reductive then →R is decidable an... 详细信息
来源: 评论
A logic programming framework for the abductive inference of intentions in cooperative dialogues  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Quaresma, Paulo Lopes, José Gabriel Artificial Intelligence Center UNINOVA Monte da Caparica2825 Portugal
In this paper we propose a general logic programming framework allowing the recognition of plans and intentions behind speech acts through abductive reasoning. these inferences enables each agent to have an active par... 详细信息
来源: 评论
A generic declarative diagnoser for normal logic programs  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Lu, Lunjin The University of Birmingham BirminghamB15 2TT United Kingdom
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. the soundness and the completeness of the diagnoser are proved. the diagnoser is generic in that it can ... 详细信息
来源: 评论
RISC-CLP(CF) constraint logic programming over complex functions  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Hong, Hoon Research Institute for Symbolic Computation Johannes Kepler University LinzA-4040 Austria
A constraint logic programming system for the domain of complex functions is described. the intended users of the language are scientist and engineers who often reason/compute with constraints over complex functions, ... 详细信息
来源: 评论
On the value of antiprenexing  5th
收藏 引用
5th international conferenceon logic programming and automated reasoning, lpar 1994
作者: Egly, Uwe FG Intellektik TH Darmstadt Alexanderstraße 10 DarmstadtD-64283 Germany
In this paper, we examine the effect of antiprenexing on the proof length if resolution deduction concepts are applied. Roughly speaking, our version of antiprenexing moves ∀-quantifiers downward in the formula tree w... 详细信息
来源: 评论