3793 search results - page 307 / 759 » Expressive Description Logics |
184
click to vote
LPAR
2004
Springer
16 years 3 days 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. ...
179
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...
182
click to vote
ICCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
169
click to vote
SAS
2007
Springer
16 years 25 days 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...
179
click to vote
ESWS
2005
Springer
16 years 8 days 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 ...