Sciweavers

210 search results - page 28 / 42
» Definability and automorphisms in abstract logics
Sort
View
CSL
2008
Springer
13 years 9 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
DEXA
2008
Springer
111views Database» more  DEXA 2008»
13 years 9 months ago
Translating SQL Applications to the Semantic Web
Abstract. The content of most Web pages is dynamically derived from an underlying relational database. Thus, the success of the Semantic Web hinges on enabling access to relational...
Syed Hamid Tirmizi, Juan Sequeda, Daniel P. Mirank...
FOIKS
2008
Springer
13 years 9 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...
CSAC
2006
13 years 9 months ago
Toward a Pi-Calculus Based Verification Tool for Web Services Orchestrations
Abstract. Web services constitute a dynamic field of research about technologies of the Internet. WS-BPEL 2.0, is in the way for becoming a standard for defining Web services orche...
Faisal Abouzaid
JISBD
2001
13 years 9 months ago
Migration of Legacy Systems to the Web
Migration of Legacy Systems to the Web is one of the main concerns of enterprises looking for more flexible distributed application environments. This migration process comprises t...
Cristina Cachero, Jaime Gómez, Antonio P&aa...