Sciweavers

86 search results - page 3 / 18
» Classical BI: Its Semantics and Proof Theory
Sort
View
WWW
2004
ACM
14 years 6 months ago
CTR-S: a logic for specifying contracts in semantic web services
A requirements analysis in the emerging field of Semantic Web Services (SWS) (see http://daml.org/services/swsl/requirements/) has identified four major areas of research: intelli...
Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan
WOLLIC
2009
Springer
13 years 12 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
ENTCS
2006
124views more  ENTCS 2006»
13 years 5 months ago
Generic Trace Theory
Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of "non-determinism" such as classical ...
Ichiro Hasuo, Bart Jacobs, Ana Sokolova
JLP
2011
106views more  JLP 2011»
12 years 8 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...
JLP
2010
59views more  JLP 2010»
13 years 1 days ago
The proof monad
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
Florent Kirchner, César Muñoz