咨询与建议

限定检索结果

文献类型

  • 13 篇 会议
  • 5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 14 篇 工学
    • 13 篇 计算机科学与技术...
    • 8 篇 软件工程
    • 3 篇 控制科学与工程
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
  • 8 篇 理学
    • 8 篇 数学
  • 1 篇 管理学
    • 1 篇 图书情报与档案管...

主题

  • 5 篇 logic programmin...
  • 4 篇 artificial intel...
  • 3 篇 computer science
  • 3 篇 equations
  • 2 篇 ac generators
  • 2 篇 polynomials
  • 1 篇 database languag...
  • 1 篇 set matching
  • 1 篇 polynomial appro...
  • 1 篇 pattern matching
  • 1 篇 history
  • 1 篇 prime
  • 1 篇 mechanical facto...
  • 1 篇 petri nets
  • 1 篇 matching
  • 1 篇 linear programmi...
  • 1 篇 ear
  • 1 篇 on the complexit...
  • 1 篇 specifications
  • 1 篇 automatic

机构

  • 2 篇 institute of pro...
  • 1 篇 inria-crin vando...
  • 1 篇 institute for lo...
  • 1 篇 1. department of...
  • 1 篇 institute for pr...
  • 1 篇 institute of pro...
  • 1 篇 institute for pr...
  • 1 篇 fac. of industri...
  • 1 篇 centre for mathe...
  • 1 篇 programming logi...
  • 1 篇 2. institute of ...
  • 1 篇 department of co...
  • 1 篇 institute for pr...
  • 1 篇 institute for pr...
  • 1 篇 institute of pro...
  • 1 篇 institute of pro...
  • 1 篇 institute of pro...
  • 1 篇 institute of pro...
  • 1 篇 dept. of compute...
  • 1 篇 loria 615 rue du...

作者

  • 4 篇 kapur deepak
  • 3 篇 narendran paliat...
  • 3 篇 p. narendran
  • 1 篇 nie xm
  • 1 篇 kaput deepak
  • 1 篇 n.v. murray
  • 1 篇 dougherty daniel...
  • 1 篇 hoffmann jörg
  • 1 篇 yang lu
  • 1 篇 聂旭民
  • 1 篇 zhang ht
  • 1 篇 ramesh anavai
  • 1 篇 verma rakesh
  • 1 篇 e. rosenthal
  • 1 篇 kapur d
  • 1 篇 saxena tushar
  • 1 篇 d. kapur
  • 1 篇 narendran r.
  • 1 篇 plaisted david a...
  • 1 篇 nie xumin

语言

  • 17 篇 英文
  • 1 篇 其他
检索条件"机构=Institute for Programming & Logics"
18 条 记 录,以下是11-20 订阅
排序:
On the Complexities of Non-Horn Clause Logic programming
收藏 引用
Journal of Computer Science & Technology 1992年 第2期7卷 114-122页
作者: 聂旭民 Institute for Programming and Logics Department of computer science State University of New York at AlbanyAlbanyNew York 12222U.S.A.
There have been active work to extend the Prolog style Horn Clause logic programming to non-Horn *** this paper,we will analyze the complexities of several such *** purpose is to understand the computational complexit... 详细信息
来源: 评论
Complexity of unification problems with associative-commutative operators
收藏 引用
Journal of Automated Reasoning 1992年 第2期9卷 261-288页
作者: Kapur, Deepak Narendran, Paliath Institute of Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States
The unification problem for terms containing associative and commutative functions is of importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of ... 详细信息
来源: 评论
Double-exponential complexity of computing a complete set of AC-unifiers
Double-exponential complexity of computing a complete set of...
收藏 引用
Annual Symposium on Logic in Computer Science
作者: D. Kapur P. Narendran Institute of Programming and Logics Department of Computer Science State University of New York Albany Albany NY USA
An algorithm for computing a complete set of unifiers for two terms involving associative-commutative function symbols is presented. It is based on a nondeterministic algorithm given by the authors in 1986 to show the... 详细信息
来源: 评论
Preface
Lecture Notes in Computer Science (including subseries Lectu...
收藏 引用
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1992年 607 LNAI卷
作者: Kapur, Deepak Institute for Programming and Logics Dept. of Computer Science State University of New York 1400 Washington Av. AlbanyNY12222 United States
来源: 评论
HOW WELL ARE NON-HORN CLAUSES HANDLED  6th
HOW WELL ARE NON-HORN CLAUSES HANDLED
收藏 引用
6TH INTERNATIONAL SYMP ON METHODOLOGIES FOR INTELLIGENT SYSTEMS ( ISMIS 91 )
作者: NIE, XM Institute for Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States
We analyze the search space of two clause-based proof procedures, the Model Elimination procedure and Near-Horn Prolog, both of Loveland. We study how the search space changes with respect to the degree of how “non-H... 详细信息
来源: 评论
Improving tableau deductions in multiple-valued logics
Improving tableau deductions in multiple-valued logics
收藏 引用
International Symposium on Multiple-Valued Logic
作者: N.V. Murray E. Rosenthal Institute for Programming & Logics Department of Computer Science State University of New York Albany Albany NY USA Department of Mathematics University of New Haven West Haven CT USA
Path dissolution is an efficient generalization of the method of analytic tableaux. Both methods feature (in the propositional case) strong completeness, the lack of reliance upon conjunctive normal form (CNF), and th... 详细信息
来源: 评论
UNNECESSARY INFERENCES IN ASSOCIATIVE-COMMUTATIVE COMPLETION PROCEDURES
收藏 引用
MATHEMATICAL SYSTEMS THEORY 1990年 第3期23卷 175-206页
作者: ZHANG, HT KAPUR, D 1. Department of Computer Science The University of Iowa 52242 Iowa City IA USA 2. Institute of Programming and Logics Department of Computer Science State University of New York at Albany 12222 Albany NY USA
Theoretical results for identifying unnecessary inferences are discussed in the context of the use of a completion-procedure-based approach toward automated reasoning. The notion of a general superposition is introduc... 详细信息
来源: 评论
A complete semantic back chaining proof system  10th
收藏 引用
10th International Conference on Automated Deduction, CADE 1990
作者: Nie, Xumin Plaisted, David A. Department of Computer Science University of North Carolina at Chapel Hill Chapel HillNC27599 United States Institute for Programming and Logics Deparment of Computer Science University of Albany State University of New York AlbanyNY12222 United States
We discuss a sequent style clause-based proof system that supports several important strategies in automatic theorem proving. The system has a goal-subgoal structure and supports back chaining with caching;it permits ... 详细信息
来源: 评论