
Kazuko TakahashiKwansei Gakuin University · Department of Informatics
Kazuko Takahashi
About
38
Publications
1,826
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
102
Citations
Introduction
Skills and Expertise
Publications
Publications (38)
This paper discusses how to escape a state in which argumentation can reach no conclusion, by offering a new argument. We formalize our approach based on Dung’s abstract argumentation framework (AF). When an AF has no stable extension, we have no meaningful conclusion. We address the problem of whether it is possible to revise this situation by add...
We develop a method of reasoning using an incrementally constructed bipolar argumentation framework (BAF) aiming to apply computational argumentation to legal reasoning. A BAF that explains the judgment of a certain case is constructed based on the user’s knowledge and recognition. More specifically, a set of effective laws are derived as the concl...
In this paper, we propose a new method for computing general allocators directly from completeness conditions. A general allocator is an abstraction of all complete labelings for an argumentation framework. Any complete labeling is obtained from a general allocator by assigning logical constants to variables. We proved the existence of the general...
We develop a system allowing lawyers and law school students to analyze court judgments. We describe a transformation from the logic programming language PROLEG to a bipolar argumentation framework (BAF) and the legal reasoning involved. Legal knowledge written in a PROLEG program is transformed into a BAF, in which the structure of argumentation i...
We prove the 169 compositions of time interval relations. The proof is first-order and inferred from an axiomatic system on time intervals. We show a general proof template that can alleviate the manual proof with Isar.
We discuss the correspondence of two qualitative spatial representations: PLCA and maptree. They can provide a topological configuration of a space with finer granularity by depicting the construction of a figure using points and lines. We define conversions between these two representations to show that they have the same granularity level of expr...
This paper formalizes a dialogue that includes dishonest arguments in persuasion. We propose a dialogue model that uses a predicted opponent model and define a protocol using this prediction with an abstract argumentation framework. We focus on deception as dishonesty; that is, the case in which an agent hides her knowledge. We define the concepts...
In this paper, we give a formalization of the behavior o the Content-Centric Networking (CCN) protocol with parameterizing conten managements. CCN is a communications architecture that is based o the names of contents, rather than on addresses. In the protocol used i CCN, each node sends packets to the nodes that are connected to it, whic communica...
This paper presents a strategy and conditions for non-failing persuasion using a dialogue model using argumentation. A concept of the predicted knowledge of the other agent participating in the dialogue is introduced. In the dialogue model, an agent’s knowledge is updated as the dialogue proceeds; an argumentation framework is constructed from the...
Content-Centric Networking (CCN) is a communications architecture that is based on the names of contents, rather than on addresses. The protocol used in CCN does not apply to end-to-end communications but is, instead, for network-wide communications. Each node sends packets to the nodes that are connected to it, which communicate with further nodes...
We present a method of superposing rectangles. The superposition is under the condition that some of the regions should be visible. We first define a qualitative spatial representation of the rectangles. In particular, direction relations are used to express the positions of the must-be-visible regions. The representation is extendable to accommoda...
We formalize and verify the superposition of rectangles in Isabelle/HOL. The superposition is associated with the arrangement of rectangular software windows while keeping some regions visible and other hidden. We adopt a qualitative spatial reasoning approach to represent these rectangles and the relations between their regions. The properties of...
Qualitative spatial reasoning (QSR) is a method of representing spatial data by extracting necessary information depending on a user’s purpose, and allowing reasoning on this representation. Although many studies have examined QSR, little work has been carried out from the viewpoint of computational models, which are necessary for practical use in...
PLCA is a framework for qualitative spatial reasoning. It provides a symbolic expression of spatial entities and allows reasoning on this expression. A figure is represented using the objects used to construct it, that is, points, lines, circuits and areas, as well as the relationships between them without numerical data. The figure is identified b...
We present computer-assisted construction of regular polygonal knots by origami. The construction is completed with an automated proof based on algebraic methods. Given a rectangular origami or a finite tape, of an adequate length, we can construct the simplest knot by three folds. The shape of the knot is made to be a regular pentagon if we fasten...
We describe a qualitative representation of the spatial relations between extracted regions of video data, and discuss event occurrence based on this representation.
We use video footage of football games and investigate a formalization to
determine whether an event has occurred, specifically a pass or shot for a goal.
We represent mereological and...
We present computer-assisted construction of reg-ular polygons by knot paper fold. The construction is completed with an automated proof based on algebraic methods. Given a rectangular origami or a finite tape, both of an adequate length, we can construct the simplest knot by making three folds. The shape of the knot is made to be a regular pentago...
Making a knot on a rectangular origami or more generally on a tape of a finite length gives rise to a regular polygon. We present an automated algebraic proof that making two knots leads to a regular heptagon. Knot fold is regarded as a double fold operation coupled with Huzita's fold operations. We specify the construction by describing the geomet...
We discuss a semantics of dynamic creation of arguments when knowledge from different agents are combined. This arises when an agent does not know the other agent's knowledge and therefore, the agent cannot predict which arguments are attacked and which counter-arguments are used in order to attack the arguments. In this paper, we provide a more ge...
This paper presents a semantics for dynamic argumentation frameworks. A dynamic argumentation system involves the concept of execution of an argumentation affecting subsequent arguments. Although such dynamic treatment is necessary to grasp the behavior of actual argumentation, semantics proposed to date can only handle the static aspects. Here, we...
This paper discusses an argumentation system that treats argumentation dynamically. We previously proposed a model for dynamic treatment of argumentation in which all lines of argumentation are executed in succession, with the change of the agent's knowledge base. This system was designed for grasping the behaviour of actual argumentation, but it h...
This paper discusses a process of argumentation. We propose an algorithm for dynamic treatment of argumentation in which all lines of argumentation are executed in succession, and the agent's knowl- edge base can change during argumentation. We show that there exists a case in which an agent dy- namically loses argumentation that would be con- side...
This paper discusses embedding in a two-dimensional plane a symbolic representation for spatial data using the simple objects, points (P), lines (L), circuits (C), and areas (A). We have proposed PLCA as a new framework for a qualitative spatial reasoning. In a PLCA expression, the entire figure is represented in a form in which all the objects are...
We present an extended PLCA that represents the shape of an object qualitatively. PLCA, a framework for qualitative reasoning, is based on the simple components: points(P ), lines(L), circuits(C) and areas(A), and the entire figure is represented as a combination of these components. The en- tire space is considered to be partitioned into disjoint...
This paper describes an algorithm for generating a figure in a two-dimensional plane from a qualitative spatial representation
of PLCA. In general, it is difficult to generate a figure from qualitative spatial representations, since they contain positional
relationships but do not hold quantitative information such as position and size. Therefore,...
This paper aims at an efficient treatment of spatial data using qualitative representation. We propose a new framework called PLCA, which provides a symbolic representation for the figure in a two-dimensional plane, focusing on the connections between regions. It is based on four simple objects: points(P), lines(L), circuits(C) and areas(A). The en...
This paper discusses a routing protocol that uses multi-agents to reduce network congestion for a Mobile Ad hoc NETwork (MANET). MANET is a mul- tihop wireless network in which the network components such as PC, PDA and mobile phones are mobile. The components can communicate with each other without going through a server. Two kinds of agents are e...
An operational semantics of AND- and OR- parallel logic programming language, ANDOR-II, is presented. ANDOR-II combines OR-parallel computation of Prolog and AND-parallel computation of committed choice logic programming languages such as PARLOG, Concurrent Prolog and Guarded Horn Clauses.
Starting from a naive semantics suitable for simulation in...
Parallel programming methodology in GHC is discussed based on our experience in programming a proof procedure of temporal logic. It is said that GHC can express basic constructs of parallel processing such as communication and synchronization very simply, but we have not yet had enough experiences with parallel programming in GHC. By programming a...
We discuss the modeling and veriflcation of marine equipment systems that are implemented on a real-time OS. We construct the framework that provides primary functions, such as tasks with prior- ities, a scheduler, and an interrupt handler. Using this framework, we construct a behavioral model for two modules of simplifled flshflnder, and verify th...
This paper discusses the superposition of qualita-tive rectangles so that some parts are visible and other parts are hidden based on the user's requirements. Qualitative rectangles are rectangles whose size and edge ratios are not fixed. We investigate the conditions under which such a superposition succeeds as well as the manner in which such supe...