An Algebraic Approach to Propositional Fuzzy Logic

We investigate the variety corresponding to a logic (introduced in Esteva and Godo, 1998, and called there), which is the combination of ukasiewicz Logic and Product Logic, and in which Gödel Logic is interpretable. We present an alternative (and slightly simpler) axiomatization of such variety. We also investigate the variety, called the variety of algebras, corresponding to the logic obtained from by the adding of a constant and of a defining axiom for one half. We also connect algebras with structures, called f-semifields, arising from the theory of lattice-ordered rings, and prove that every algebra can be regarded as a structure whose domain is the interval [0, 1] of an f-semifield , and whose operations are the truncations of the operations of to [0, 1]. We prove that such a structure is uniquely determined by up to isomorphism, and we establish an equivalence between the category of algebras and that of f-semifields.     

数字游戏中的协同——描述任务逻辑方法

传统的数字游戏只注重底层实体级别的交互协同,不支持多层次群体协同关系描述和协同规划描述,且很少有形式化理论支持.描述任务逻辑结合了描述逻辑的知识表示结构和任务逻辑的任务语义.描述任务逻辑方法对数字游戏中的协同关系和协同规划进行了形式化描述,给出了任务和规划可完成性的定义,以及联合策略下的规划可完成性的判定理论.通过示例说明,描述任务逻辑方法能够准确地描述虚拟群体高层指挥关系的任务交互语义,同时又能提供协同规划可完成性的可判定的推理验证服务.     

Scaling Up Inductive Logic Programming: An Evolutionary Wrapper Approach

Inductive logic programming (ILP) algorithms are classification algorithms that construct classifiers represented as logic programs. ILP algorithms have a number of attractive features, notably the ability to make use of declarative background (user-supplied) knowledge. However, ILP algorithms deal poorly with large data sets (>10⁴ examples) and their widespread use of the greedy set-covering algorithm renders them susceptible to local maxima in the space of logic programs.This paper presents a novel approach to address these problems based on combining the local search properties of an inductive logic programming algorithm with the global search properties of an evolutionary algorithm. The proposed algorithm may be viewed as an evolutionary wrapper around a population of ILP algorithms.The evolutionary wrapper approach is evaluated on two domains. The chess-endgame (KRK) problem is an artificial domain that is a widely used benchmark in inductive logic programming, and Part-of-Speech Tagging is a real-world problem from the field of Natural Language Processing. In the latter domain, data originates from excerpts of the Wall Street Journal. Results indicate that significant improvements in predictive accuracy can be achieved over a conventional ILP approach when data is plentiful and noisy.     

一种基于程序逻辑结构分析的缓冲区溢出攻击抵御方法

本文针对缓冲区溢出攻击提出了一种有效的抵御方法。该方法通过分析程序的逻辑结构试图发现所有可能的缓冲区,对这些缓冲区的访问进行跟踪,并插入必要的边界检查代码。与已有的方法相比,该方法具有较好的兼容性和性能方面的优势。     

An Argumentation Shell for Supporting the Development and Drafting of Legal Arguments

This article describes an argumentation shell to support the formulation, representation and drafting of legal arguments. The shell can be used to capture generic arguments in many legal domains as well as to assist decision-makers in constructing their own actual arguments . The shell demonstrates that knowledge represented using the generic/actual argument model (GAAM) (a variant of Toulmin's argument structure) can be used to: (a) support the development of complex arguments, (b) add context and increase specificity for the retrieval of relevant documents, (c) incorporate background knowledge, (d) assist in the drafting of documents that represent arguments made, and (e) provide a structure for complex inferences requiring a range of mechanisms. The shell can be used to support decision making in a range of legal domains, including discretionary domains.     

A Graph-Theoretic Approach to Default Logic

A network representation of propositional seminormal disjunction-free default theories is presented, leading to a graph-theoretic approach to their analysis. The problem of finding an extension is proved to be equivalent to that of determining a kernel for a corresponding graph, allowing stronger complexity results as well as new conditions for the existence of extensions.     

基于模糊逻辑的指纹图像对比度增强算法

提出了一种新的基于模糊逻辑的方向纹理对比度增强的方法,对指纹图像进行增强.通过模糊边线判别器在对任一像素点属于边缘的程度进行模糊软判决的同时完成边缘检测,根据计算出的指纹方向图,结合模糊的边缘判新局面器的输出结果，来指导基于方向纹理的指纹图像的对比度增强.实验结果表明这种方法对于质量比较差的指纹图像能明显改善其质量,对于图像的边缘区域，则能够在保持边缘细节的同时滤除噪声。     

The SAT-based Approach to Separation Logic

The SAT-based approach to the decision problem for expressive, decidable, quantifier-free first-order theories has been investigated with remarkable results at least since 1993. One such theory, successfully employed in the formal verification of complex, infinite state systems, is Separation Logic (SL), which combines Boolean logic with arithmetic constraints of the form x − y ⋈ c, where ⋈ is ≤, <, >, ≥, =, or ≠. The SAT-based approach to SL was first proposed and implemented in 1999: the results in terms of performance were good, and since then a number of other systems for SL have appeared. In this paper we focus on the problem of building efficient SAT-based decision procedures for SL. We present the basic procedure and four optimizations that improve dramatically its effectiveness in most cases: (a) IS ₂ preprocessing, (b) early pruning, (c) model reduction, and (d) best reason detection. For each technique we give an example of how it might improve the performance. Furthermore, for the first three techniques, we give a pseudo-code representation and formally state the soundness and completeness of the resulting optimized procedure. We also show how it is possible to check the satisfiability of valuations involving constraints of the form x − y < c using the Bellman–Ford algorithm. Lastly, we present an extensive comparative experimental analysis, showing that our solver TSAT++, built along the lines described in this paper, is currently the state of the art on various classes of problems, including randomly generated, hand-made, and real-world instances.     

约束归纳逻辑程序设计方法的研究

提出了一种新的约束归纳逻辑程序设计方法。该方法能够与自顶向下的归纳逻辑程序设计系统结合,通过在自顶向下归纳方法的一步特殊化操作中引入Fisher判别分析等方法,使得系统能够导出不受变量个数限制的多种形式的线性约束,在不需要用户诱导,不依赖约束求解器的情况下,学习出覆盖正例而排斥负例的含约束的Horn子句程序。     

Towards a Formal Account of Reasoning about Evidence: Argumentation Schemes and Generalisations

This paper studies the modelling of legal reasoning about evidence within general theories of defeasible reasoning and argumentation. In particular, Wigmore's method for charting evidence and its use by modern legal evidence scholars is studied in order to give a formal underpinning in terms of logics for defeasible argumentation. Two notions turn out to be crucial, viz. argumentation schemes and empirical generalisations.     

模糊逻辑系统的遗传算法优化方法

参照模糊逻辑系统的表格查询学习算法,提出了一个切实可行的遗传算法优化方法。仿真结果表明,利用该方法可以在缺乏先验知识的情况下,只需要较少的样本数据,就可以通过评价学习,使优化后的模糊逻辑系统最大程度地拟合原系统的动态特性。     

An Intelligent System to Monitor the Chemical Concentration of Electroplating Process: An Integrated OLAP and Fuzzy Logic Approach

To cope with the issue of ``brain drain' intoday's competitive industrial environment, itis important to capture relevant experience andknowledge in order to sustain the continualgrowth of company business. In this respect,the study in the domain of knowledge learningis of paramount importance in terms ofcapturing and reuse of tacit and explicitknowledge. To support the process of knowledgelearning, a methodology to establish anintelligent system, which consists of bothOn-Line Analytical Processing (OLAP) and fuzzylogic principles, is suggested. This paperattempts to propose this approach forintegrating OLAP and fuzzy logic to form anintelligent system, capitalizing on the meritsand at the same time offsetting the drawbacksof the involved technologies. In this system,the values and positions of related fuzzy setsare modified to suit the industrialenvironment, supporting smoother operation withless error. To validate the feasibility of theproposed system, a case study related to themonitoring of chemical concentration of PCBelectroplating process is covered in thepaper.     

Truth and Consequence: Complementing Logic with Values in Legal Reasoning

In this paper I discuss attempts to model legal reasoning with case precedents. I draw attention to the need to consider not only the factors in a case, but also the social purposes that are served by deciding cases with reference to these factors. I show how considering such purposes allow us to give more predictive power to precedents; to discriminate between arguments advanced on the basis of factors; and to explain how the law can evolve as social attitudes change.     

一种基于模糊逻辑的非线性系统故障检测与定位的方法

针对一般非线性系统,提出了一种带故障标志的系统故障模糊模型,基于此模型给出了一种非线性系统故障检测与定位的新方法,它采用模糊聚类算法提取故障系统的模糊规则,进而完成系统故障的检测与定位,该方法对噪声污染具有较强的抑制作用,对模型误差亦无较高的要求, 仿真结果表明所提方法对非线性系统的故障可以及时地完成检测与定位。     

A Formal Logic Approach to Constrained Combinatorial Testing

Combinatorial testing is as an effective testing technique to reveal failures in a given system, based on input combinations coverage and combinatorial optimization. Combinatorial testing of strength t (t ≥ 2) requires that each t-wise tuple of values of the different system input parameters is covered by at least one test case. Combinatorial test suite generation algorithms aim at producing a test suite covering all the required tuples in a small (possibly minimal) number of test cases, in order to reduce the cost of testing. The most used combinatorial technique is the pairwise testing (t = 2) which requires coverage of all pairs of input values. Constrained combinatorial testing takes also into account constraints over the system parameters, for instance forbidden tuples of inputs, modeling invalid or not realizable input values combinations. In this paper a new approach to combinatorial testing, tightly integrated with formal logic, is presented. In this approach, test predicates are used to formalize combinatorial testing as a logical problem, and an external formal logic tool is applied to solve it. Constraints over the input domain are expressed as logical predicates too, and effectively handled by the same tool. Moreover, inclusion or exclusion of select tuples is supported, allowing the user to customize the test suite layout. The proposed approach is supported by a prototype tool implementation and results of experimental assessment are also presented.