Weaker D-Complete Logics
نویسندگان
چکیده
منابع مشابه
Weaker D-Complete Logics
BB′IW logic (or T→) is known to be D-complete. This paper shows that there are infinitely many weaker D-complete logics and it also examines how certain D-incomplete logics can be made complete by altering their axioms using simple substitutions.
متن کاملComplete Innnitary Type Logics
For each regular cardinal , we set up three systems of innnitary type logic, in which the length of the types and the length of the typed syntactical constructs is <. For a xed , these three versions are (in the order of increasing strength): (1) the local system () , (2) the global system g () (the diierence concerns the conditions on eigenvariables) and (3) the-system () (which has anti-selec...
متن کاملDefinitorially Complete Description Logics
The Terminology Box (TBox) of a Description Logic (DL) knowledge base is used to define new concepts in terms of primitive concepts and relations. The topic of this paper is the effect of the available operations in a DL on the length and the syntactic shape of definitions in a Terminology Box. Defining new concepts can be done in two ways: (1) in an explicit syntactical manner as in NewConcept...
متن کاملStrongly Complete Logics for Coalgebras
Coalgebras for a functor T on a category X model many different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary strongly complete specification languages for Set-based coalgebras. We show how to associate a finitary logic to any finite-sets preserving functor T and prove the logic to be strongly complete under a mild condition on T . The proof i...
متن کاملOptimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T ′ in L . This is an important problem because crucial optimisations in DL reasoners rely on acyclic parts in TBoxes. It is known that such rewritings are possible for definitorial TBoxes in ALC and in logics ALCX for X ⊆ {S,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of IGPL
سال: 1996
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/4.2.215