1545 search results - page 172 / 309 » Defeasible Description Logics |
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
SAS
2007
Springer
14 years 2 months ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
Recent advances in e-learning techonologies and web services make realistic the idea that courseware for personalized e-learning can be built by dynamic composition of distributed ...
OWLED
2007
13 years 9 months ago
2007
This analysis is to identify requirements for a Description Logic (DL) to reason about product descriptions and other information related to product development. The DL is intended...
IADIS
2009
13 years 5 months ago
2009
IONS FOR ROBOT COLLABORATION Bent Bruun Kristensen Maersk Mc-Kinney Moller Institute, University of Southern Denmark Campusvej 55, DK-5230, Odense M, Denmark Collaboration between...