A Carneades reconstruction of Popov v Hayashi

Carneades is an open source argument mapping application and a programming library for building argumentation support tools. In this paper, Carneades?? support for argument reconstruction, evaluation and visualization is illustrated by modeling most of the factual and legal arguments in Popov v Hayashi.     

Representing Popov v Hayashi with dimensions and factors

Modelling reasoning with legal cases has been a central concern of AI and Law since the 1980s. The approach which represents cases as factors and dimensions has been a central part of that work. In this paper I consider how several varieties of the approach can be applied to the interesting case of Popov v Hayashi. After briefly reviewing some of the key landmarks of the approach, the case is represented in terms of factors and dimensions, and further explored using theory construction and argumentation schemes approaches.     

An ontology in OWL for legal case-based reasoning

The paper gives ontologies in the Web Ontology Language (OWL) for Legal Case-based Reasoning (LCBR) systems, giving explicit, formal, and general specifications of a conceptualisation LCBR. Ontologies for different systems allows comparison and contrast between them. OWL ontologies are standardised, machine-readable formats that support automated processing with Semantic Web applications. Intermediate concepts, concepts between base-level concepts and higher level concepts, are central in LCBR. The main issues and their relevance to ontological reasoning and to LCBR are discussed. Two LCBR systems (AS-CATO, which is based on CATO, and IBP) are analysed in terms of basic and intermediate concepts. Central components of the OWL ontologies for these systems are presented, pointing out differences and similarities. The main novelty of the paper is the ontological analysis and representation in OWL of LCBR systems. The paper also emphasises the important issues concerning the representation and reasoning of intermediate concepts.

Reconstructing Popov v. Hayashi in a framework for argumentation with structured arguments and Dungean semantics

In this article the argumentation structure of the court??s decision in the Popov v. Hayashi case is formalised in Prakken??s (Argument Comput 1:93?C124; 2010) abstract framework for argument-based inference with structured arguments. In this framework, arguments are inference trees formed by applying two kinds of inference rules, strict and defeasible rules. Arguments can be attacked in three ways: attacking a premise, attacking a conclusion and attacking an inference. To resolve such conflicts, preferences may be used, which leads to three corresponding kinds of defeat, after which Dung??s (Artif Intell 77:321?C357; 1995) abstract acceptability semantics can be used to evaluate the arguments. In the present paper the abstract framework is instantiated with strict inference rules corresponding to first-order logic and with defeasible inference rules for defeasible modus ponens and various argument schemes. The main techniques used in the formal reconstruction of the case are rule-exception structures and arguments about rule validity. Arguments about socio-legal values and the use of precedent cases are reduced to arguments about rule validity. The tree structure of arguments, with explicit subargument relations between arguments, is used to capture the dependency relations between the elements of the court??s decision.     

一种OWL本体进化方法*

针对从关系数据库模式学习所得的OWL本体大都是轻量级的,其概念层次结构过于扁平,很难被直接用于实际的本体应用,提出一种新颖的OWL本体进化方法。其通过形式概念分析对已有轻量级OWL本体进行概念聚类,根据概念等同度、概念包含度计算,自动提出丰富、修改本体概念语义关系的建议,从而辅助设计者实现本体进化。该方法将FCA与相似度计算结合使用,既发挥FCA语义强度较高的特点,又发挥相似度计算执行效率高且容易实现的特点;同时,规避了相似度计算语义强度较低与FCA实现较为困难且执行效率较低的不足。一个实例结果的评估证实     

OWL本体存储技术研究

对本体的存储介质研究的基础上,深入研究本体在关系数据库中的存储模式,指出当前各种本体存储模式的不足之处,提出了新的基于关系数据库的混合存储模式.用教育领域本体测试框架对所提出的存储模式进行实验验证.实验结果表明,设计的基于关系数据库的存储模式具有结构清楚、查询效率高和扩展性能强的优点.用新的混合存储模式要比目前广泛使用...     

非一致OWL本体的推理方法研究

针对目前OWL推理机无法在非一致本体上进行推理的问题,提出了一种基于回答集程序的非一致本体推理方式,将OWL本体翻译为一类逻辑程序：HEX回答集程序,把本体推理问题规约为回答集程序求解问题。并通过在非一致本体上的推理实验,验证了该类方法的有效性。     

从文本自动构建OWL本体的研究

随着语义检索的发展,近年来涌现了许多基于本体的研究和应用,但本体本身仍离不开领域专家手工或半自动化的构建,成为了本体研究领域的一个瓶颈。因此,本文着眼于本体的自动化构建,提出了一种用FCA(形式概念分析)从文本中提取并自动生成符合W3C标准的OWL通用本体库的方法。解决了目前本体构建自动化程度低,领域依赖性强的问题,使得本体的发展和应用不再是空中楼阁。     

基于BaseX数据库的OWL本体存储查询研究

针对目前基于关系型数据库等存储模式的本体存储查询效率较低的情况,提出使用XML数据库BaseX进行本体的存储,并设计了相应的本体存储查询架构。在对BaseX存储结构与接口的研究基础上,实现对OWL本体的存储。利用BaseX的查询接口和XQuery查询语言对OWL本体进行检索,在建立推理规则库基础上,实现本体查询扩展与推理。实验将提出的存储查询方法与基于关系型数据库的存储查询方法进行对比,验证了提出的方法具备高效的存储查询性能,同时具备本体查询的推理能力。     

基于OWL的制药企业本体的构建及应用

本体是共享概念模型的明确的形式化规范说明,通过概念之间的关系来描述概念的语义。药业本体是制药企业中或企业间公共的知识化的描述,不仅可以促进制药企业知识的重用和共享,还大大方便了制药企业内部以及企业间知识管理和信息交换。本文讨论了本体的概念,介绍了本体的构建原则和方法,以及各种本体表示语言,着重介绍了OWL本体语言,分析了药业本体应用领域,给出了一个简单的基于OWL的本体示例片段,最后简单介绍了本体编辑工具protege2000及其使用方法。     

Efficient management and storage of a multiversion OWL 2 DL domain ontology

Ontology is the chief technology to model domain knowledge and fix its heterogeneity. Knowledge evolution is unavoidable in all fields, and ontology should reflect such an evolution while preserving its consistency. The access to an ontology evolution history is also a crucial need. Thereby, ontology versions should be stored efficiently. To address these requirements, some works focused only on managing ontology inconsistency. To this end, they adopted an a posteriori approach that checks inconsistency after its occurrence. Others have mainly focused on some ontology versioning aspects other than the storage and the consistency preservation issues. Specifically, the state of the art storage strategies perform well some typical queries at the cost of a high storage space. Strategies with low space overhead lose the main specificity of ontology: the knowledge semantics modelling. So, it is useful to address all these shortcomings. This paper presents an approach that allows generating consistent OWL 2 DL ontology versions in a priori way. It also proposes an efficient storage strategy that preserves the semantics aspect of ontology and performs well typical queries with a low storage space. A protégé plug‐in is developed to show the feasibility of the main ideas presented in this paper.     

A crowdsourcing approach to building a legal ontology from text

This article focuses on the problems of application of artificial intelligence to represent legal knowledge. The volume of legal knowledge used in practice is unusually large, and therefore the ontological knowledge representation is proposed to be used for semantic analysis, presentation and use of common vocabulary, and knowledge integration of problem domain. At the same time some features of legal knowledge representation in Ukraine have been taken into account. The software package has been developed to work with the ontology. The main features of the program complex, which has a Web-based interface and supports multi-user filling of the knowledge base, have been described. The crowdsourcing method is due to be used for filling the knowledge base of legal information. The success of this method is explained by the self-organization principle of information. However, as a result of such collective work a number of errors are identified, which are distributed throughout the structure of the ontology. The results of application of this program complex are discussed in the end of the article and the ways of improvement of the considered technique are planned.     

P2P case storage and retrieval with an unspecified ontology

Traditional approaches for similarity-based retrieval of structured data, such as Case-Based Reasoning (CBR), have been largely implemented using centralized storage systems. In such systems, when the cases contain both numeric and free-text attributes, similarity-based retrieval cannot exploit standard speedup techniques based on multi-dimensional indexing, and the retrieval is implemented by an exhaustive comparison of the case to be solved with the whole set of stored cases. In this work, we review current research on Peer-to-Peer (P2P) and distributed CBR techniques and propose a novel approach for storage of the case-base in a decentralized Peer-to-Peer environment using the notion of Unspecified Ontology to improve the performance of the case retrieval stage and build CBR systems that can scale up to large case-bases. We develop an algorithm for efficient retrieval of approximated most-similar cases, which exploits inherent characteristics of the unspecified ontology in order to improve the performance of the case retrieval stage in the CBR problem solving cycle. The experiments show that the algorithm successfully retrieves cases close to the most-similar cases, while reducing the number of cases to be compared. Hence, it improves the performance of the retrieval stage. Moreover, the distributed nature of our approach eliminates the computational bottleneck and single point of failure of the centralized storage systems.     

A K-way spectral partitioning of an ontology for ontology matching

Ontology matching, the process of resolving heterogeneity between two ontologies consumes a lot of computing memory and time. This problem is exacerbated in large ontology matching tasks. To address the problem of time and space complexity in the matching process, ontology partitioning has been adopted as one of the methods, however, most ontology partitioning algorithms either produce incomplete partitions or are slow in the partitioning process hence eroding the benefits of the partitioning. In this paper, we demonstrate that spectral partitioning of an ontology can generate high quality partitions geared towards ontology matching.     

基于OWL本体和SWRL规则的导弹智能故障诊断研究

针对复杂航空装备诊断知识缺乏、诊断效率低和知识共享性差等问题,以某型红外弹为例,提出一种基于OWL本体和SWRL规则的导弹智能故障诊断方法。首先以导弹FMECA结果作为知识源,通过基于ATML语法的OWL逻辑描述语言建立导弹本体模型,完成故障模式和故障原因本体之间的映射;其次采用语义网络规则语言SWRL描述知识库规则,建立本体知识单元之间类、属性和实例的对应关系,最后通过Racer推理机对导弹知识库进行故障诊断推理,获取故障诊断优先级顺序。推理结果表明,该方法能够解决复杂航空装备专家诊断系统中的知识表示困难、缺乏自动语义推理、重用共享性差等问题,获得最优的故障诊断路径的同时减少了故障排查步骤,从而实现了故障原因的快速定位,提高了复杂航空装备专家诊断系统的诊断效率和可靠性。     

Towards an ontology modeling tool. A validation in software engineering scenarios

Ontology creation and management related processes are very important to define and develop semantic services. Ontology Engineering is the research field that provides the mechanisms to manage the life cycle of the ontologies. However, the process of building ontologies can be tedious and sometimes exhaustive. OWL-VisMod is a tool designed for developing ontological engineering based on visual analytics conceptual modeling for OWL ontologies life cycle management, supporting both creation and understanding tasks. This paper is devoted to evaluate OWL-VisMod through a set of defined tasks. The same tasks also will be done with the most known tool in Ontology Engineering, Protégé, in order to compare the obtained results and be able to know how is OWL-VisMod perceived for the expert users. The comparison shows that both tools have similar acceptation scores, but OWL-VisMod presents better feelings regarding user’s perception tasks due to the visual analytics influence.