Order-sorted logic programming with predicate hierarchy

Kaneiwa, Ken

doi:10.1016/j.artint.2004.05.001

Cited by 27 publications

(17 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ontology properties defined in (Dillion et al 2008) are what we classify in this paper as relation types, relations, type properties and instance properties, and what are termed concept predicates in Order-Sorted Logic (Kaneiwa 2004;Dillion et al 2008) also considers that ''ontology properties are quite close to attributes in object-oriented modeling'' with which our formalism concurs. But our break-down of these ontological properties into different categories permits finer classification of these types of information.…”

Section: Type and Instance Propertiesmentioning

confidence: 65%

“…This assumption is common in ontology formalization, such as in Formal Concept Analysis (Wille 1982;Stumme 2002) and in Order-Sorted Logic (Kaneiwa 2004). This unique infimum, if it does not exist already, could also be created using a technique proposed for ontology merging in (Nguyen and Corbett 2006b) as merging of existing ontologies may initially produce pairs of concept types, each with multiple infima.…”

Section: Types and Instancesmentioning

confidence: 99%

“…6. The new B-rule is the first step to supplement missing arguments in relation and meta-relation types, similarly to the manipulation of predicate arguments in Order-Sorted Logic (Kaneiwa 2004;Nitta 1995). …”

Section: Notesmentioning

confidence: 99%

“…This motivation is similar to that described in (Kaneiwa 2004). For example, in the justice arena we may wish to have a system that can automatically answer questions like the following: ''Knowing only that John's father is in jail, does John have a Police record and is he being monitored by a welfare agency?''…”

Section: Introductionmentioning

confidence: 99%

“…Independently from the above, a formalization of ontology based on Order-Sorted Logic has also been proposed (Cohn 1989;Kaneiwa 2004), and one of its applications to upper event ontology has been presented (Kaneiwa et al 2007). In this logic, an ontology is represented by a ''sort hierarchy'' and a ''predicate hierarchy''.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Meta-relation and ontology closure in Conceptual Structure Theory

et al. 2009

Self Cite

View full text Add to dashboard Cite

This paper presents an enhanced ontology formalization, combining previous work in Conceptual Structure Theory and Order-Sorted Logic. Most existing ontology formalisms place greater importance on concept types, but in this paper we focus on relation types, which are in essence predicates on concept types. We formalize the notion of 'predicate of predicates' as meta-relation type and introduce the new hierarchy of meta-relation types as part of the ontology definition. The new notion of closure of a relation or meta-relation type is presented as a means to complete that relation or meta-relation type by transferring extra arguments and properties from other related types. The end result is an expanded ontology, called the closure of the original ontology, on which automated inference could be more easily performed. Our proposal could be viewed as a novel and improved ontology formalization within Conceptual Structure Theory and a contribution to knowledge representation and formal reasoning (e.g., to build a query-answering system for legal knowledge).

show abstract

Section: Type and Instance Propertiesmentioning

confidence: 65%

Section: Types and Instancesmentioning

confidence: 99%

Section: Notesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Meta-relation and ontology closure in Conceptual Structure Theory

et al. 2009

Self Cite

View full text Add to dashboard Cite

show abstract

Conceptual modeling in full computation-tree logic with sequence modal operator

Kaneiwa

Kamide

2011

Int. J. Intell. Syst.

Self Cite

View full text Add to dashboard Cite

In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS * , is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS * are applied to tree structures. We prove a theorem for embedding CTLS * into CTL * . The validity, satisfiability, and model-checking problems of CTLS * are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS

show abstract

An Order-Sorted Quantified Modal Logic for Meta-ontology

Kaneiwa

Mizoguchi

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Order-sorted logic programming with predicate hierarchy

Cited by 27 publications

References 19 publications

Meta-relation and ontology closure in Conceptual Structure Theory

Meta-relation and ontology closure in Conceptual Structure Theory

Conceptual modeling in full computation-tree logic with sequence modal operator

An Order-Sorted Quantified Modal Logic for Meta-ontology

Contact Info

Product

Resources

About