An Order-Sorted Logic with Predicate-Hierarchy, Eventuality and Implicit Negation (Knowledge Management)(Special Issue:Doctorial Theses on Aritifical Intelligence)
スポンサーリンク
概要
- 論文の詳細を見る
Order-sorted logics do not only have rigorous theoretic foundations but also can represent structured information by the sort symbols in a hierarchy, called a sort-hierarchy. This thesis presents the following contributions to the use of order-sorted logic as a knowledge representation language. First, we propose an extended order-sorted logic as a knowledge representation language that possesses both hierarchies of sorts and predicates. This logic must delete and supplement the arguments of each predicate in order to allow it to derive superordinate and subordinate predicates (each with different argument structure) from the other predicates in a predicate-hierarchy (as distinguished from a sort-hierarchy). Thus, we introduce a Horn clause resolution extended to include inference rules of predicate-hierarchy. These rules include the manipulation of arguments in which the supplementary arguments are quantified differently, depending on whether a predicate is interpreted as an occurrence of an event or a universal property. For the extended logic with a distinction between events and properties in predicates, we give a restricted semantic model by interpreting the constraints on predicate-hierarchy and the manipulation of arguments. Furthermore, we prove the soundness and completeness of this Horn-clause resolution with both hierarchies of sorts and predicates. Secondly, we present a hybrid inference system which can deal with the properties of implicitly negative sorts in an assertional knowledge base separated from the sort-hierarchy. This solves the problem of the knowledge base being unable to appropriately use a sort as negative information, despite the fact that sorts with negative meaning may be implicitly included in a sort-hierarchy. These implicit negations, called lexical negations in linguistics, are classified as (i) negative affix or (ii) lexicon with negative meaning. Lexical negations are distinct from the negative particle 'not'. We propose the notions of structured sorts, sort relations, and contradiction in a sort-hierarchy. These can define the relationship between the implicit negations and the classical negation, and can declare the exclusivity and the totality of each negation and its affirmation In this thesis, we present a method of regarding the negative affix as an operator based on strong negation and the lexicon with negative meaning as a sort exclusive to its antonymous sort in the hierarchy. In order to infer from these negations, we combine a structured sort constraint system into a clausal inference system.
- 社団法人人工知能学会の論文
- 2001-11-01
著者
関連論文
- Baader, F., Calvanese, D., McGuinness, D., Nardi, D., and Patel-Schneider P. F., The Description Logic Handbook: Theory, Implementation and Applications, pp. 555, Cambridge University Press, 2003
- An Order-Sorted Logic with Predicate-Hierarchy, Eventuality and Implicit Negation (Knowledge Management)(Special Issue:Doctorial Theses on Aritifical Intelligence)
- RDFとRDFスキーマの推論
- ソートと述語の二つの階層をもつ論理のホーン節計算の完全性
- イベントとプロパティの区別を導入した型階層論理
- 法律知識の事象的/属性的読みを区別した推論システム
- 語彙項目の否定を導入した推論機構
- 述語の型階層と二面性を導入した状況推論システム (&特集>「記号論理とAI」)
- RDFとRDFスキーマの推論