Petri网用于Horn子句的逻辑推论

这篇论文探索了命题逻辑的Horn子句的Petri网模型,求解逻辑推论Petri网模型的T—不变量是求解逻辑推论的核心步骤,本文提供了计算T—不变量的算法,这些算法基于归约的思想,另外,在算法中利用单字母规则、纯字母规则和割裂规则可提高算法的速度和简化算法的复杂性。     

基于Petri网的语义Web服务自动组合方法

Web服务组合使得开发人员可以快速地创建自己的应用程序.但是,随着Internet上可用的Web服务数目的增加,Web服务组合是一项高度复杂的任务.针对语义Web服务的自动组合问题,提出了一种既考虑服务输入/输出又考虑服务行为约束的自动组合方法.首先,注册服务被转化为一组Horn子句形规则,用户的输入和输出请求分别被转化为Horn子句中的事实和目标,从而将寻找满足用户输入/输出请求的合成服务问题转化为Horn子句的逻辑推理问题;然后,用Petri网来为该Horn子句集建模,T-不变量技术被用来判定是否存在满足用户输入/输出请求的合成服务;最后给出了两种算法来获取既满足用户输入/输出请求又满足用户行为约束的合成服务的Petri网模型.     

模糊Horn子句规则及其发现算法

模糊Horn子句规则可以用自然语言来表达人类知识。但是,发现模糊Horn子句规则及其蕴含度是比较困难的。该文从逻辑的观点出发,定义模糊Horn子句规则、支持度、蕴含度及其相关概念,分析模糊Horn子句规则发现的步骤,并给出发现算法的形式化描述。该算法结合了模糊Horn子句逻辑概念和Apriori发现算法,从给定的数量型数据库中发现模糊Horn子句规则。     

一个在Horn子句中求解极大缩减的算法

在信念修正理论中,一个核心问题是求解一个公式集合关于事实集合的所有极大协调子集,即极大缩减.本文尝试从算法的角度来解决这一问题,研究在Horn子句中求解所有极大缩减的算法.首先,本文指出并证明了公式集合和事实集合并集的极小不协调子集与公式集合关于事实集合的极大缩减之间的转化关系.其次,给出并证明了Horn子句集合极小不协调的一个必要条件.然后,基于上述两个结论,本文提出了一个在Horn子句中枚举公式集合和事实集合并集的极小不协调子集的交互式算法和一个通过这些极小不协调子集计算所有极大缩减的算法.最后,综合这两个算法,提出了一个在Horn子句中求解所有极大缩减的交互式算法.     

使用Petri网T－不变量求解子句的逻辑推论

本文研究了子句逻辑规则的Ｐｅｔｒｉ网模型的表示及使用Ｐｅｔｒｉ网分析方法进行逻辑推论．基于四值逻辑和冲突变迁的概念，表示了非Ｈｏｒｎ子句Ｐｅｔｒｉ网模型的构造，并使用Ｔ－不变量方法解决于句推论问题．另外，本文还显示了向前推论和向后推论在子句Ｐｅｔｒｉ网模型中的应用．     

使用Petri网T—不变量求解子句的逻辑推论

本文研究了子句逻辑规则的Ｐｅｔｒｉ网模型的表示及使用Ｐｅｔｒｉ网分析方法进行逻辑推论，基于四值逻辑和冲突变迁的概念，表示了非Ｈｏｒｎ子句Ｐｅｔｒｉ网模型的构造，并使用Ｔ－不变量方法解决子句推论问题。     

逻辑Petri网的S-组合及活性分析

基于Petri网和逻辑Petri网,提出了S-组合逻辑Petri网的概念。深入研究了S-组合逻辑Petri网的活性继承问题,给出了S-组合逻辑Petri网活性的判定定理和算法,并分析了S-组合网中几种资源共享情况。针对组合逻辑Petri网的几种资源共享情况,提出了相应的利用控制库所实现S-组合逻辑Petri网活性控制的方法。     

语义Web的逻辑基础

分析了语义Web的逻辑基础.指出了语义Web语言RDF和RDF Schema的语义是基于非经典的模型论语义,阐明了在此基础上扩展到表达能力更强的基于描述逻辑的本体语言OWL的困难.然后描述了OWL对这些困难的解决方法,并概述了如何把OWL的本体推理归约到描述逻辑的知识库可满足性问题.最后介绍了在OWL的基础上纳入Horn子句规则的方法.     

FPN推理模型在上下文感知系统中的应用研究

研究模糊Petri网模型在上下文感知系统中的快速推理算法.针对模糊Petri网的通用推理算法不能解决“或逻辑”问题,提出了模糊Petri网推理算法从变迁开始搜索,区别于通常从库所开始搜索的策略,有效解决了“或逻辑”问题;并在不增加虚库所和虚变迁的前提下对变迁先排序后再进行推理,降低了算法的空间和时间复杂度.最后,对模糊Petri网模型和推理算法进行仿真,实验结果验证了该算法的有效性.     

着色Petri网模型检测工具的扩展及其在Web服务组合中的应用

Web服务组合的形式化描述和验证是一个重要的研究问题.为了更好地完成验证工作,提出了扩展着色Petri网的模型检测方法.首先,在着色Petri网原有的基于CTL的局部模型检测算法基础上,给出了获取模型检测证据/反例的算法,并在着色Petri网模型检测工具--CPN Tools--中使用ML(meta language)语言实现了这些算法,然后将扩展后的CPN模型检测工具应用在Web服务组合的验证问题中.该方法不仅可以验证Web服务组合是否存在逻辑错误,还能告诉用户发生错误的原因,为Web服务组合的验证提供了技术上的保障.实验表明对着色Petri网的模型检测工具的扩展是正确、有效的.     

Logical inference of clauses based on Petri net models

This paper extends the logical inference of Horn clauses in Petri net models to cover a large class of non-Horn clauses. Based on four-valued logic and the conflict transition concept, we show how the Petri net model for this class of non-Horn clauses can be constructed. The clause inference is solved by the T-invariant method or the fixpoint of markings. Both forward and backward inference can be used in our model. It is further shown that these techniques are efficient for the common classes of monotonic reasoning. © 1998 John Wiley & Sons, Inc.     

Logical inference of Horn clauses in Petri net models

Petri net models for the Horn clause form of propositional logic and of first-order predicate logic are studied. A net model for logical inconsistency check is proposed. Algorithms for computing T-invariants of Petri net models of logical inference systems are investigated. The algorithms are based on the idea of resolution and exploit the presence of one-literal, pure-literal, and splitting clauses to lead to faster computation. Algorithms for computing T-invariants of high-level Petri net (HLPN) models of predicate logic are presented     

Learning compact Markov logic networks with decision trees

Statistical-relational learning combines logical syntax with probabilistic methods. Markov Logic Networks (MLNs) are a prominent model class that generalizes both first-order logic and undirected graphical models (Markov networks). The qualitative component of an MLN is a set of clauses and the quantitative component is a set of clause weights. Generative MLNs model the joint distribution of relationships and attributes. A state-of-the-art structure learning method is the moralization approach: learn a set of directed Horn clauses, then convert them to conjunctions to obtain MLN clauses. The directed clauses are learned using Bayes net methods. The moralization approach takes advantage of the high-quality inference algorithms for MLNs and their ability to handle cyclic dependencies. A?weakness of moralization is that it leads to an unnecessarily large number of clauses. In this paper we show that using decision trees to represent conditional probabilities in the Bayes net is an effective remedy that leads to much more compact MLN structures. In experiments on benchmark datasets, the decision trees reduce the number of clauses in the moralized MLN by a factor of 5?C25, depending on the dataset. The accuracy of predictions is competitive with the models obtained by standard moralization, and in many cases superior.     

Synthesis of 3D models by Petri net

This paper presents a synthesis method for 3D models using Petri net. Feature structure units from the example model are extracted, along with their constraints, through structure analysis, to create a new model using an inference method based on Petri net. Our method has two main advantages: first, 3D model pieces are delineated as the feature structure units and Petri net is used to record their shape features and their constraints in order to outline the model, including extending and deforming operations; second, a construction space generating algorithm is presented to convert the curve drawn by the user into local shape controlling parameters, and the free form deformation (FFD) algorithm is used in the inference process to deform the feature structure units. Experimental results showed that the proposed method can create large-scale complex scenes or models and allow users to effectively control the model result.     

基于组合逻辑的故障诊断方法

针对复杂系统故障传播和故障分析的模糊性和不确定性,首先,在逻辑Petri网和模糊Petri网的理论基础上,根据逻辑Petri网的传值不确定性以及模糊Petri网对模糊信息的表示和推理能力的特点,提出模糊逻辑Petri网的概念及推理规则,考虑不同故障源对故障的影响程度,将概率信息引入模糊逻辑Petri网,对故障源赋予置信度,使故障诊断过程更符合实际。其次,利用模糊逻辑Petri网对故障诊断系统进行建模,用模糊逻辑Petri网描述了系统故障状态组合的逻辑关系,并进一步简化了系统模型的表达形式,具有良好的封装性、重构性和可维护性,在一定程度上缓解了状态组合空间爆炸问题。针对故障的传播性,采用可达性分析方法对故障信息的传播路径进行模拟论证,提高了故障诊断效率。最后,通过离心式压缩机故障诊断过程实例分析,验证了该方法的有效性和可行性,提高了故障诊断过程的准确性和高效性。     

Control synthesis of timed discrete event systems based onpredicate invariance

In this paper, arc-timed Petri nets are used to model controlled real-time discrete event systems, and the control synthesis problem that designs a controller for a system to satisfy its given closed-loop behavior specification is addressed. For the problem with the closed-loop behavior specified by a state predicate, real-time control-invariant predicates are introduced, and a fixpoint algorithm to compute the unique extremal control-invariant subpredicate of a given predicate, key to the control synthesis, is presented. For the problem with the behavior specified by a labeled arc-timed Petri net, it is shown that the control synthesis problem can be transformed into one that synthesizes a controller for an induced arc-timed Petri net with a state predicate specification. The problem can then be solved by using the fixpoint algorithm as well. The algorithm involves conjunction and disjunction operations of polyhedral sets and can be algorithmically implemented, making automatic synthesis of controllers for real-time discrete event systems possible.     

Petri net representation of multi-valued logical regulatory graphs

Relying on a convenient logical representation of regulatory networks, we propose a generic method to qualitatively model regulatory interactions in the standard elementary and coloured Petri net frameworks. Logical functions governing the behaviours of the components of logical regulatory graphs are efficiently represented by Multivalued Decision Diagrams, which are also at the basis of the translation of logical models in terms of Petri nets. We further delineate a simple strategy to sort trajectories through the introduction of priority classes (in the logical framework) or priority functions (in the Petri net framework). We also focus on qualitative behaviours such as multistationarity or sustained oscillations, identified as specific structures in state transition graphs (for logical models) or in marking graphs (in Petri nets). Regulatory circuits are known to be at the origin of such properties. In this respect, we present a method that allows to determine the functionality contexts of regulatory circuits, i.e. constraints on external regulator states enabling the corresponding dynamical properties. Finally, this approach is illustrated through an application to the modelling of a regulatory network controlling T lymphocyte activation and differentiation.     

基于工作流网的实时协同系统模拟技术

基于Petri网和工作流的概念，提出一种实时协同系统的形式化模拟与分析技术——逻辑工作流网，逻辑工作流网是抑制弧Petri网和高级Petri网的抽象和扩展，其变迁的输入／输出受逻辑表达式的约束，它与一般工作流网相比，能够在一定程度上缓解状态空间爆炸问题，且便于系统设计人员掌握和使用，该文分析了逻辑工作流网的若干性质及组合网的性质继承问题，并以网上企业销售系统为例，说明逻辑工作流网在实时协同系统模拟分析中的应用。