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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

2nd International Workshop on Extensions of Logic Programmin...

引用

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 programming Language Implementation and logic programming, PLILP 1990

引用

2nd international workshop on programming Language Implementation and logic programming, PLILP 1990

ISBN: (纸本)9783540530107

The proceedings contain 26 papers. The special focus in this conference is on programming Language Implementation and logic programming. The topics include: Implementing parallel rewriting;a new data structure for implementing extensions to prolog;finding the least fixed point using wait-declarations in Prolog;elementary logic programs;a new Presburger arithmetic decision procedure based on extended prolog execution;reasoning about programs with effects;towards a characterization of termination of logic programs;static type analysis of prolog procedures for ensuring correctness;integrating strict and lazy evaluation: The λ-calculus;efficient data representation in polymorphic languages;a logic-based approach to data flow analysis problems (Preliminary version);compilation of narrowing;systematic semantic approximations logic programs;interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity;on the automatic generation of events in Delta Prolog;compilation of non-linear, second order patterns on s-expressions;pattern matching in a functional transformation language using treeparsing;logic programming within a functional framework;compiling logic programs with equality;inference-based overloading resolution for ADA;an approach to verifiable compiling specification and prototyping;bug localization by algorithmic debugging and program slicing;a constraint logic programming shell;modifying the simplex algorithm to a constraint solver;implementing a meta-logical scheme;the Vienna abstract machine.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

An abductive proof procedure for reasoning about actions in modal logic programming 2nd

引用

2nd international workshop on non-monotonic extensions of logic programming

作者： Baldoni, M Giordano, L Martelli, A Patti, V Univ Turin Dipartimento Informat I-10149 Turin Italy

ISBN: (纸本)3540628436

In this paper we propose a modal approach for reasoning about actions in a logic programming framework. We introduce a modal language which makes use of abductive assumptions to deal with persistency, and provides a solution to the ramification problem, by allowing one-way "causal rules" to be defined among fluents. We define the abductive semantics of the language and a goal directed abductive proof procedure to compute abductive solutions for a goal from a given domain description. Both the semantics and the procedure are defined within the argumentation framework. In particular, we focus on a specific semantics, which is essentially an extension of Dung's admissibility semantics to a modal setting. The proof procedure is proved to be sound with respect to this semantics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Computation of non-ground disjunctive well-founded semantics with constraint logic programming 2nd

引用

2nd international workshop on non-monotonic extensions of logic programming

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

ISBN: (纸本)3540628436

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 behaviour 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 (1) this calculus is confluent for arbitrary programs, (2) for finite ground programs it is equivalent to a terminating calculus introduced by Brass and Dir (1995), and (3) it approximates a generalisation of 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. In particular, disconnection-methods play a crucial role. In principle, any constraint theory known from the field of constraint logic programming can be exploited in the context of nonmonotonic 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. In summary, this work yields the basis for a general combination of two paradigms: constraint logic programming and non-monotonic reasoning.

关键词： constraint logic programming equational constraints disjunctive logic programming well-founded semantics non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Transformation-based bottom-up computation of the well-founded model 2nd

引用

2nd international workshop on non-monotonic extensions of logic programming

作者： Brass, S Zukowski, U Freitag, B Univ Hildesheim Inst Informat D-31141 Hildesheim Germany Univ Passau Fak Math & Informat D-94030 Passau Germany

ISBN: (纸本)3540628436

We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by BRASS and Dnr [6, 7]. However, their "residual program" can grow to exponential size, whereas for function-free programs our "program remainder" is always polynomial in the size, i.e. the number of tuples, of the extensional database (EDB). As in the SLG-resolution of CHEN and WARREN [11, 12, 13], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [27, 28], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation-based evaluation methods.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Prolegomena to logic programming for non-monotonic reasoning 2nd

引用

2nd international workshop on non-monotonic extensions of logic programming, NMELP 1996

作者： Dix, Jürgen Luís, Moniz Pereira Przymusinski, Teodor C. Dept. Computer Science University of Koblenz Rheinau 1 KoblenzD-56075 Germany Dept. Computer Science and CENTRIA Universidade Nova de Lisboa Monte da Caparica2825 Portugal Dept. Computer Science University of California at Riverside RiversideCA92521 United States

ISBN: (纸本)9783540628439

The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the principal formalisms and approaches, augmented with examples. © Springer-Verlag Berlin Heidelberg 1977.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach to inference in probabilistic non-monotonic logic programming 2

A hybrid approach to inference in probabilistic non-monotoni...

引用

2nd international workshop on Probabilistic logic programming, PLP 2015 - co-located with 31st international Conference on logic programming, ICLP 2015

作者： Nickles, Matthias Mileo, Alessandra Insight Centre for Data Analytics National University of Ireland Galway Ireland

We present a probabilistic inductive logic programming framework which integrates non-monotonic reasoning, probabilistic inference and parameter learning. In contrast to traditional approaches to probabilistic Answer Set programming (ASP), our framework imposes only comparatively little restrictions on probabilistic logic programs - in particular, it allows for ASP as well as FOL syntax, and for precise as well as imprecise (interval valued) probabilities. User-configurable sampling and inference algorithms, which can be combined in a pipeline-like fashion, provide for general as well as specialized, more scalable approaches to uncertainty reasoning, allowing for adaptability with regard to different reasoning and learning tasks.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：