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

Extending compositional message sequence graphs 1

9th international conference on logic for programming, Artificial Intelligence and reasoning

作者： Bollig, B Leucker, M Lucas, P Rhein Westfal TH Aachen Lehrstuhl Informat 2 D-5100 Aachen Germany Uppsala Univ Dept Comp Syst Uppsala Sweden Univ Saarland D-6600 Saarbrucken Germany

ISBN: (数字)9783540360780

ISBN: (纸本)3540000100

We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositzonal message sequence charts (ECMSCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs can be combined by means of choice and repetition to (extended) compositional message sequence graphs. We show that-despite extended expressive power-model checking of monadic second-order logic (MSO) for this framework remains to be decidable. the key technique to achieve our results is to use an extended notion for linearizations.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A Hoare logic for dynamic networks of asynchronously communicating deterministic processes

引用

thEORETICAL COMPUTER SCIENCE 2002年第1-2期274卷 3-41页

作者： de Boer, FS Univ Utrecht Dept Comp Sci NL-3508 TB Utrecht Netherlands

this paper introduces a compositional Hoare logic for reasoning about the partial correctness and absence of deadlock of a certain class of programs. Considered are programs that describe networks composed of a dynamically evolving collection of processes which are all executing in parallel, and which know each other by maintaining and passing around process-references via an asynchronous communication mechanism based on (unbounded) FIFO buffers. the Hoare logic formalizes reasoning about such dynamic networks on an abstraction level that is at least as high as that of the programming language. this means that the only operations on 'pointers' (that is, references to processes) are testing for equality and dereferencing. Moreover, in a given state of the system, it is only possible to mention the processes that exist in that state. Processes that have not (yet) been created do not play a role. Soundness and completeness of the logic is proved with respect to a compositional characterization of the initial/final state semantics of programs. this characterization generalizes the compositional semantics of deterministic Kahn (data-flow) networks (where the number of processes and communication structure is fixed). (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： dynamic networks correctness compositionality Hoare logic

来源：评论

学校读者我要写书评

暂无评论

A Hoare logic for dynamic networks of asynchronously communicating deterministic processes

A Hoare logic for dynamic networks of asynchronously communi...

引用

9th international conference on Concurrency theory (CONCUR 98)

作者： de Boer, FS Univ Utrecht Dept Comp Sci NL-3508 TB Utrecht Netherlands

关键词： dynamic networks correctness compositionality Hoare logic

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

logic programming and nonmonotonic reasoning - 6th international conference, LPNMR 2001, Proceedings

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

ISBN: (纸本)3540425934

the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs reasoning;nonmonotonic inductive logic programming;on the effect of default negation on the expressiveness of disjunctive rules;on the expressibility of stable logic programming;on the relationship between defeasible logic and well-founded semantics;a comparative study of well-founded semantics for disjunctive logic programs;reasoning with open logic programs;representation of incomplete knowledge by induction of default theories;explicitly using default knowledge in concept learning: an extended description logics plus strict and default rules;declarative specification and solution of combinatorial auctions using logic programming;and planning with different forms of domain-dependent control knowledge - an answer set programming approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

nonmonotonic inductive logic programming

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Sakama, Chiaki Department of Computer and Communication Sciences Wakayama University Sakaedani Wakayama 640 8510 Japan

ISBN: (纸本)3540425934

nonmonotonic logic programming (NMLP) and inductive logic programming (ILP) are two important extensions of logic programming. the former aims at representing incomplete knowledge and reasoning with commonsense, while the latter targets the problem of inductive construction of a general theory from examples and background knowledge. NMLP and ILP thus have seemingly different motivations and goals, but they have much in common in the background of problems, and techniques developed in each field are related to one another. this paper presents techniques for combining these two fields of logic programming in the context of nonmonotonic inductive logic programming (NMILP). We review recent results and problems to realize NMILP. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

reasoning with open logic programs

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Bonatti, Piero A. Dipartimento di Tecnologie dell'Informazione Università di Milano Italy

ISBN: (纸本)3540425934

this paper motivates and introduces entailment problems over nonmonotonic theories some of whose predicates - called open predicates - are not (completely) specified. More precisely, we are interested in those inferences that hold for some or all possible axiomatizations of the open predicates. Since a complete specification of an open predicate may model incomplete knowledge about the world, this kind of inference should distinguish missing object-level knowledge from missing parts of the specification, and restrict nonmonotonic inference accordingly. We formalize some interesting forms of such open entailment problems, and provide formal proof techniques for some of them in a logic programming framework. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Inheritance and recognition in uncertain and fuzzy object-oriented models

Inheritance and recognition in uncertain and fuzzy object-or...

引用

9th international-Fuzzy-Systems-Association World Congress/20th North-American-Fuzzy-Information-Processing-Society, international conference

作者： Cao, th Rossiter, JM Martin, TP Baldwin, JF Univ Bristol Dept Engn Math Artificial Intelligence Grp Bristol BS8 1TR Avon England

ISBN: (纸本)0780370783

this paper proposes probabilistic default reasoning as a suitable approach to inheritance and recognition in uncertain and fuzzy object-oriented models. Firstly, we introduce an uncertain and fuzzy object-oriented model where a class property (i.e., an attribute or a method) can contain fuzzy sets interpreted as families of probability distributions, and uncertain class membership and property applicability are measured by lower and upper bounds on probability. Each uncertainly applicable property is interpreted as a default probabilistic logic rule, which is defeasible. In order to reduce the computational complexity of general probabilistic default reasoning, we propose to use Jeffrey's rule for a weaker notion of consistency and for local inference, then apply them to uncertain inheritance of properties. Using the same approach but with inverse Jeffrey's rule, uncertain recognition as probabilistic default reasoning is also presented. the approach is illustrated by an example in Fril++, the uncertain and fuzzy object-oriented logic programming language that we have been developing.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：