Concrete domains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concrete Domains

This paper introduces the theory of a particular kind of computation domains called concrete domains. The purpose of this theory is to nd a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation. Diagrams are emphasized because I believe that an important part of learning lattice theory is the acquisition of skill in drawing diagrams. George Gr atzer 1 ...

متن کامل

Reasoning with Concrete Domains

Description logics are formalisms for the represen­ tation of and reasoning about conceptual knowl­ edge on an abstract level. Concrete domains allow the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals, or spatial regions. The importance of this combined approach, especially for building real-world applications, is widely accepted...

متن کامل

Keys, Nominate, and Concrete Domains

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to "concrete" domains such as numbers and strings. We propose to extend such DLs with key constraints that allow the expression of statements like "US citizens are uniquely identified by their social security number". Based on this idea, we introduce a number of natural description log...

متن کامل

Concrete Domains and Nominals United

While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be PSpace-complete, in this article we show that the combination ALCO(D) of these two logics can have a NExpTime-hard concept satisfiability problem (depending on the concrete domain D used). The proof is by a re...

متن کامل

Hybrid Logics with Concrete Domains

In this paper we present the hybrid logic HLC(@, ↓), an extension of HL(@, ↓), whose models have a concrete domain (such as the natural or real numbers). This logic extends the language of HL(@, ↓) including terms with equality to deal with concrete domain values. Similar languages have already been investigated in other areas like knowledge representation (e.g., description logics with concret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1993

ISSN: 0304-3975

DOI: 10.1016/0304-3975(93)90090-g