1-2hit |
Ken KANEIWA Riichiro MIZOGUCHI
This paper proposes a new semantics that characterizes the time and/or situation dependencies of properties, together with the ontological notion of existential rigidity. For this purpose, we present order-sorted tempo-situational logic (OSTSL) with rigid/anti-rigid sorts and an existential predicate. In this logic, rigid/anti-rigid sorted terms enable the expressions for sortal properties, and temporal and situational operators suitably represent the ontological axioms of existential rigidity and time and/or situation dependencies. A specific semantics of OSTSL adheres to the temporal and situational behaviors of properties based on existential rigidity. As a result, the semantics guarantees that the ontological axioms of properties expressed by sorted tempo-situational formulas are logically valid.
Bikash Chandra GHOSH Vilas WUWONGSE
Conceptual graph formalism is a knowledge representation language in AI based on a graphical form of logic. Although logic is the basis of the conceptual graph theory, there is a strongly felt absence of a formal treatment of conceptual graphs as a logic programming language. In this paper, we develop the notion of a conceptual graph program as a kind of graph-based order-sorted logic program. First, we define the syntax of the conceptual graph program by specifying its major syntactic elements. Then, we develop a kind of model theoretic semantics and fixpoint semantics of the conceptual graph program. Finally, we show that the two types of semantics coincide for the conceptual graph programs.