Sciweavers

1151 search results - page 80 / 231
» Collaborative Programming: Applications of Logic and Automat...
Sort
View
135
Voted
FLOPS
1999
Springer
15 years 7 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
150
Voted
AGP
2003
IEEE
15 years 8 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
15 years 7 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
GIS
2004
ACM
16 years 4 months ago
Capturing complex multidimensional data in location-based data warehouses
Motivated by the increasing need to handle complex multidimensional data in location-based data warehouses, this paper proposes a powerful data model that is able to capture the c...
Igor Timko, Torben Bach Pedersen
230
Voted
ICLP
2009
Springer
16 years 4 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...