Norihiro Ogata

A Formal Ontology Discovery from Web Documents

This paper defines a framework of formal ontology that is compatible with domain-specificity that Web documents has, and natural language structures. Furthermore, this paper investigates how to extract information about the formal ontology of the domain written in Web documents based on logics, Web technology such as XML and natural language processing.

A dynamic semantics of modal subordination

This paper will propose a dynamic semantics of quantified modal logic based on the theory of System Transition Systems, which are abstract objects modeling “Kripke models of Kripke models” or graph rewriting systems, by exlpoiting the theory of coalgebras in order to treat modal subordination as a Kripke model change, which requires no ad-hoc informal treatment such as accomodation as in [1] or extra-ontology introduced in [2] [3].

What Do You Mean by “What Do You Mean”?

This paper investigates dynamic semantics of conversations from the point of view of semantical closedness, presuppositions and shared belief/common knowledge updates, by analysing the meta-expression “what do you mean (by X)?” into three major usages: semantic repair initiation, intentional repair initiation, and inferential repair initiation, since these three usages are deeply related to three types of semantical closedness: closedness of denotations, closedness of intention and closedness of inference of conversations. As a result, the proposed dynamic semantics of conversations is semantically closed in terms of shared beliefs of the conversants.

Towards Computational Non-associative Lambek Lambda-Calculi for Formal Pragmatics

This paper will propose a new “mathematical foundation” for formal pragmatics, based on Non-associative Lambek Lambda Calculi (Wansing 1993; Buszkowski 1987, 1997) which are enhanced by substructural modalities \(\underset{\{s\}}{!}\) for each substructurality \(s\) (Jacobs 1994; Morrill 1994), computational monads \(\mathcal {T}\) as in Computational Lambda Calculi (Moggi 1991; Benton 1995; Benton and Wadler 1996; Goubault-Larrecq et al. 2008), and new type constructor Open image in new window for each \(\alpha \)-position. I will show that the resulting system, called the Computational Lambek \(\alpha \lambda \)-Calculus (\(\lambda _{c\alpha \odot !}\)), is enough to treat formal pragmatics including information structures, underspecification, and communicative interactions.

A dynamic semantics of intentional identity

This paper will propose a new version of Dynamic Modal Predicate Logic (DMPL) to treat dynamics of intentional identity [1] and other similar notions such as weak intentional identity and multiple intentional identity by revising the DMPL of modal subordination [2] by adding a kind of counterpart relation. The revised dynamic semantics of DMPL is much simpler than Edelbergs semantics [3] of intentional identity and can treat weak intentional identity and multiple intentional identity which have not been treated by most semantics of intentional identity as well as Edelbergs semantics.

Dynamic Semantics of Plurals DPLQ

Abstract This paper proposes a dynamic semantics of plurals, DPL ⊛ Q , that is an extension of DPL [8] by adding binary generalized quantifiers, plural terms with join-operators as in Link [17]s semilattice semantics of plurals, dynamic selectors, dynamic distributors and division functions. DPL ⊛ Q provides a formalism for handling dependent plurals, bound plurals, generic plurals, and ambiguity of collective/distributive/cumulative interpretation of plurals.

A Revision System of Circular Objects and Its Applications to Dynamic Semantics of Dialogues

Since Peter Aczels theory[1] of hypersets, many applications to formalizations of a circular object such as a mutual belief has been proposed [3,2,5]. This paper will propose Membership Description Systems (MDSs), a partial revision system of circular objects and their applications to a dynamic semantics of a dialogue in the sense that a dialogue can be considered as a revision process of mutual beliefs between its agents. Although usual dynamic semantics [10] updates a variable assignment or a set of information states, our proposal of a semantics of dialogues directly updates situations, which is specified by MDSs, as dynamic semantics of circular propositions [11] directly updates situations. Furthermore, using MDSs as updated objects in the semantics makes a partial and direct update of circular situations themselves possible. As a result, a dynamic semantics of a language with the ↓-operator, which is introduced by [3] to describe circular propositions, can be provided.

Dynamic semantics of quantified modal mu-calculi and its applications to modelling public referents, speaker's referents, and semantic referents

A generalized QG-semantics of Quantified Modal Logics (QMLs) is proposed by exploiting Goldblatt & Marefs [30] Quantified General Frame semantics of QMLs to solve the Kripke-imcompleteness problem with some QMLs. It is extended by adding formulas of modal mu-calculi to model speakers referents and public referents. Furthermore, dynamic semantics of a quantified modal mu-calculus is formalized based on the generalized QG-semantics.

Dynamic predicate logic of dependent questions and answers

In the progress of formal semantics of natural language, one of the main themes is formal semantics of questions and answers.

Formal Semantics of Acknowledgements, Agreements and Disagreements

Acknowledgements, agreements, and disgreements are basic moves in communications among agents, since the moves form and revise shared information among the agents which is basic prerequisite of group-actions.Th is paper investigates formal semantics of the moves from the point of view of information sharing among agents, exploiting the circular objects assured by Hyperset Theory.Th erefore, avoiding definitions of shared information by infinite conjunctions of propositions with nested epistemic modalities, the actions are all interpreted as one-step (not infinite many step) formations of shared information by corecursive definitions.As a result, we can provide a structure of inference between the actions, and define a process equivalence of dialogues with respect to their resulting shared information.