1360 search results - page 188 / 272 » Reasoning on Workflow Executions |
144
Voted
PLILP
1994
Springer
15 years 7 months ago
1994
Springer
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
133
Voted
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
126
Voted
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
130
Voted
CSL
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s sh...
141
click to vote
ICLP
1995
Springer
15 years 7 months ago
1995
Springer
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...