• Aucun résultat trouvé

Description Logic and Order-sorted Logic

N/A
N/A
Protected

Academic year: 2022

Partager "Description Logic and Order-sorted Logic"

Copied!
1
0
0

Texte intégral

(1)

Description Logic and Order-sorted Logic

Ken Kaneiwa

National Institute of Informatics, Japan kaneiwa@nii.ac.jp

I have been studying the following work on description logic, which is closely related to my main work on extensions of order-sorted logic and logic program- ming [4, 3, 2].

Title: Negation in Description Logics: Contraries, Contradictories and Sub- contraries (under submission)

Abstract: We propose an alternative description logic ALC with classical negation and strong negation. In particular, we adhere to the notions of con- traries, contradictories and subcontraries [1], generated from possible statement types using predicate denial and predicate term negation. To capture these no- tions, our formalization provides an improved semantics that suitably interprets various combinations of classical negation and strong negation (but not Heyt- ing negation and strong negation). We develop a tableau-based satisfiability algorithm for ALC, and show the correctness: soundness, completeness and termination and the complexity.

References

[1] L. R. Horn. A Natural History of Negation. University of Chicago Press, 1989.

[2] K. Kaneiwa. Order-sorted logic programming with predicate hierarchy. Ar- tificial Intelligence, 2004 (accepted).

[3] K. Kaneiwa and R. Mizoguchi. Ontological knowledge base reasoning with sort-hierarchy and rigidity. In Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR2004), 2004.

[4] K. Kaneiwa and S. Tojo. An order-sorted resolution with implicitly negative sorts. In Proceedings of the 2001 Int. Conf. on Logic Programming, pages 300–314. Springer-Verlag, 2001. LNCS 2237.

Références

Documents relatifs

The inhabitation problem for intersection types has been proved to be undecidable, but breaking the idempotency of intersection types makes

Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic... Simple proof of the completeness

We build on this structure to make predicate transformers into a de- notational model of full linear logic: all the logical constructions have a natural interpretation in terms

For example, intuitionistic logic was developed to rid (classical) logic of certain logical principles and model checking

Thus, while in the cases in which atomic (mostly semantic) types are constructed through distributional properties the logical dependencies between them are hardly addressed as

In the context of order theory, it amounts to taking: interpolant category to partial orders: if F is a closure operator on X , take E(X, F ) to be the the collection of fixed

In the case of the I-frame, the utility function is derived with respect to the individual contribution d i , and in the We-frame, all individual contributions d j are equal

Skolemization of a formula is carried out by repeatedly performing Skolemiza- tion steps till all the existential (resp., universal) quantifiers occurring positively (resp.,