Sciweavers

1005 search results - page 11 / 201
» Operational Semantics and Program Equivalence
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
POPL
2005
ACM
14 years 7 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela
APAL
2008
104views more  APAL 2008»
13 years 7 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
ASP
2003
Springer
14 years 22 days ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
ICFP
2000
ACM
13 years 12 months ago
An operational semantics for parallel lazy evaluation
Ï ÔÖ × ÒØ Ò ÓÔ Ö Ø ÓÒ Ð × Ñ ÒØ × ÓÖ Ô Ö ÐÐ Ð Ð ÞÝ Ú Ð¹ Ù Ø ÓÒ Ø Ø ÙÖ Ø ÐÝ ÑÓ Ð× Ø Ô Ö ÐÐ Ð Ú ÓÙÖ Ó Ø ÒÓÒ¹×ØÖ ...
Clement A. Baker-Finch, David J. King, Philip W. T...