Sciweavers

1587 search results - page 89 / 318
» The Semantics of Extended SOFL
Sort
View
LPNMR
2007
Springer
14 years 3 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
SEMWEB
2004
Springer
14 years 2 months ago
SWS for Financial Overdrawn Alerting
Abstract. In this paper, we present a Notification Agent designed and implemented using Semantic Web Services. The Notification Agent manages alerts when critical financial situati...
José Manuel López Cobo, Silvestre Lo...
BIRTHDAY
2000
Springer
14 years 1 months ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
ICALP
2000
Springer
14 years 17 days ago
Reasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
Dan R. Ghica, Guy McCusker
APAL
2008
104views more  APAL 2008»
13 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy