1545 search results - page 172 / 309 » Defeasible Description Logics |
147
click to vote
LPAR
2004
Springer
15 years 9 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. ...
127
click to vote
SAS
2007
Springer
15 years 10 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...
135
click to vote
ESWS
2005
Springer
15 years 9 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 ...
139
click to vote
OWLED
2007
15 years 5 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...
148
click to vote
IADIS
2009
15 years 1 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...