Sciweavers

562 search results - page 77 / 113
» A Concurrent Model for Linear Logic
Sort
View
ESWS
2010
Springer
13 years 7 months ago
Modeling and Querying Metadata in the Semantic Sensor Web: The Model stRDF and the Query Language stSPARQL
Abstract. RDF will often be the metadata model of choice in the Semantic Sensor Web. However, RDF can only represent thematic metadata and needs to be extended if we want to model ...
Manolis Koubarakis, Kostis Kyzirakos
LICS
2006
IEEE
14 years 2 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
DIMACS
1996
13 years 10 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
IJCAI
2007
13 years 10 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev