Sciweavers

1966 search results - page 25 / 394
» Description Logics and Planning
Sort
View
125
Voted
TIME
2007
IEEE
15 years 8 months ago
Temporalising Tractable Description Logics
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
139
Voted
AAAI
2006
15 years 3 months ago
Finding Maximally Satisfiable Terminologies for the Description Logic ALC
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
Thomas Andreas Meyer, Kevin Lee, Richard Booth, Je...
CORR
2010
Springer
123views Education» more  CORR 2010»
15 years 2 months ago
Loop Formulas for Description Logic Programs
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Sh...
AI
2010
Springer
15 years 2 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
120
Voted
FUZZIEEE
2007
IEEE
15 years 8 months ago
A Fuzzy Description Logic with Product T-norm
— Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. It is well known that the choice of the fuzzy operat...
Fernando Bobillo, Umberto Straccia