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

Extending and implementing the stable model semantics

artificial intelligence 2002年第1-2期138卷 181-234页

作者： Simons, P Niemelä, I Soininen, T Aalto Univ Dept Comp Sci & Engn Lab Theoret Comp Sci FIN-02015 Espoo Finland Neotide Oy FIN-65200 Vaasa Finland Aalto Univ Dept Comp Sci & Engn Software Business & Engn Inst FIN-02015 Espoo Finland

A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. the computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small subclass of the language called basic constraint rules is devised. An implementation of the language, the SMODELS System, is developed based on this embedding. It uses a two level architecture consisting of a front-end and a kernel language implementation. the front-end allows restricted use of variables and functions and compiles general weight constraint rules to basic constraint rules. A major part of the work is the development of an efficient search procedure for computing stable models for this kernel language. the procedure is compared with and empirically tested against satisfiability checkers and an implementation of the stable model semantics. It offers a competitive implementation of the stable model semantics for normal programs and attractive performance for problems where the new types of rules provide a compact representation. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： answer set programming logic programs stable model semantics weight constraints optimization

来源：评论

学校读者我要写书评

暂无评论

LUPS - A language for updating logic programs 5th

引用

5th international conference on logic programming and Nonmonotonic reasoning (LPNMR 99)

作者： Alferes, JJ Pereira, LM Przymusinska, H Przymusinski, TC Univ Nova Lisboa FCT Ctr Inteligencia Artificial P-2829516 Caparica Portugal Calif State Polytech Univ Pomona Pomona CA 91768 USA Univ Calif Riverside Riverside CA 92521 USA

ISBN: (纸本)3540667490

Most of the work conducted so far in the field of logic programming has focused on representing static knowledge, i.e., knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the authors introduced dynamic logic programming. there, they studied and defined the declarative and operational semantics of sequences of logic programs (or dynamic logic programs). Each program in the sequence contains knowledge about some given state, where different states may, for example, represent different time periods or different sets of priorities. But how, in concrete situations, is a sequence of logic programs built? For instance, in the domain of actions, what are the appropriate sequences of programs that represent the performed actions and their effects? Whereas dynamic logic programming provides a way for, given the sequence, determining what should follow, it does not provide a good practical language for the specification of the sequence of updates which may be conditional on the intervening states. Here we define the language LUPS-"Language for dynamic updates"-designed for specifying changes to logic programs. Given an initial knowledge base (as a logic program) LUPS provides a way for sequentially updating it. the declarative meaning of a sequence of sets of update actions in LUPS is defined by the semantics of the dynamic logic program generated by those actions. Additionally, we provide a translation of the sequence of update statements sets into a single logic program written in a meta-language, in such a way that the stable models of the resulting program correspond to the previously defined declarative semantics. Finally, we exhibit the usage of LUPS in several application domains. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： logic programming knowledge updates

来源：评论

学校读者我要写书评

暂无评论

Improving on-demand strategy annotations 1

引用

9th international conference on logic for programming, artificial intelligence and reasoning

作者： Alpuente, M Escobar, S Gramlich, B Lucas, S Univ Politecn Valencia DSIC E-46022 Valencia Spain Vienna Univ Technol Inst Comp Sprachen AG Theoret Informat & Log A-1040 Vienna Austria

ISBN: (数字)9783540360780

ISBN: (纸本)3540000100

In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations which specify (the order in) which subterms are evaluated. Syntactically, they are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index enables the evaluation of an argument whereas a negative index means "evaluate on-demand". While strategy annotations containing only natural numbers have been implemented and received some recent investigation endeavor (regarding, e.g., termination and completeness), fully general annotations (also called on-demand strategy annotations), which have been proposed to support laziness in OBJ-like languages, are disappointingly under-explored to date. In this paper, we first point out a number of problems of current proposals for handling on-demand strategy annotations. then, we propose a solution to these problems which is based on a suitable extension of the E-evaluation strategy of OBJ-like languages (that only considers annotations given as natural numbers) to on-demand strategy annotations. Our strategy incorporates a better treatment of demandness and also exhibits good computational properties;in particular, we show how to use it for computing (head-)normal forms. We also introduce a transformation for proving termination of the new evaluation strategy by using standard techniques.

关键词： declarative programming demandness lazy evaluation OBJ on-demand strategy annotations

来源：评论

学校读者我要写书评

暂无评论

Annotated revision programs 5th

引用

5th international conference on logic programming and Nonmonotonic reasoning (LPNMR 99)

作者： Marek, V Pivkina, I Truszczynski, M Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

ISBN: (纸本)3540667490

Revision programming is a formalism to describe and enforce updates of belief sets and databases. that formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence (probability) that a revision atom holds. the main goal of our paper is to reexamine the work of Fitting, argue that his semantics does not always provide results consistent with intuition, and to propose an alternative treatment of annotated revision programs. Our approach differs from that proposed by Fitting in two key aspects: we change the notion of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the annotated case. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： knowledge representation database updates belief revision revision programming annotated programs

来源：评论

学校读者我要写书评

暂无评论

An intelligent knowledge processing system on hydrodynamics and water quality modeling 15th

引用

15th international conference on Industrial and Engineering Applications of artificial intelligence and Expert Systems, IEA/AIE 2002

作者： Chau, K.W. Cheng, Chuntian Li, Y.S. Li, C.W. Wai, O. Department of Civil and Structural Engineering Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong Department of Civil Engineering Dalian University of Technology Dalian116024 China

ISBN: (纸本)3540437819

In order to aid novice users in the proper selection and application of myriad ever-complicated algorithmic models on coastal processes, needs arise on the incorporation of the recent artificial intelligence technology into them. this paper delineates an intelligent knowledge processing system on hydrodynamics and water quality modeling to emulate expert heuristic reasoning during the problemsolving process by integration of the pertinent descriptive, procedural, and reasoning knowledge. this prototype system is implemented using a hybrid expert system shell, Visual Rule Studio, which acts as an ActiveX Designer under the Microsoft Visual Basic programming environment. the architecture, solution strategies and development techniques of the system are also presented. the domain knowledge is represented in object-oriented programming and production rules, depending on its nature. Solution can be generated automatically through its robust inference mechanism. By custom-built interactive graphical user interfaces, it is capable to assist model users by furnishing with much needed expertise. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A customizable configuration tool for design of multi-part products 15th

引用

15th international conference on Industrial and Engineering Applications of artificial intelligence and Expert Systems, IEA/AIE 2002

作者： Murtagh, Niall Industrial Electronics and Systems Laboratory Mitsubishi Electric Corporation Tsukaguchi-honmachi 8-1-1 Amagasaki-shiHyogo661-8661 Japan

ISBN: (纸本)3540437819

the configuration of complex multi-part products often requires that a human expert be available to determine a compatible set of parts satisfying the specification. With the availability of on-line web catalogs, such experts can now be supported or even substituted by intelligent web tools. this paper describes the architecture and problem representation for such a tool, built upon a constraint-based reasoning engine. the flexible strategy we employ enables a high degree of user customization of the web tool, allowing users to personalize not only the tool interface but also to edit or add to the catalogs as required, and even to change the product representation details. We illustrate the ideas by referring to the configuration of industrial products such as programmable logic controllers (PLC). © Springer-Verlag Berlin Heidelberg 2002.

关键词： Programmable logic controllers

来源：评论

学校读者我要写书评

暂无评论

6th international conference on artificial intelligence and Symbolic Computation, AISC 2002 held jointly with 10th symposium on the Integration of Symbolic Computation and Mechanized reasoning, Calculemus 2002

引用

Joint conferences on 6th artificial intelligence and Symbolic Computation, AISC 2002 and 10th Symposium on the Integration of Symbolic Computation and Mechanized reasoning, Calculemus 2002

ISBN: (纸本)3540438653

the proceedings contain 30 papers. the special focus in this conference is on artificial intelligence, Automated reasoning, and Symbolic Computation. the topics include: Expressiveness and complexity of full first-order constraints in the algebra of trees;deduction versus computation;integration of quantifier elimination with constraint logic programming;towards a hybrid symbolic/numeric computational approach in controller design;inductive synthesis of functional programs;on a generalised logicality theorem;using symbolic computation in an automated sequent derivation system for multi-valued logic;multicontext logic for semigroups of contexts;indefinite integration as a testbed for developments in multi-agent systems;genetic symbolic classification integrated with non-linear coefficient optimisation;a novel face recognition method;non-commutative logic for hand-written character modeling;from numerical to symbolic data during the recognition of scenarii;on mathematical modeling of networks and implementation aspects;continuous first-order constraint satisfaction;reasoning and scheduling with interval constraints;a genetic-based approach for satisfiability problems;the meaning of infinity in calculus and computer algebra systems and making conjectures about maple functions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Formalised cut admissibility for display logic 15th

引用

15th international conference on theorem Proving in Higher Order logics, TPHOLs 2002

作者： Dawson, Jeremy E. Department of Computer Science and Automated Reasoning Group Australian National University CanberraACT 0200 Australia

ISBN: (纸本)3540440399

We use a deep embedding of the display calculus for relation algebras δRA in the logical framework Isabelle/HOL to formalise a machine-checked proof of cut-admissibility for δRA. Unlike other "implementations", we explicitly formalise the structural induction in Isabelle/ HOL and believe this to be the first full formalisation of cutadmissibility in the presence of explicit structural rules. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Two-level meta-reasoning in coq 15th

引用

15th international conference on theorem Proving in Higher Order logics, TPHOLs 2002

作者： Felty, Amy P. School of Information Technology Engineering University of Ottawa OttawaONK1N 6N5 Canada

ISBN: (纸本)3540440399

the use of higher-order abstract syntax is central to the direct, concise, and modular specification of languages and deductive systems in a logical framework. Developing a framework in which it is also possible to reason about such deductive systems is particularly challenging. One difficulty is that the use of higher-order abstract syntax complicates reasoning by induction because it leads to definitions for which there are no monotone inductive operators. In this paper, we present a methodology which allows Coq to be used as a framework for such meta-reasoning. this methodology is directly inspired by the two-level approach to reasoning used in the FOλΔ (pronounced fold-n) logic. In our setting, the Calculus of Inductive Constructions (CIC) implemented by Coq represents the highest level, or meta-logic, and a separate specification logic is encoded as an inductive definition in Coq. then, in our method as in FOλΔ, the deductive systems that we want to reason about are the object logics which are encoded in the specification logic. We first give an approach to reasoning in Coq which very closely mimics reasoning in FOλΔ illustrating a close correspondence between the two frameworks. We then generalize the approach to take advantage of other constructs in Coq such as the use of direct structural induction provided by inductive types. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Consistency checking for qualitative spatial reasoning with cardinal directions 8th

引用

8th international conference on Principles and Practice of Constraint programming, CP 2002

作者： Skiadopoulos, Spiros Koubarakis, Manolis Dept. of Electrical and Computer Engineering National Technical University of Athens Zographou Athens157 73 Greece Dept of Electronic and Computer Engineering Technical University of Crete Chania Crete73100 Greece

ISBN: (纸本)3540441204

We present a formal model for qualitative spatial reasoning with cardinal directions and study the problem of checking the consistency of a set of cardinal direction constraints. We present the first algorithm for this problem, prove its correctness and analyze its computational complexity. Utilizing the above algorithm we prove that the consistency checking of a set of basic cardinal direction constraints can be performed in O(n5) time while the consistency checking of an un restricted set of cardinal direction constraints is NP-complete. Finally, we briefly discuss some extensions to the basic model. © Springer-Verlag Berlin Heidelberg 2002.

关键词： artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：