4211 search results - page 704 / 843 » A formal approach to MASQ |
160
click to vote
PPDP
2007
Springer
16 years 17 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
159
click to vote
SEMWEB
2007
Springer
16 years 17 days ago
2007
Springer
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
150
click to vote
SEMWEB
2007
Springer
16 years 17 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
197
click to vote
TABLEAUX
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
167
click to vote
WEBI
2007
Springer
16 years 17 days ago
2007
Springer
The size of the Web and its increase rate made it cumbersome to locate high precision results to a requested piece of information. The Semantic Web provides a framework and a set ...