检索结果-内蒙古大学图书馆

2nd international workshop on extensions of logic programming, elp 1991

ISBN: (纸本)9783540554981

The proceedings contain 12 papers. The special focus in this conference is on extensions of logic programming. The topics include: Methodology and programming techniques in GCLA II;extended logic-plus-functional programming;open logic theories;a finitary version of the calculus of partial inductive definitions;a logic programming approach to implementing higher-order term rewriting;an overview of the andorra kernel language;logical and computational invariants of programs;implementing λ-calculus reduction strategies in extended logic programming languages;terminological reasoning and partial inductive definitions;GCLA II a definitional approach to control;natural semantics and some of its meta-theory in elf and the near-horn approach to disjunctive logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

2nd international workshop on Non-Monotonic extensions of logic programming, NMelp 1996

引用

2nd international workshop on Non-Monotonic extensions of logic programming, NMelp 1996

ISBN: (纸本)9783540628439

The proceedings contain 10 papers. The special focus in this conference is on Semantics and Applications. The topics include: Prolegomena to logic programming for non-monotonic reasoning;on logics and semantics for general logic programs;a new logical characterization of stable models and answer sets;aggregation and well-founded semantics +;nonmonotonic reasoning by monotonic inferences + priority constraints;update-programs can update programs;an abductive procedure for reasoning about actions in modal LP;update rule programs versus revision programs;transformation-based bottom-up computation of the well-founded model and computation of non-ground disjunctive well-founded semantics with constraint logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

extensions of logic programming: Second international workshop, elp ’91 Stockholm, Sweden, January 27-29, 1991 Proceedings 2nd

Extensions of logic programming: Second International Worksh...

引用

2nd international workshop on extensions of logic programming, elp 1991

作者： Eriksson, Lars-Henrik Hallnás, Lars Schroeder-Heister, Peter Box 1263 KistaS-164 28 Sweden Chalmers University of Technology Dept. Computer Science GöteborgS-412 96 Sweden Universität Tübingen Wilhelm-Schickard-Institut Sand 13 TübingenW-7400 Germany

来源：评论

学校读者我要写书评

暂无评论

EXTEndED logic-PLUS-FUNCTIONAL programming 2nd

EXTENDED LOGIC-PLUS-FUNCTIONAL PROGRAMMING

引用

2nd international workshop on extensions of logic programming ( elp 91 )

作者： BOLEY, H Deutsches Forschungszentrum für Künstliche Intelligenz Box 2080 Kaiserslautern D-6750 Germany

ISBN: (纸本)354055498X

extensions of logic and functional programming are integrated in RELFUN. Its valued clauses comprise Horn clauses (‘true’-valued) and clauses with a distinguished ‘foot’ premise (returning arbitrary values). Both the logic and functional components permit LISP-like vaxying-axity and higher-order operators. The DATAFUN sublanguage of the functional component is shown to be preferable to relational encodings of functions in DATALOG. RELFUN permits non-ground, non-deterministic functions, hence certain functions can be inverted using an ‘is’-primitive generalizing that of PROLOG. For function nestings a strict call-by-value strategy is employed. The reduction of these extensions to a relational sublanguage is discussed and their WAM compilation is sketched. Three examples (‘serialise’, ‘wang’, and ‘eval’) demonstrate the relational/functional style in use. The list expressions of RELFUN’s LISP implementation are presented in an extended PROLOG-like syntax. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING LAMBDA-CALCULUS REDUCTION STRATEGIES IN EXTEndED logic programming-LANGUAGES 2nd

IMPLEMENTING LAMBDA-CALCULUS REDUCTION STRATEGIES IN EXTENDE...

引用

2nd international workshop on extensions of logic programming ( elp 91 )

作者： HANNAN, J Department of Computer Science University of Copenhagen Universitetsparken 1 Copenhagen Ø DK-2100 Denmark

ISBN: (纸本)354055498X

We study the implementation of four reduction strategies for the untyped λ-calculus in the logic programming language λProlog and restricted sublanguages. The higher-order features of these languages provide very natural methods for manipulating and substituting bound variables. Starting from clear and concise specifications of reduction in the full language we demonstrate how to make certain details in the implementations explicit as we restrict ourselves to the weaker sublanguages. We also show how to translate specifications in a higher-order language to a first-order one, such as Prolog, introducing closures as a replacement for substitutions. This process illustrates how a very high-level description of an implementation can be translated to lower-level ones by reasoning about the logic in which the descriptions are given. It also illustrates some basic methods for manipulating functional languages represented in a higher-order abstract syntax. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

OPEN logic THEORIES 2nd

OPEN LOGIC THEORIES

引用

2nd international workshop on extensions of logic programming ( elp 91 )

作者： BROGI, A LAMMA, E MELLO, P Dipartimento di Informatica Università di Pisa Corso Italia 40 Pisa 56125 Italy DEIS Università di Bologna Viale Risorgimento 2 Bologna 40136 Italy

ISBN: (纸本)354055498X

The handling of evolving knowledge as well as of incomplete knowledge is one of the main issues in knowledge representation systems. On the one hand, evolving knowledge in logic programming can be modeled by providing suitable operators for the dynamic composition of separate theories. On the other hand, when dealing with dynamic composition of separate theories, the Open World Assumption adequately models the aspects of incompleteness of knowledge. A notion of open theory is introduced along with suitable operators for composing and closing theories. It is shown how these operators can be exploited to reconstruct several policies for structuring logic programs. Open theories, as well as the operators for their composition, are provided with a compositional declarative semantics defined in terms of Herbrand models, while a proof theory is given in terms of inference rules. Soundness and completeness results are stated. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A logic programming APPROACH TO IMPLEMENTING HIGHER-ORDER TERM REWRITING 2nd

A LOGIC PROGRAMMING APPROACH TO IMPLEMENTING HIGHER-ORDER TE...

引用

2nd international workshop on extensions of logic programming ( elp 91 )

作者： FELTY, A INRIA Rocquencourt Domaine de Voluceau Le Chesnay Cedex 78153 France AT&T Bell Laboratories 600 Mountain Avenue Murray Hill 07974 NJ United States

ISBN: (纸本)354055498X

Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustrate that rewrite systems and strategies for higher-order term rewriting, which includes the usual notion of first-order rewriting, can be naturally specified and implemented in a higher-order logic programming language. We adopt a notion of higher-order rewrite system which uses the simply typed λ-calculus as the language for expressing rules, with a restriction on the occurrences of free variables on the left hand sides of rules so that matching of terms with rewrite templates is decidable. The logic programming language contains an implementation of the simply-typed lambda calculus including βη-conversion and higher-order unification. In addition, universal quantification in queries and the bodies of clauses is permitted. For higher-order rewriting, we show how these operations implemented at the meta-level provide elegant mechanisms for the object-level operations of descending through terms and matching terms with rewrite templates. We discuss tactic style theorem proving in this environment and illustrate how term rewriting strategies can be expressed as tactic-style search. © Springer-Verlag Berlin Heidelberg 1992.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

GCLA-II - A DEFINITIONAL APPROACH TO CONTROL 2nd

GCLA-II - A DEFINITIONAL APPROACH TO CONTROL

引用

2nd international workshop on extensions of logic programming ( elp 91 )

作者： KREUGER, P Swedish Institute of Computer Science Box 1263 Kista S-164 28 Sweden

ISBN: (纸本)354055498X

This paper describes the logic programming language GCLA II, its operational semantics and parts of its theoretical foundations. GCLA II is a generalization of the language GCLA (Generalized Horn Clause Language) augmented by a method to guide and constrain proof search. The method is based on specification of strategies in a meta language that is a sub language of GCLA itself. A GCLA II program is partitioned into two distinct parts. One is used to express the declarative content of the program, while the other is used to define the possible inferences made from this declarative knowledge. Although the intended use of the declarative part and the procedural parts are quite different, they can both be described in the formalism of partial inductive definitions. Thus we preserve a declarative reading of the program as a whole. In particular, given certain syntactical constraints on the program, the heuristics associated with proof search does not affect the declarative reading of the declarative part of the program at all. Experimental interpreters for the language have been implemented and work on a compiler from GCLA II to Prolog is almost completed. © Springer-Verlag Berlin Heidelberg 1992.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

On logics and semantics for general logic programs 2nd

引用

2nd international workshop on Non-Monotonic extensions of logic programming

作者： Bochman, A

ISBN: (纸本)3540628436

We suggest a general logical formalism for logic programming (called a biconsequence relation) based on a four-valued inference. We show that it forms a proper setting for representing logic programs of a most general kind and for describing fogies and semantics that characterize their behavior. In this way we also extend the connection between logic and logic programming beyond positive programs. A uniform representation of various semantics for logic programs is presented. The main conclusion from this representation is that the distinction between these semantics can be largely attributed to the difference in their underlying (monotonic) logical systems. Moreover, in most cases the difference can even be reduced to that of the language, that is, to the difference in the logical connectives allowed for representing derivable information. In addition, it allows us to see a reasoning about logic programs as a most simple kind of nonmonotonic reasoning in general.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A framework to incorporate non-monotonic reasoning into constraint logic programming

引用

JOURNAL OF logic programming 1998年第1-3期37卷 47-76页

作者： Dix, J Stolzenburg, F Univ Koblenz Dept Comp Sci D-56075 Koblenz Germany

Impressive work has been done in the last years concerning the meaning of negation and disjunction in logic programs, but most of this research concentrated on propositional programs only. While it suffices to consider the propositional case for investigating general properties and the overall behavior of a semantics, we feel that for real applications and for computational purposes an implementation should be able to handle first-order programs without grounding them. In this paper we present a theoretical framework by defining a calculus of program transformations that apply directly to rules with variables and function symbols. Our main results are that (a) this calculus is weakly confluent for arbitrary programs (ie., it has the normal form property), (b) it is weakly terminating for Datalog(V,inverted left perpendicular) programs, (c) for finite ground programs it is equivalent to a weakly terminating calculus introduced by Brass and Dix (1995), and (d) it approximates a generalization of Disjunctive Well-founded semantics (D-WFS) for arbitrary programs. We achieve this by transforming program rules into rules with equational constraints thereby using heavily methods and techniques from constraint logic programming (CLP). In particular, disconnection-methods play a crucial role. In principle, any constraint theory known from CLP can be exploited in the context of non-monotonic reasoning, not only equational constraints over the Herbrand domain. However, the respective constraint solver must be able to treat negative constraints of the considered constraint domain. Tn summary, this work yields the basis for a general combination of two paradigms: constraint logic programming and non-monotonic reasoning. (C) 1995 Elsevier Science Inc. All rights reserved.

关键词： Well-founded semantics Partial deduction Semantics COTL1 gene logic programming Negation Rule CALML3 gene Constraint Constraint theory Chromosome Segregation Non-monotonic Reasoning COPPER ALLOY NO 272 well-founded functions CONTRACT LABORATORY PROGRAM well-founded sets

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：