Sciweavers

1360 search results - page 131 / 272
» Reasoning on Workflow Executions
Sort
View
ICLP
2010
Springer
14 years 2 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...
ICLP
1995
Springer
14 years 1 months ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...
PLDI
2012
ACM
12 years 18 days ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
CADE
2007
Springer
14 years 10 months ago
A History-based Verification of Distributed Applications
Safety and security guarantees for individual applications in general depend on assumptions on the given context provided by distributed instances of operating systems, hardware pl...
Bruno Langenstein, Andreas Nonnengart, Georg Rock,...
JAPLL
2008
91views more  JAPLL 2008»
13 years 10 months ago
Undoing the effects of action sequences
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
Thomas Eiter, Esra Erdem, Wolfgang Faber