-
1
-
-
84880804628
-
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles
-
F. Baader, 'Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles', in IJCAI 2003, pp. 319-324, (2003).
-
(2003)
IJCAI 2003
, pp. 319-324
-
-
Baader, F.1
-
2
-
-
0005410668
-
Rewriting concepts using terminologies
-
F. Baader, R. Küsters, and R. Molitor, 'Rewriting concepts using terminologies', in KR 2000, pp. 297-308, (2000).
-
(2000)
KR 2000
, pp. 297-308
-
-
Baader, F.1
Küsters, R.2
Molitor, R.3
-
3
-
-
0043241024
-
Unification of concept terms in description logics
-
F. Baader and P. Narendran, 'Unification of concept terms in description logics', J. of Symbolic Computation, 31, 277-305, (2001).
-
(2001)
J. of Symbolic Computation
, vol.31
, pp. 277-305
-
-
Baader, F.1
Narendran, P.2
-
4
-
-
67650493147
-
Usability issues in description logic knowledge base completion
-
F. Baader and B. Sertkaya, 'Usability issues in description logic knowledge base completion', in ICFCA-2009, pp. 1-21, (2009).
-
(2009)
ICFCA-2009
, pp. 1-21
-
-
Baader, F.1
Sertkaya, B.2
-
5
-
-
34248668998
-
Computing the least common subsumer w.r.t. a background terminology
-
F. Baader, B. Sertkaya, and A.-Y. Turhan, 'Computing the least common subsumer w.r.t. a background terminology', J. of Applied Logic, 5(3), 392-420, (2007).
-
(2007)
J. of Applied Logic
, vol.5
, Issue.3
, pp. 392-420
-
-
Baader, F.1
Sertkaya, B.2
Turhan, A.-Y.3
-
6
-
-
77956996791
-
Complexity of abduction in the EL family of lightweight description logics
-
M. Bienvenu, 'Complexity of abduction in the EL family of lightweight description logics', in KR 2008, pp. 220-230, (2008).
-
(2008)
KR 2008
, pp. 220-230
-
-
Bienvenu, M.1
-
7
-
-
38049101182
-
Towards measuring similarity in description logics
-
A. Borgida, T. Walsh, and H. Hirsh, 'Towards measuring similarity in description logics', in DL 2005, (2005).
-
(2005)
DL 2005
-
-
Borgida, A.1
Walsh, T.2
Hirsh, H.3
-
8
-
-
0002921593
-
On a decision method in restricted second order arithmetic
-
eds., E. Nagel et al. Stanford University Press
-
J. R. Büchi, 'On a decision method in restricted second order arithmetic', in Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science, eds., E. Nagel et al., pp. 1-11. Stanford University Press, (1960).
-
(1960)
Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science
, pp. 1-11
-
-
Büchi, J.R.1
-
9
-
-
0026971891
-
Computing least common subsumers in description logics
-
eds., P. Rosenbloom and P. Szolovits. AAAI Press
-
W. Cohen, A. Borgida, and H. Hirsh, 'Computing least common subsumers in description logics', in AAAI'92, eds., P. Rosenbloom and P. Szolovits, pp. 754-761, (1992). AAAI Press.
-
(1992)
AAAI'92
, pp. 754-761
-
-
Cohen, W.1
Borgida, A.2
Hirsh, H.3
-
10
-
-
34748816191
-
Semantic matchmaking as non-monotonic reasoning: A description logic approach
-
T. Di Noia, E. Di Sciascio, and F. M. Donini, 'Semantic matchmaking as non-monotonic reasoning: A description logic approach', J. of Artif. Intell. Res., 29, 269-307, (2007).
-
(2007)
J. of Artif. Intell. Res.
, vol.29
, pp. 269-307
-
-
Noia, D.T.1
Sciascio, D.E.2
Donini, F.M.3
-
11
-
-
80055038931
-
Abductive matchmaking using description logics
-
T. Di Noia, E. Di Sciascio, F. M. Donini, and M. Mongiello, 'Abductive matchmaking using description logics', in IJCAI 2003, pp. 337-342, (2003).
-
(2003)
IJCAI 2003
, pp. 337-342
-
-
Noia, D.T.1
Sciascio, D.E.2
Donini, F.M.3
Mongiello, M.4
-
12
-
-
77956029138
-
A tableauxbased method for computing least common subsumers for expressive description logics
-
F. M. Donini, S. Colucci, T. Di Noia, and E. Di Sciascio, 'A tableauxbased method for computing least common subsumers for expressive description logics', in IJCAI 2009, pp. 739-745, (2009).
-
(2009)
IJCAI 2009
, pp. 739-745
-
-
Donini, F.M.1
Colucci, S.2
Noia, D.T.3
Sciascio, D.E.4
-
15
-
-
0002785435
-
Completeness in the theory of types
-
L. Henkin, 'Completeness in the theory of types', J. of Symbolic Logic, 15(2), 81-91, (1950).
-
(1950)
J. of Symbolic Logic
, vol.15
, Issue.2
, pp. 81-91
-
-
Henkin, L.1
-
16
-
-
0007904166
-
Practical reasoning for very expressive description logics
-
I. Horrocks, U. Sattler, and S. Tobies, 'Practical reasoning for very expressive description logics', Logic J. of the IGPL, 8(3), (2000).
-
(2000)
Logic J. of the IGPL
, vol.8
, Issue.3
-
-
Horrocks, I.1
Sattler, U.2
Tobies, S.3
-
17
-
-
78751681051
-
Forgetting and uniform interpolation in large-scale description logic terminologies
-
B. Konev, D.Walther, and F.Wolter, 'Forgetting and uniform interpolation in large-scale description logic terminologies', in IJCAI 2009, pp. 830-835, (2009).
-
(2009)
IJCAI 2009
, pp. 830-835
-
-
Konev, B.1
Walther, D.2
Wolter, F.3
-
18
-
-
46849086186
-
Applying abduction in semantic web service composition
-
F. Ĺecúe, A. Delteil, and A. Ĺeger, 'Applying abduction in semantic web service composition', in ICWS 2007, pp. 94-101, (2007).
-
(2007)
ICWS 2007
, pp. 94-101
-
-
Ĺecúe, F.1
Delteil, A.2
Ĺeger, A.3
-
19
-
-
0347016437
-
Explaining subsumption in description logics
-
D. L. McGuinness and A. Borgida, 'Explaining subsumption in description logics', in IJCAI'95, pp. 816-821, (1995).
-
(1995)
IJCAI'95
, pp. 816-821
-
-
McGuinness, D.L.1
Borgida, A.2
-
20
-
-
77956015079
-
Formalizing multimedia interpretation based on abduction over description logic aboxes
-
I. S. E. Peraldi, A. Kaya, and R. Möller, 'Formalizing multimedia interpretation based on abduction over description logic aboxes', in DL 2009, (2009).
-
(2009)
DL 2009
-
-
Peraldi, I.S.E.1
Kaya, A.2
Möller, R.3
-
21
-
-
84968501436
-
Decidability of second-order theories and automata on infinite trees
-
M. O. Rabin, 'Decidability of second-order theories and automata on infinite trees', Trans. of the Am. Math. Society, 141, 1-35, (1969).
-
(1969)
Trans. of the Am. Math. Society
, vol.141
, pp. 1-35
-
-
Rabin, M.O.1
-
22
-
-
49949106453
-
OWL-DL as a power tool to model negotiation mechanisms with incomplete information
-
A. Ragone, 'OWL-DL as a power tool to model negotiation mechanisms with incomplete information', in ISWC/ASWC 2007, pp. 941- 945, (2007).
-
(2007)
ISWC/ASWC 2007
, pp. 941-945
-
-
Ragone, A.1
-
23
-
-
70350460014
-
Weighted description logics preference formulas for multiattribute negotiation
-
LNAI, Springer-Verlag
-
A. Ragone, T. Di Noia, F. M. Donini, E. Di Sciascio, and M. Wellman, 'Weighted description logics preference formulas for multiattribute negotiation', in SUM'09, LNAI, Springer-Verlag, (2009).
-
(2009)
SUM'09
-
-
Ragone, A.1
Noia, D.T.2
Donini, F.M.3
Sciascio, D.E.4
Wellman, M.5
-
24
-
-
22944434247
-
Explaining subsumption by optimal interpolation
-
S. Schlobach, 'Explaining subsumption by optimal interpolation', in JELIA 2004, pp. 413-425, (2004).
-
(2004)
JELIA 2004
, pp. 413-425
-
-
Schlobach, S.1
-
25
-
-
77049128418
-
Effective query rewriting with ontologies over dboxes
-
I. Seylan, E. Franconi, and J. de Bruijn, 'Effective query rewriting with ontologies over dboxes', in IJCAI 2009, pp. 923-925, (2009).
-
(2009)
IJCAI 2009
, pp. 923-925
-
-
Seylan, I.1
Franconi, E.2
De Bruijn, J.3
-
26
-
-
22944480448
-
Making the difference: A subtraction operation for description logics
-
G. Teege, 'Making the difference: A subtraction operation for description logics', in KR'94, pp. 540-550, (1994).
-
(1994)
KR'94
, pp. 540-550
-
-
Teege, G.1
-
28
-
-
0035733098
-
Second-order logic and foundations of mathematics
-
J. Väänänen, 'Second-order logic and foundations of mathematics', The Bulletin of Symbolic Logic, 7(4), 504-520, (2001).
-
(2001)
The Bulletin of Symbolic Logic
, vol.7
, Issue.4
, pp. 504-520
-
-
Väänänen, J.1
-
29
-
-
51149098126
-
Undecidability of the unification and admissibility problems for modal and description logics
-
F.Wolter and M. Zakharyaschev, 'Undecidability of the unification and admissibility problems for modal and description logics', ACM Trans. on Computational Logic, 9, (2008).
-
(2008)
ACM Trans. on Computational Logic
, vol.9
-
-
Wolter, F.1
Zakharyaschev, M.2
|