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

Aggregation and well-founded semantics 2nd

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

作者： Osorio, M Jayaraman, B Univ Americas Puebla Dept Ingn Sistemas Computac Cholula 72820 Mexico SUNY Buffalo Dept Comp Sci Buffalo NY 14260 USA

ISBN: (纸本)3540628436

Set-grouping and aggregation are powerful non-monotonic operations of practical interest in database query languages. We consider the problem of expressing aggregation via negation as failure (NF). We study this problem in the framework of partial-order clauses introduced in [JOM95]. We show a translation of partial-order programs to normal programs that is very natural: Any cost-monotonic partial-order program P becomes a stratified normal program transl(P) such that the declarative semantics of P is equivalent to the stratified semantics of transl(P). The ability to effect such a translation is significant because the resulting normal programs do not make any explicit use of the aggregation capability, yet they are concise and intuitive. The success of this translation is due to the fact that the translated program is a stratified normal program. That would not be the case for other more general classes of programs than cost-monotonic partial-order programs. We therefore investigate a second land more natural) translation that does not require the translated programs to be stratified, but requires the use of a suitable NF strategy. The class of normal programs originating from this translation is itself interesting. Every program in this class has a clear intended total model, although these programs are in general not stratified and not even call-consistent and do not have a stable model. The partial model given by the well-founded semantics is consistent with the intended total model and the extended well founded semantics WFS+ indeed defines the intended model. Since there is a well-defined and efficient operational semantics for partial-order programs [JOM95, JM95] we conclude that the gap between expression of a problem and computing its solution can be reduced with the right level of notation.

关键词： partial order clauses aggregation negation as failure well-founded semantics database query languages declarative programming deductive databases

来源：评论

学校读者我要写书评

暂无评论

nonmonotonic reasoning by monotonic inferences with priority constraints 2nd

引用

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

作者： Wang, Xianchang You, Jia-Huai Li, Yah Yuan Department of Computing Science University of Alberta EdmontonABT6G 2H1 Canada

ISBN: (纸本)9783540628439

The purpose of this paper is to argue that nonmonotonic reasoning in general can be viewed as monotonic inferences constrained by a simple notion of priority constraint. More important, these type of constrained inferences can be specified in a knowledge representation language where a theory consists of a collection of logic programming-like rules and a priority constraint among them: that the application of one rule blocks that of the lower ranked rules. We thus present a formal system for representing common sense knowledge, and call it priority logic. As applications, we recast default reasoning by priority reasoning, and show that Horty's defeasible inheritance networks can be represented by priority logic. This latter result is a partial answer to Horty's challenge that it is impossible to relate path-based reasoning to general nonmonotonic formalisms. © Springer-Verlag Berlin Heidelberg 1977.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CEUR workshop Proceedings

CEUR Workshop Proceedings

引用

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

The proceedings contain 7 papers. The topics discussed include: advances in integrating statistical inference;towards a general framework for actual causation using cp-logic;most probable explanation for MetaProbLog and its application in heart sound segmentation;constraint-based inference in probabilistic logic programs;a hybrid approach to inference in probabilistic non-monotonic logic programming;the distribution semantics is well-defined for all normal programs;probabilistic abductive logic programming using dirichlet priors;and anytime inference in probabilistic logic programs with Tp-compilation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

METHODOLOGY And programming TECHNIQUES IN GCLA-II 2nd

METHODOLOGY AND PROGRAMMING TECHNIQUES IN GCLA-II

引用

2nd international workshop ON extensions OF logic programming ( ELP 91 )

作者： ARONSSON, M Knowledge Based Systems Laboratory Swedish Institute of Computer Science Box 1263 Kista S-164 28 Sweden

ISBN: (纸本)354055498X

We will demonstrate various implementation techniques in the language GCLA. First an introduction to GCLA is given, followed by some examples of program developments, to demonstrate the development methodology. Other examples are also given to show various implementation techniques and properties of the system. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

programming Language Semantics with Isabelle/HOL

Programming Language Semantics with Isabelle/HOL

引用

workshop-School on Theoretical Computer Science (WEIT)

作者： Martini, Alfio Pontificia Univ Catolica Rio Grande do Sul Fac Informat Porto Alegre RS Brazil

ISBN: (纸本)9781479930579

Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order logic. In programming language theory, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages. In this paper we develop a relational denotational semantics for a small imperative programming language and implement it as a theory in Isabelle/HOL. We give special attention to the specification of monotonic fixpoint functionals for loops and provide non-trivial proofs of interesting lemmas and properties with the structured proof language Isar.

关键词： proof assistants higher-order logic formal semantics Isabelle/HOL

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Model checking linear logic specifications

引用

THEORY And PRACTICE OF logic programming 2004年第5-6期4卷 573-619页

作者： Bozzano, M DelZanno, G Martelli, M IRST ITC I-38050 Trento Italy Univ Genoa Dipartimento Informat & Sci Informaz I-16146 Genoa Italy

The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems (Andreoli, 1992;Cervesato, 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al., 2002). Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings (Abdulla et al., 1996;Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.

关键词： linear logic fixpoint semantics bottom-up evaluation

来源：评论

学校读者我要写书评

暂无评论

2nd international workshop on non-monotonic Reasoning, 1988

2nd International Workshop on Non-Monotonic Reasoning, 1988

引用

2nd international workshop on non-monotonic Reasoning, 1988

ISBN: (纸本)9783540507017

The proceedings contain 15 papers. The special focus in this conference is on non-monotonic Reasoning. The topics include: A nonmonotonic logic for reasoning about speech acts and belief revision;autoepistemic logic and formalization of commonsense reasoning preliminary report;nonmonotonic reasoning in temporal domains: The knowledge independence problem;benchmark problems for formal nonmonotonic reasoning: Version 2.00;logics for inheritance theory;new results on semantical nonmonotonic reasoning;the semantics of non-monotonic entailment defined using partial interpretations;hierarchic autoepistemic theories for nonmonotonic reasoning: Preliminary report;autoepistemic stable closures and contradiction resolution;compiling circumscriptive theories into logic programs;a circumscriptive theorem prover;the complexity of model-preference default theories;massively parallel Assumption-based truth maintenance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compiling circumscriptive theories into logic programs 2nd

Compiling circumscriptive theories into logic programs

引用

2nd international workshop on non-monotonic Reasoning, 1988

作者： Gelfond, Michael Lifschitz, Vladimir University of Texas at El Paso El PasoTX79968 United States Stanford University StanfordCA94305 United States

ISBN: (纸本)9783540507017

We study the possibility of reducing some special cases of circumscription to logic programming. The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in T. The method is applicable, in particular, to some formalizations of tree-structured inheritance systems with exceptions. © Springer-Verlag Berlin Heidelberg 1989.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：