Sciweavers

2181 search results - page 287 / 437
» Ontologies and Description Logics
Sort
View
DLOG
2008
15 years 8 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
LPAR
2004
Springer
15 years 11 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
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. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
16 years 16 days ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
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...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
IADIS
2009
15 years 4 months ago
Rendezvous-based associations: Language abstractions for robot collaboration
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...
Bent Bruun Kristensen
CORR
2007
Springer
79views Education» more  CORR 2007»
15 years 6 months ago
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
Pascal Tesson, Denis Thérien